Collaborative transportation planning of less-than-truckload freight

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.

[1]  Herbert Kopfer,et al.  Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem , 2009, Eur. J. Oper. Res..

[2]  Jacques Desrosiers,et al.  VRP with Pickup and Delivery , 2000, The Vehicle Routing Problem.

[3]  Xin Wang,et al.  Combining Vehicle Routing with Forwarding , 2009 .

[4]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[5]  Steven E. Butt,et al.  An optimal solution procedure for the multiple tour maximum collection problem using column generation , 1999, Comput. Oper. Res..

[6]  David Pisinger,et al.  Scheduling Transportation of Live Animals to Avoid the Spread of Diseases , 2004, Transp. Sci..

[7]  Russell Bent,et al.  A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows , 2006, Comput. Oper. Res..

[8]  Michael Schwind,et al.  A combinatorial intra-enterprise exchange for logistics services , 2009, Inf. Syst. E Bus. Manag..

[9]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[10]  Giselher Pankratz,et al.  Das Groupage-Problem kooperierender Verkehrsträger , 1999 .

[11]  Sven de Vries,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..

[12]  Jörn Schönberger Operational Freight Carrier Planning: Basic Concepts, Optimization Models and Advanced Memetic Algorithms , 2005 .

[13]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

[14]  Herbert Kopfer,et al.  Collaborating freight forwarding enterprises , 2006, OR Spectr..

[15]  W. Dullaert,et al.  Horizontal cooperation in logistics : Opportunities and impediments , 2007 .

[16]  Zhong Ma,et al.  A Carrier's Optimal Bid Generation Problem in Combinatorial Auctions for Transportation Procurement , 2007 .

[17]  A. Regan,et al.  Approximation Algorithms for the Bid Construction Problem in Combinatorial Auctions for the Procurement of Freight Transportation Contracts , 2003 .

[18]  Andrew Lim,et al.  A Metaheuristic for the Pickup and Delivery Problem with Time Windows , 2003, Int. J. Artif. Intell. Tools.

[19]  Michel Gendreau,et al.  Combinatorial auctions , 2007, Ann. Oper. Res..

[20]  Xin Wang,et al.  INCREASING EFFICIENCY OF FREIGHT CARRIERS THROUGH COLLABORATIVE TRANSPORT PLANNING : CHANCES AND CHALLENGES , 2010 .

[21]  Michel Gendreau,et al.  Traveling Salesman Problems with Profits , 2005, Transp. Sci..

[22]  Hartmut Stadtler,et al.  A framework for collaborative planning and state-of-the-art , 2009, OR Spectr..

[23]  Marc Salomon,et al.  Joint Route Planning Under Varying Market Conditions , 2006 .

[24]  Herbert Kopfer,et al.  Collaborating freight forwarding enterprises Request allocation and profit sharing , 2007 .

[25]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[26]  Jacques Renaud,et al.  A heuristic for the pickup and delivery traveling salesman problem , 2000, Comput. Oper. Res..

[27]  Herbert Kopfer,et al.  Efficiency of Transport Collaboration Mechanisms , 2009 .

[28]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[29]  Martin W. P. Savelsbergh,et al.  Lane-Exchange Mechanisms for Truckload Carrier Collaboration , 2011, Transp. Sci..

[30]  Russell Bent,et al.  A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows , 2003, Comput. Oper. Res..

[31]  Christian Bierwirth,et al.  Solutions to the request reassignment problem in collaborative carrier networks , 2010 .

[32]  W. Dullaert,et al.  Horizontal Cooperation in Transport and Logistics: A Literature Review , 2007, Transportation Journal.

[33]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[34]  Gilbert Laporte,et al.  Horizontal cooperation among freight carriers: request allocation and profit sharing , 2008, J. Oper. Res. Soc..

[35]  Marc Salomon,et al.  Empirical Study: Order Sharing between Transportation Companies May Result in Cost Reductions between 5 to 15 Percent , 2004 .

[36]  Jean-François Cordeau,et al.  VRP with Time Windows , 1999, The Vehicle Routing Problem.