Synchronized routing of active and passive means of transport

This paper addresses a routing problem where the fulfillment of transport requests requires two types of transport resources, namely, passive and active means of transport. The passive means are used for holding the cargo that is to be shipped from pickup to delivery locations. The active means take up the passive means and carry them from one location to another. Compared to classical vehicle routing problems, the additional challenge in this combined routing problem is that the operations of both transport resources have to be synchronized. In this paper, we provide a modeling approach for the joint routing of passive and active means of transport. We solve the problem by large neighborhood search meta-heuristics that utilize various problem-specific components, for example local search techniques for the routes of active and passive means. A computational study on a large set of benchmark instances is used for assessing the performance of the meta-heuristics.

[1]  Klaus Fischer,et al.  Holonic transport scheduling with teletruck , 2000, Appl. Artif. Intell..

[2]  M. A. Forbes,et al.  Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post , 2006, Eur. J. Oper. Res..

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

[4]  Jin-Kao Hao,et al.  Simultaneous vehicle and driver scheduling: A case study in a limousine rental company , 2007, Comput. Ind. Eng..

[5]  Michael Drexl,et al.  On some generalized routing problems , 2007 .

[6]  Mikael Rönnqvist,et al.  Combined vehicle routing and scheduling with temporal precedence and synchronization constraints , 2008, Eur. J. Oper. Res..

[7]  Stefan Irnich,et al.  Vehicle Routing Problems with Inter-Tour Resource Constraints , 2008 .

[8]  Warren B. Powell,et al.  An attribute–decision model for cross-border drayage problem , 2008 .

[9]  Guy Desaulniers,et al.  A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows , 2009, Networks.

[10]  Guy Desaulniers,et al.  Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows , 2008, Oper. Res..

[11]  Martín Matamala,et al.  The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method , 2010, Eur. J. Oper. Res..

[12]  Byung-In Kim,et al.  The combined manpower-vehicle routing problem for multi-staged services , 2010, Expert Syst. Appl..

[13]  Ruiyou Zhang,et al.  Heuristic-based truck scheduling for inland container transportation , 2010, OR Spectr..

[14]  C. K. Y. Lin,et al.  A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources , 2011, Comput. Oper. Res..

[15]  Jean-Charles Billaut,et al.  A tabu search heuristic for the dynamic transportation of patients between care units , 2011, Eur. J. Oper. Res..

[16]  Daniele Vigo,et al.  The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics , 2011, Transp. Sci..

[17]  Ulrich Derigs,et al.  Solving a real-world vehicle routing problem with multiple use of tractors and trailers and EU-regulations for drivers arising in air cargo road feeder services , 2011, Eur. J. Oper. Res..

[18]  Michael Drexl,et al.  Synchronization in Vehicle Routing - A Survey of VRPs with Multiple Synchronization Constraints , 2012, Transp. Sci..

[19]  Julia Rieck,et al.  Simultaneous Vehicle and Crew Routing and Scheduling for Partial- and Full-Load Long-Distance Road Transport , 2013 .