Solving an integrated operational transportation planning problem with forwarding limitations

In integrated operational transportation planning (IOTP) problems, the traditional vehicle routing problem is extended by using external resources for the fulfillment of transportation requests. IOTP is getting more complex when the choice of the fulfillment mode is limited for some requests. In this paper, an existing column generation-based heuristic for IOTP is extended by two strategies for handling forwarding limitations. The computational experiments indicate that one of the extended versions of the heuristic outperforms all previous approaches in literature. Further on, the impact of forwarding limitations on different location structures and on the size of the private fleet is analyzed.

[1]  Daniele Vigo,et al.  An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping , 2013, Transp. Sci..

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

[3]  Hokey Min,et al.  A personal-computer assisted decision support system for private versus common carrier selection , 1998 .

[4]  Amelia C. Regan,et al.  An Auction Based Collaborative Carrier Network , 2003 .

[5]  Terrance Pohlen,et al.  Evaluating the Private Fleet , 2008, Transportation Journal.

[6]  Jozef Kratica,et al.  A genetic algorithm for the routing and carrier selection problem , 2012, Comput. Sci. Inf. Syst..

[7]  Xin Wang,et al.  Collaborative transportation planning of less-than-truckload freight , 2014, OR Spectr..

[8]  Jacques Renaud,et al.  A heuristic for the routing and carrier selection problem , 2007, Eur. J. Oper. Res..

[9]  Andrew Lim,et al.  A metaheuristic for the pickup and delivery problem with time windows , 2001, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001.

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

[11]  Xin Wang,et al.  Rolling horizon planning for a dynamic collaborative routing problem with full-truckload pickup and delivery requests , 2015 .

[12]  John G. Klincewicz,et al.  Fleet Size Planning when Outside Carrier Services Are Available , 1990, Transp. Sci..

[13]  Özlem Ergun,et al.  Network Design and Allocation Mechanisms for Carrier Alliances in Liner Shipping , 2010, Oper. Res..

[14]  Martin W. P. Savelsbergh,et al.  Reducing Truckload Transportation Costs Through Collaboration , 2007, Transp. Sci..

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

[16]  R. Ramesh,et al.  The Distribution Problem with Carrier Service: A Dual Based Penalty Approach , 1995, INFORMS J. Comput..

[17]  Gilbert Laporte,et al.  A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers , 2008, J. Oper. Res. Soc..

[18]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[19]  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..

[20]  Ching-Wu Chu,et al.  A heuristic algorithm for the truckload and less-than-truckload problem , 2005, Eur. J. Oper. Res..

[21]  Jean-Yves Potvin,et al.  Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier , 2011, J. Oper. Res. Soc..

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

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

[24]  Tore Grünert,et al.  Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration , 2005, J. Heuristics.

[25]  Chris Clifton,et al.  An Approach to Securely Identifying Beneficial Collaboration in Decentralized Logistics Systems , 2008, Manuf. Serv. Oper. Manag..

[26]  Lawrence Bodin,et al.  PLANNING FOR TRUCK FLEET SIZE IN THE PRESENCE OF A COMMON‐CARRIER OPTION , 1983 .

[27]  Mario Ziebuhr,et al.  The Integrated Operational Transportation Planning Problem with Compulsory Requests , 2014, ICCL.

[28]  Xiao Liu,et al.  Task Selection and Routing Problems In Collaborative Truckload Transportation , 2010 .

[29]  Jean-Yves Potvin,et al.  A tabu search heuristic for the vehicle routing problem with private fleet and common carrier , 2009, Eur. J. Oper. Res..

[30]  Xin Wang,et al.  Operational transportation planning of freight forwarding companies in horizontal coalitions , 2014, Eur. J. Oper. Res..

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

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

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

[34]  Thibaut Vidal,et al.  Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits , 2014, Transp. Sci..

[35]  Gerrit K. Janssens,et al.  Collaborative Logistics from the Perspective of Road Transportation Companies , 2013 .

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