Multi-resource routing with flexible tasks: an application in drayage operations

References

• Anon . 1996 . “ United States Department of Transportation—Federal Highway Administration ” . In Case study: Improving mobility in the Chicago region http://www.fhwa.dot.gov/freightplanning/chicago.html
   Google Scholar
• Ball , M. , Golden , B. , Assad , A. and Bodin , L. 1983 . Planning for truck fleet size in the presence of common-carrier options . Decision Sciences , 14 ( 1 ) : 103 – 120 . [CSA]
   Google Scholar
• Bodin , L. , Mingozzi , A. , Baldacci , R. and Ball , M. 2000 . The roll-on, roll-off vehicle routing problem . Transportation Science , 34 ( 3 ) : 271 – 288 . [CSA] [CROSSREF]
   Web of Science ®Google Scholar
• Campbell , A. and Savelsbergh , M. 2004 . Efficiently handling practical complexities in insertion heuristics . Transportation Science , 38 ( 3 ) : 369 – 378 . [CSA] [CROSSREF]
   Web of Science ®Google Scholar
• Clarke , G. and Wright , J. 1964 . Scheduling of vehicles from a central depot to a number of delivery points . Operations Research , 12 : 568 – 581 . [CSA]
   Web of Science ®Google Scholar
• Corinescu , E. 2003 . “ Personal communication on drayage data files from 2002 for Hub City Terminals, Inc. ” .
   Google Scholar
• Cullen , F. , Jarvis , J. and Ratliff , H. 1981 . Set partitioning based heuristics for interactive routing . Networks , 11 : 125 – 143 . [CSA]
   Web of Science ®Google Scholar
• Dahnke , B. 2003 . “ Personal communication on drayage data files from 1998 for Laser Trucking ” .
   Google Scholar
• De Meulemeester , L. , Laporte , G. , Louveaux , F. and Semet , F. 1997 . Optimal sequencing of skip collections . Journal of the Operational Research Society , 48 : 57 – 64 . [CSA] [CROSSREF]
   Web of Science ®Google Scholar
• Desrochers , M. , Desrosiers , J. and Solomon , M. 1992 . A new optimization algorithm for the vehicle routing problem with time windows . Operations Research , 40 ( 2 ) : 342 – 354 . [CSA]
   Web of Science ®Google Scholar
• Dror , M. 1994 . Note on the complexity of the shortest path problem with resource constraints for column generation in VRPTW . Operations Research , 42 : 977 – 978 . [CSA]
   Web of Science ®Google Scholar
• Dumas , Y. , Desrosiers , J. and Soumis , F. 1991 . The pickup and delivery problem with time windows . European Journal of Operational Research , 54 : 7 – 22 . [CSA] [CROSSREF]
   Web of Science ®Google Scholar
• Feillet , D. , Dejax , P. , Gendreau , M. and Gueguen , C. 2004 . An exact algorithm for elementary shortest path problems with resource constraints: application to some vehicle routing problems . Networks , 44 ( 3 ) : 216 – 229 . [CSA] [CROSSREF]
   Web of Science ®Google Scholar
• Francis , P. , Smilowitz , K. and Zhang , G. 2004 . Improved modeling and solution methods for the multi-resource routing problem , Working paper 04-003 Evanston, IL, , USA : Northwestern University . 60208
   Google Scholar
• Grosz , J. 2003 . “ Personal communications on drayage data files for Cushing Transportation, Inc. ” .
   Google Scholar
• Ioannou , P. , Chassiakos , A. , Jula , H. and Unglaub , R. 2002 . Dynamic optimization of cargo movement by trucks in metropolitan areas with adjacent ports , Research report Los Angeles, CA, , USA : METRANS Transportation Center, University of Southern California . 90089
   Google Scholar
• Irnich , S. and Villeneuve , D. 2003 . The shortest path problem with resource constraints and k-cycle elimination for k ≥ 3 , Technical report, Les Cahiers du GERAD G-2003-55 Montréal, , Canada : École des Hautes Études Commerciales .
   Google Scholar
• Morlok , E. K. and Spasovic , L. N. 1994 . Approaches for improving drayage in rail-truck intermodal service , Research report Philadelphia, PA, , USA : University of Pennsylvania . 19104
   Google Scholar
• Neuman , C. and Smilowitz , K. 2002 . “ Strategies for coordinated drayage movements ” . In NSF Real Time Logistics Workshop Edited by: Mirchandani , P. and Hall , R. D1-1 – D-7 . Long Beach, CA
   Google Scholar
• Powell , W. 2002 . “ Dynamic models of transportation operations ” . In Handbooks in Operations Research, Volume on Supply Chain Management , Edited by: Graves , S. and de Tok , T. A.G. 555 – 635 . Amsterdam : Elsevier .
   Google Scholar
• Savelsbergh , M. and Sol , M. 1995 . The general pickup and delivery problem . Transportation Science , 29 : 17 – 29 . [CSA]
   Web of Science ®Google Scholar
• Savelsbergh , M. and Sol , M. 1998 . DRIVE: Dynamic routing of independent vehicles . Operations Research , 46 : 474 – 490 . [CSA]
   Web of Science ®Google Scholar
• Sinha , P. and Zoltners , A. 1979 . The multiple choice knapsack problem . Operations Research , 27 : 503 – 515 . [CSA]
   Web of Science ®Google Scholar
• Xu , H. , Chen , Z. -L. , Rajagopal , S. and Arunapuram , S. 2003 . Solving a practical pickup and delivery problem . Transportation Science , 37 ( 3 ) : 347 – 364 . [CSA] [CROSSREF]
   Web of Science ®Google Scholar