Models for minimizing backhaul costs through freight collaboration

Transportation Research Record

Volumn , Issue 2224, 2011, Pages 51-60

  Bailey, Erin ^a   Unnikrishnan, Avinash ^a   Lin, Dung Ying ^b  

^a West Virginia University   (United States)

^b NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COST ACCOUNTING; HEURISTIC METHODS; INTEGER PROGRAMMING; NUMERICAL ANALYSIS; SHIPS; TABU SEARCH; TRUCKS;

GREEDY HEURISTICS; INNOVATIVE SOLUTIONS; INTEGER PROGRAM; MARGINAL COSTS; MIXED-INTEGER PROGRAMS; OPERATIONAL EFFICIENCIES; OPTIMIZATION MODELS; REAL-WORLD; SOLUTION METHODOLOGY; TRUCKING INDUSTRY;

COST BENEFIT ANALYSIS;

EID: 80053603760     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/2224-07     Document Type: Article

References (26)

1. Cambridge Systematics, Inc. National Rail Freight Infrastructure Capacity and Investment Study. Association of American Railroads, Washington, D.C., Sept. 2007.
2. Hernández, S., and P. Srinivas. Less-than-Truckload Static Single-Carrier Collaboration Problem. Presented at 89th Annual Meeting of the Transportation Research Board, Washington, D.C., 2010.
3. Chu, C. W. A Heuristic Algorithm for the Truckload and Less-than-Truckload Problem. European Journal of Operational Research, Vol. 165, No. 3, 2005, pp. 657-667.
4. Ball, M. O., B. L. Golden, A. A. Assad, and L. D. Bodin. Planning for Truck Fleet Size in the Presence of a Common-Carrier Option. Decision Sciences, Vol. 14, No. 1, 1983, pp. 103-120.
5. Song, J., and A. Regan. An Auction Based Collaborative Carrier Network. Presented at 83rd Annual Meeting of the Transportation Research Board, Washington, D.C., 2004.
6. Figliozzi, M. A. Analysis and Evaluation of Incentive-Compatible Dynamic Mechanism for Carrier Collaboration. In Transportation Research Record: Journal of the Transportation Research Board, No. 1996, Transportation Research Board of the National Academies, Washington, D.C., 2006, pp. 34-40. (Pubitemid 46479349)
7. Dai, B., and H. Chen. Mathematical Model and Solution Approach for Collaborative Logistics in Less Than Truckload (LTL) Transportation. Computers & Industrial Engineering, 2009, pp. 767-772.
8. Berger, S., and C. Bierwirth. Solutions to the Request Reassignment Problem in Collaborative Carrier Networks. Transportation Research Part E, Vol. 46, No. 5, 2010, pp. 627-638.
9. Ergun, Ö., G. Kuyzu, and M. Savelsbergh. Shipper Collaboration. Computers and Operation Research, Vol. 34, No. 6, 2007, pp. 1551-1560. (Pubitemid 44556981)
10. Özener, Ö., and Ö. Ergun. Allocating Costs in a Collaborative Transportation Procurement Network. Transportation Science, Vol. 42, No. 2, May 2008, pp. 146-165.
11. Ergun, Ö., G. Kuyzu, and M. Savelsbergh. Reducing Truckload Transportation Costs Through Collaboration. Transportation Science, Vol. 14, No. 2, May 2007, pp. 206-221.
12. Agarwal, R., Ö. Ergun, and J. Sokol. Network Design and Allocation Mechanism for Carrier Alliances in Liner Shipping. http://www2.isye. gatech.edu/∼oergun/publications/ErgunPaper5Alliance-OR.pdf. Accessed July 2010.
13. Agarwal, R., and Ö. Ergun. Mechanism Design for a Multicommodity Flow Game in Service Network Alliances. Operational Research Letters, Vol. 36, No. 5, 2008, pp. 520-524.
14. Houghtalen, L., Ö. Ergun, and J. Sokol. Designing Mechanisms for the Management of Carrier Alliances. http://www2.isye.gatech.edu/∼oergun/ publications/AirAlliance-MS.pdf. Accessed July 2010.
15. Arcelus, F. J., H. A. Eiselt, and E. Y. H. Lin. Minimizing Empty Hauls in Multi-Day, Multi-Depot Trucking. International Transactions Operational Research, Vol. 5, No. 3, 1998, pp. 201-210. (Pubitemid 128127066)
16. Jordan, W. Truck Backhauling on Networks with Many Terminals. Transportation Research Part B, Vol. 21, No. 3, 1987, pp. 183-193. (Pubitemid 17601915)
17. Goetschalckx, M., and C. Jacon-Blecha. The Vehicle Routing Problem with Backhauls. European Journal of Operations Research, Vol. 42, No. 1, 1989, pp. 39-51.
18. Toth, P., and D. Vigo. A Heuristic Algorithm for the Symmetric and Asymmetric Vehicle Routing Problems with Backhauls. European Journal of Operational Research, Vol. 113, No. 3, 1999, pp. 528-543.
19. Dumas, Y., J. Desrosiers, and F. Soumis. The Pickup and Delivery Problem with Time Windows. European Journal of Operational Research, Vol. 54, No. 1, 1991, pp. 7-22. (Pubitemid 21712574)
20. Nagy, G., and S. Salhi. Heuristic Algorithms for Single and Multiple Depot Vehicle Routing Problems with Pickups and Deliveries. European Journal of Operational Research, Vol. 162, No. 1, 2005, pp. 126-141.
21. Toth, P., and D. Vigo, eds. The Vehicle Routing Problem. In SIAM Monographs on Discrete Mathematics and Applications, Vol. 9, Society for Industrial and Applied Mathematics, Philadelphia, Pa., 2001.
22. Gendreau, M., A. Hertz, and G. Laporte. A Tabu Search Heuristic for the Vehicle Routing Problem. Management Science, Vol. 40, No. 10, 1991, pp. 1276-1290.
23. Taillard, É., P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin. A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. Transportation Science, Vol. 31, No. 2, 1997, pp. 170-186. (Pubitemid 127597092)
24. Cordeau, J. F., M. Gendreau, and G. Laporte. A Tabu Search Heuristic for Periodic and Multi-Depot Vehicle Routing Problems. Networks, Vol. 30, No. 2, 1998, pp. 105-119.
25. Glover, F. Tabu Search: A Tutorial. Interfaces, Vol. 20, No. 4, 1990, pp. 74-94.
26. Hours-of-Service Regulations. Federal Motor Carrier Safety Administration, U.S. Department of Transportation. http://www.fmcsa.dot.gov/ rules-regulations/topics/hos/index.htm. Accessed May 2010.