A less-than-truckload carrier collaboration planning problem under dynamic capacities

Transportation Research Part E: Logistics and Transportation Review

Volumn 47, Issue 6, 2011, Pages 933-946

  Hernández, Salvador ^a   Peeta, Srinivas ^b   Kalafatas, George ^c  

^a 500 W University Avenue   (United States)

^b PURDUE UNIVERSITY   (United States)

^c NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

Collaborative logistics; Freight transportation; Less than truckload trucking; Minimum cost flow

Indexed keywords

COSTS; ECONOMIC AND SOCIAL EFFECTS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; TRUCK TRANSPORTATION; TRUCKS;

BRANCH-AND-CUT ALGORITHMS; CARRIER COLLABORATION; COLLABORATION PLANNING; COLLABORATIVE LOGISTICS; DETERMINISTICS; DYNAMIC CAPACITY; LESS-THAN-TRUCKLOAD; LESS-THAN-TRUCKLOAD TRUCKING; MINIMUM COST FLOWS; PLANNING PROBLEM;

FREIGHT TRANSPORTATION;

ALGORITHM; COST-BENEFIT ANALYSIS; FREIGHT TRANSPORT; NUMERICAL METHOD; SMALL AND MEDIUM-SIZED ENTERPRISE; TRADE-OFF; TRANSPORTATION PLANNING; TRUCKING;

EID: 79960967452     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2011.03.001     Document Type: Article

References (24)

1. Agarwal R., Ergun Ö. Ship scheduling and network design for cargo routing in liner shipping. Transportation Science 2008, 42(2):175-196.
2. Agarwal, R., Ergun, O., in preparation. Network design and allocation mechanism for carrier alliances in liner shipping. Operations Research.
3. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows: Theory, Algorithms, and Applications 1993, Prentice Hall, Upper Saddle River, New Jersey.
4. Aronson J.E. Survey of dynamic network flows. Annals of Operations Research 1989, 20:1-66.
5. Bartholdi J.J., Gue K.R. Reducing labor costs in an LTL crossdocking terminal. Operations Research 2000, 48(6):823-832.
6. Belman D., White C. Trucking in the Age of Information 2005, Ashgate Publishing Company, Burlington, VT.
7. Boardman, B.S., 1997. Real-time Routing of Shipments Considering Transfer Costs and Shipment Characteristics. PhD Dissertation. University of Arkansas.
8. Caprara A., Fischetti M. Branch and cut algorithms. Annotated Bibliographies in Combinatorial Optimization 1997, 46-64. John Wiley, (Chapter 4). M. Dell'Amico, F. Maoli, S. Martello (Eds.).
9. Cheung R.K., Muralidharan B. Dynamic routing for priority shipments in LTL service networks. Transportation Science 2000, 34(1):86-98.
10. Esper, T.L., Williams, L.R., 2003. The value of collaborative transportation management (CTM): its relationship to CPFR and information technology. Transportation Journal, ABI/INFORM Global, 55-65.
11. Figliozzi, M.A., 2006. Analysis and Evaluation of Incentive Compatible Dynamic Mechanism for Carrier Collaboration. Transportation Research Record: Journal of the Transportation Research Board, No. 1966, Transportation Research Board of the National Academies, Washington, DC, pp. 34-40.
12. Golob T.F., Regan A.C. Impacts of highway congestion on freight operation: perceptions of trucking industry managers. Transportation Research Part A: Policy and Practice 2001, 35(7):577-599.
13. Hall A., Hippler S., Skutella M. Multicommodity flows over time: efficient algorithms and complexity. Theoretical Computer Science 2007, 379:387-404.
14. Hernandez, S., Peeta, S., 2010. Static single carrier collaboration problem for less-than-truckload carriers. In: Proceedings of the 89th Annual Meeting of the Transportation Research Board, Washington, DC.
15. Hindim K.S., Basta T. Efficient solution of multiproduct, two-stage distribution-location problem. The Journal of the Operational Research Society 1994, 45(11):1316-1323.
16. Kawamura, K., 1999. Commercial Vehicle Value of Time and Perceived Benefit of Congestion Pricing. PhD Dissertation, University of California, Berkeley.
17. Krajewska M.A., Kopfer H., Laporte G., Ropke S., Zaccour G. Horizontal cooperation among freight carriers: request allocation and profit sharing. Journal of the Operational Research Society 2008, 59(11):1483-1491.
18. Kuo, A., Miller-Hooks, E., Zhang, K., Mahmassani, H., 2008. Train Slot Cooperation in Multicarrier, International Rail-Based Intermodal Freight Transport. Transportation Research Record: Journal Transportation Research Board, No. 2043, Transportation Research Board of the National Academies, Washington, DC, pp. 31-40.
19. Martin R.K. Large Scale Linear and Integer Optimization: A Unified Approach 1999, Kluwer Academic Publishers, Norwell, Massachusetts.
20. Mitrović-Minić S., Krishnamurti R., Laporte G. Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Research Part B 2004, 38(8):660-685.
21. Mitchell J.E. Branch-and-cut algorithms for combinatorial optimization problems. Handbook of Applied Optimization 2002, Oxford University Press, Inc., New York, NY. P.M. Pardoslos, M.G.C. Resende (Eds.).
22. Peeta S., Mahmassani H.S. Multiple user classes real-time traffic assignment for on-line operations: a rolling horizon solution framework. Transportation Research Part C 1995, 3(2):83-98.
23. Song, J., Regan, A., 2004. An auction based collaborative carrier network. In: Proceedings of the 83rd Annual Meeting of the Transportation Research Board, Washington, DC.
24. Taylor G.D., Harit S., English J.R., Whicker G.L. Hub and spoke networks in truckload trucking: configuration, testing and operational concerns. The Logistics and Transportation Review 1995, 31(3):209-237.