Scheduling for Transfers in Pickup and Delivery Problems with Very Large Neighborhood Search

In pickup and delivery problems (PDPs), vehicles pickup and deliver a set of items under various constraints. We address the PDP with Transfers (PDP-T), in which vehicles plan to transfer items between one another to form more efficient schedules. We introduce the Very Large Neighborhood Search with Transfers (VLNS-T) algorithm to form schedules for the PDP-T. Our approach allows multiple transfers for items at arbitrary locations, and is not restricted to a set of predefined transfer points. We show that VLNS-T improves upon the best known PDP solutions for benchmark problems, and demonstrate its effectiveness on problems sampled from real world taxi data in New York City.

[1]  J. Wesley Barnes,et al.  Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .

[2]  Ali Haghani,et al.  Genetic Algorithm for a Pickup and Delivery Problem with Time Windows , 2000 .

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

[4]  Morton E. O'Kelly,et al.  Hub‐and‐Spoke Networks in Air Transportation: An Analytical Review , 1999 .

[5]  Maged M. Dessouky,et al.  An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem , 2004, Transp. Sci..

[6]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .

[7]  Dimitris Sacharidis,et al.  Dynamic Pickup and Delivery with Transfers , 2011, SSTD.

[8]  Maged M. Dessouky,et al.  A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows , 2006, Eur. J. Oper. Res..

[9]  Geir Hasle,et al.  Industrial Vehicle Routing , 2007, Geometric Modelling, Numerical Simulation, and Optimization.

[10]  Jen S. Shang,et al.  Multicriteria pickup and delivery problem with transfer opportunity , 1996 .

[11]  Zhi-Long Chen,et al.  Solving a Practical Pickup and Delivery Problem , 2003, Transp. Sci..

[12]  Manuela M. Veloso,et al.  Towards ridesharing with passenger transfers , 2013, AAMAS.

[13]  Dennis Luxen,et al.  Real-time routing with OpenStreetMap data , 2011, GIS.

[14]  Fabien Lehuédé,et al.  An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers , 2011, Transp. Sci..

[15]  Manuela M. Veloso,et al.  Optimizing for Transfers in a Multi-vehicle Collection and Delivery Problem , 2012, DARS.

[16]  Cláudio T. Silva,et al.  Visual Exploration of Big Spatio-Temporal Urban Data: A Study of New York City Taxi Trips , 2013, IEEE Transactions on Visualization and Computer Graphics.

[17]  Inge Li Gørtz,et al.  Minimum Makespan Multi-Vehicle Dial-a-Ride , 2009, ACM Trans. Algorithms.

[18]  H. Nagamochi,et al.  Worst Case Analysis for a Pickup and Delivery Problem with Single Transfer , 2010 .

[19]  Hiroshi Nagamochi,et al.  Worst Case Analysis for a Pickup and Delivery Problem with Single Transfer (Numerical Optimization methods, theory and applications) , 2008 .

[20]  Gilbert Laporte,et al.  Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows , 2007, Networks.

[21]  Fabien Lehuédé,et al.  Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers , 2013, Oper. Res. Lett..

[22]  Richard F. Hartl,et al.  A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows , 2004, J. Heuristics.

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

[24]  Sam R. Thangiah,et al.  Real-time split-delivery pickup and delivery time window problems with transfers , 2007, Central Eur. J. Oper. Res..

[25]  Fabien Lehuédé,et al.  The Dial-A-Ride Problem with Transfers , 2014, Comput. Oper. Res..

[26]  Gilbert Laporte,et al.  The Pickup And Delivery Problem With Time Windows And Transshipment , 2006 .

[27]  Manuela M. Veloso,et al.  Online pickup and delivery planning with transfers for mobile robots , 2013, 2014 IEEE International Conference on Robotics and Automation (ICRA).

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