A comparison of two meta-heuristics for the pickup and delivery problem with transshipment

Abstract In the Pickup and Delivery Problems (PDP), a set of routes satisfying requests between pickup and delivery nodes has to be found. This problem has applications in cargo transportation, mail deliveries, passenger transportation ... Recently, a new problem has arisen, the Pickup and Delivery Problem with Transshipment (PDPT), where requests can be transferred from a vehicle to another one in special nodes called transshipment nodes. In this paper, we propose two meta-heuristics to solve the PDPT. The first one is a Large Neighbourhood Search (LNS). The second one is a Genetic Algorithm (GA) which, as far as we know, has not yet been proposed to solve the PDPT. The objective of this paper is to compare the GA and the LNS with existing algorithms from the literature. To perform this comparison, benchmark instances from the literature are used. The GA outperforms the LNS and the existing solutions in the literature.

[1]  Fabien Lehuédé,et al.  A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes , 2013, Eur. J. Oper. Res..

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

[3]  Jonathan F. Bard,et al.  Large-scale constrained clustering for rationalizing pickup and delivery operations , 2009 .

[4]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[5]  Jonathan F. Bard,et al.  A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment , 2012, Comput. Oper. Res..

[6]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[7]  Inge Li Gørtz,et al.  Minimum Makespan Multi-vehicle Dial-a-Ride , 2009, ESA.

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

[9]  Gilbert Laporte,et al.  The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..

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

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

[12]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[13]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

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

[15]  A. Mahjoub,et al.  The splittable pickup and delivery problem with reloads , 2008 .

[16]  Abder Koukam,et al.  An Evolutionary Approach to Pickup and Delivery Problem with Time Windows , 2004, International Conference on Computational Science.

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

[18]  Mekki Ksouri,et al.  Multi-Objective Optimization for the m-PDPTW: Aggregation Method With Use of Genetic Algorithm and Lower Bounds , 2011, Int. J. Comput. Commun. Control.

[19]  Rémy Dupas,et al.  A HYBRID MULTISTART HEURISTIC FOR THE PICKUP AND DELIVERY PROBLEM WITH AND WITHOUT TRANSSHIPMENT , 2012 .

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

[21]  Maria Sameiro Carvalho,et al.  New mixed integer-programming model for the pickup-and-delivery problem with transshipment , 2014, Eur. J. Oper. Res..

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