An adaptive large neighborhood search for the pickup and delivery problem with transfers

Transportation Science

Volumn 47, Issue 3, 2013, Pages 344-355

  Masson, Renaud ^a   Lehuédé, Fabien ^a   Péton, Olivier ^a  

^a INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

Author keywords

Adaptive large neighborhood search; Pickup and delivery problem; Transfers

Indexed keywords

OPTIMIZATION; TRANSPORTATION ROUTES;

ADAPTIVE LARGE NEIGHBORHOOD SEARCHES; DELIVERY POINT; OBJECTIVE FUNCTIONS; PEOPLE WITH DISABILITIES; PICKUP AND DELIVERY PROBLEMS; SPECIFIC LOCATION; TRANSFERS;

PICKUPS;

EID: 84882320559     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1120.0432     Document Type: Article

References (30)

1. Berbeglia G, Cordeau J-F, Laporte G (2010) Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1):8-15.
2. Berbeglia G, Cordeau J-F, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: A classification scheme and survey. TOP 15(1):1-31.
3. Blasum U, Hochstattler W, Oertel P, Woeginger G (2007) Steiner diagrams and k-star hubs. J. Discrete Algorithms 5(3):622-634.
4. Cortés CE, Jayakrishnan R (2002) Design and operational concepts of high-coverage point-to-point transit system. Transportation Res. Record 1783:178-187.
5. Cortés CE, Matamala M, Contardo C (2010) The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. Eur. J. Oper. Res. 200(3):711-724.
6. Fugenschuh A (2009) Solving a school bus scheduling problem with integer programming. Eur. J. Oper. Res. 193(3):867-884.
7. Gørtz IL, Nagarajan V, Ravi R (2009) Minimum makespan multivehicle dial-a-ride. Fiat A, Sanders P, eds. Algorithms-ESA 2009: 17th Annual European Symposium, Lecture Notes in Computer Science, Vol. 5757 (Springer-Verlag, Berlin, Heidelberg), 540-552.
8. Kerivin HLM, Lacroix M, Mahjoub AR, Quilliot A (2008) The splittable pickup and delivery problem with reloads. Eur. J. Indust. Engrg. 2(2):112-133.
9. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671-680.
10. Lapierre SD, Ruiz AB, Soriano P (2004) Designing distribution networks: Formulations and solution heuristic. Transportation Sci. 38(2):174-187.
11. Laporte G, Musmanno R, Vocaturo F (2010) An adaptive large neighbourhood search heuristic for the capacitated arcrouting problem with stochastic demands. Transportation Sci. 44(1):125-135.
12. Li H, Lim A (2002) A metaheuristic for the pickup and delivery problem with time windows. Bilof R, Palagi L, eds. Proc. 13th Internat. Conf. Tools with Artificial Intelligence, ICTAI-2001 (IEEE, Dallas), 160-167.
13. Lin CKY (2008) A cooperative strategy for a vehicle routing problem with pickup and delivery time windows. Comput. Indust. Engrg. 55(4):766-782.
14. Masson R, Lehuédé F, Péton O (2011) A tabu search algorithm for the dial-a-ride problem with transfers. Benyoucef L, Trentesaux D, Artiba A, Rezg N, eds. Proc. Internat. Conf. Indust. Engrg. (Systems Management, Metz, France), 1224-1232.
15. Mitrovíc-Miníc S, Laporte G (2006) The pickup and delivery problem with time windows and transshipment. INFOR 44(3):217-228.
16. Mues C, Pickl S (2005) Transshipment and time windows in vehicle routing. Bein W, Chin FYL, Hsu DF, Palis ML, eds. ISPAN'05: Proc. 8th Internat. Sympos. Parallel Architectures, Algorithms and Networks (IEEE Computer Society, Washington, DC), 113-119.
17. Nakao Y, Nagamochi H (2010) Worst case analysis for pickup and delivery problems with transfer. IEICE Trans. Fundamentals of Electronics, Comm. Comput. Sci. E91-A(9):2328-2334.
18. Oertel P (2000) Routing with reloads. Ph.D. thesis, University of Cologne, Germany.
19. Parragh SN, Doerner KF, Hartl RF (2008) A survey on pickup and delivery problems, part 2: Transportation between pickup and delivery locations. J. für Betriebswirtschaft 58(2):81-117.
20. Petersen H, Ropke S (2011) The pickup and delivery problem with cross-docking opportunity. Böse J, Hu H, Jahn C, Shi X, Stahlbock R, Voß S, eds. Computational Logistics, Lecture Notes in Computer Science, Vol. 6971 (Springer, Berlin/Heidelberg), 101-113.
21. Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8):2403-2435.
22. Potvin J-Y, Rousseau J-M (1993) A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur. J. Oper. Res. 66(3):331-340.
23. Ropke S, Cordeau J-F (2009) Branch and cut and price for the pickup and delivery problem with time windows. Transportation Sci. 43(3):267-286.
24. Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4):455-472.
25. Ropke S, Pisinger D (2010) Large neighborhood search. Gendreau M, Potvin J-Y, eds. Handbook of Metaheuristics, 2nd ed. (Springer, New York), 399-419.
26. Savelsbergh MWP (1985) Local search in routing problems with time windows. Ann. Oper. Res. 4(1):285-305.
27. Schrimpf G, Schneider J, Stamm-Wilbrandt H, Dueck G (2000) Record breaking optimization results using the ruin and recreate principle. J. Comput. Physics 159:139-171.
28. Shang JS, Cuff CK (1996) Multicriteria pickup and delivery problem with transfer opportunity. Comput. Indust. Engrg. 30(4): 631-645.
29. Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. Maher M, Puget JF, eds. Proc. 4th Internat. Conf. Principles and Practice of Constraint Programming, (Springer, Berlin, Heidelberg), 417-431.
30. Thangiah SR, Fergany A, Awam S (2007) Real-time split-delivery pickup and delivery time window problems with transfers. Central Eur. J. Oper. Res. 15(4):329-349.