Collaborative transportation planning (CTP) within a coalition of small and medium-sized freight carriers can be used as a powerful instrument to improve the operational efficiency of the coalition members. In such coalitions, transportation requests from different carriers are exchanged in order to reduce the total fulfillment costs. In this paper, the CTP for a set of independent carriers exchanging less-than-truckload transportation requests is considered. The realistic restriction that all collaborating partners have only limited capacities in their fleets is included in the consideration. To keep their autonomy, coalition members keep their sensitive information including customer payments and cost structures unexposed during CTP. A new decentralized request exchange mechanism for CTP is proposed while only vehicle routes are considered for exchange. It is tested on some newly generated instances and the CTP solutions are compared with those obtained by isolated planning without collaboration and those obtained by a heuristic approach for the centralized planning problem. The results indicate that our mechanism is very efficient and effective in terms of realizing potential cost-savings by CTP, even when capacity limitations and restrictions on the exposure of information are explicitly considered.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Bent R, van Hentenryck P (2003) A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. In: Lecture notes in computer science 2833/2003. Principles and practice of constraint programming—CP 2003, pp 123–137
Berger S, Bierwirth C (2010) Solutions to the request reassignment in collaborative carrier networks. Transp Res E 46:627–638
Butt S, Ryan D (1999) An optimal solution procedure for the multiple tour maximum collection problem using column generation. Comput Oper Res 26:427–441
Cordeau JF, Desaulniers G, Desrosiers J, Solomon M, Soumis F (2002) VRP with time windows. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM monographs on discrete mathematics and applications, vol 9. SIAM, Philadelphia, pp157–194
Cruijssen F, Salomon M (2004) Empirical study: order sharing between transportation companies may result in cost reductions between 5 to 15 percent. In: CentER discussion paper no. 2004–80
Cruijssen F, Bräysy O, Dullaert W, Fleuren H, Salomon M (2007a) Joint route planning under varying market conditions. Int J Phys Distrib Logist Manag 37:287–304
Cruijssen F, Cools M, Dullaert W (2007b) Horizontal cooperation in logistics: opportunities and impediments. Transport Res E 43:129–142
Cruijssen F, Dullaert W, Fleuren H (2007c) Horizontal cooperation in transport and logistics: a literature review. Transport J 46:22–39
Desaulniers G, Desrosiers J, Erdmann A, Solomon M, Soumis F (2002) VRP with pickup and delivery. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM monographs on discrete mathematics and applications, vol 9. SIAM, Philadelphia, pp 225–242
Dumas Y, Desrosiers J, Soumis F (1991) The pickup and delivery problem with time windows. Eur J Oper Res 54:7–22
Feillet D, Dejax P, Gendreau M (2005) Traveling salesman problem with profits. Transport Sci 39:188–205
Kopfer H, Pankratz G (1999) Das groupage-problem kooperierender Verkehrsträger. In: Kall P, Lüthi HJ (eds) Operational research proceedings 1998. Springer, Berlin, pp 453–462
Kopfer H, Wang X (2009) Combining vehicle routing with forwarding—extension of the vehicle routing problem by different types of subcontraction. J Korean Inst Indust Eng 35:1–14
Krajewska M, Kopfer H (2006) Collaborating freight forwarding enterprises—request allocation and profit sharing. OR Spectr 28:301–317
Krajewska M, Kopfer H (2009) Transportation planning in freight forwarding companies—tabu search algorithm for the integrated operational transportation planning problem. Eur J Oper Res 197:741–751
Krajewska M, Kopfer H, Laporte G, Ropke S, Zaccour G (2008) Horizontal cooperation of freight carriers: request allocation and profit sharing. J Oper Res Soc 59:1483–1491
Lee CG, Kwon RH, Ma Z (2007) A carrier’s optimal bid generation problem in combinatorial auctions for transportation procurement. Transport Res E 43:173–191
Li H, Lim A (2001) A metaheuristic for the pickup and delivery problem with time windows. In: ICTAI-2001, the 13th IEEE conference on tools with artificial intelligence, Dallas, pp 160–170
Özener OO, Ergun O, Savelsbergh M (2011) Lane-exchange mechanisms for truckload carrier collaboration. Transport Sci 45:1–17
Parragh S, Doerner K, Hartl R (2008) A survey on pickup and delivery problems Part II: transportation between pickup and delivery locations. J für Betriebswirtschaft 58:81–117
Potvin JY, Rousseau JM (1993) A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur J Oper Res 66:331–340
Renaud J, Boctor F, Ouenniche J (2000) A heuristic for the pickup and delivery traveling salesman problem. Comput Oper Res 27:905–916
Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transport Sci 40:445–472
Schönberger J (2005) Operational freight carrier planning. Springer, Berlin, pp 135–148
Schwind M, Gujo O, Vykoukal J (2009) A combinatorial intra-enterprise exchange for logistics services. Inform Syst E-Bus Manag 7:447–471
Sigurd M, Pisinger D, Sig M (2004) Scheduling transportation of live animals to avoid the spread of diseases. Transport Sci 38:197–209
Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constrains. Oper Res 35:254–265
Song J, Regan A (2005) Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts. Transport Res E 39:914–933
Stadtler H (2009) A framework for collaborative planning and state-of-the-art. OR Spectr 31:5–30
Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J Finance 16:8–37
Wang X, Kopfer H (2011) Increasing efficiency of freight carriers through collaborative transport planning: chances and challenges. In: Ivanov D, Kopfer H, Haasis HD, Schönberger J (eds) Dynamics and sustainability in international logistics and supply chain management. Proceedings of the 6th German–Russian logistics and SCM workshop (DR-LOG 2011). Cuvillier Verlag, Göttingen, pp 41–50
This research was supported by the German Research Foundation (DFG) as part of the project “Kooperative Rundreiseplanung bei rollierender Planung”.
Appendix: CTP instance generation information
Appendix: CTP instance generation information
CTP test instances are generated by combining different PDPTW benchmark instances generated by Li and Lim (2001). Table 3 gives the information how these instances are generated. The second column \(m\) shows how many PDPTW instances are united. The following columns give the detailed information of each used PDPTW instance in the format “PDPTW_instance \((\Delta X, \Delta Y)\) [number of vehicles]”.
About this article
Cite this article
Wang, X., Kopfer, H. Collaborative transportation planning of less-than-truckload freight. OR Spectrum 36, 357–380 (2014). https://doi.org/10.1007/s00291-013-0331-x
- Collaborative transportation planning
- Request exchange
- Freight carrier coalition
- Request selection and pickup and delivery problem with time windows