A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment

Computers and Operations Research

Volumn 39, Issue 10, 2012, Pages 2439-2456

  Qu, Yuan ^a   Bard, Jonathan F ^b  

^a ACCENTURE   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Adaptive large neighborhood search; GRASP; Pickup and delivery problem; Transshipment

Indexed keywords

CONSTRUCTION PHASE; COST SAVING; DATA SETS; DIRECTED GRAPHS; GRASP; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; INSERTION HEURISTICS; LARGE NEIGHBORHOOD SEARCH; OPTIMALITY; PICKUP AND DELIVERY PROBLEM; PICKUP AND DELIVERY PROBLEMS; PROBLEM INSTANCES; PUBLIC TRANSPORTATION; REGIONAL AIR CARRIERS; ROUTE PLANNING; SOLUTION QUALITY; TEST CASE; TRANSSHIPMENT;

POSTAL SERVICES;

PICKUPS;

EID: 84856100967     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.11.016     Document Type: Article

References (34)

1. A.P. Armacost, C. Barnhart, and K.A. Ware Composite variable formulations for express shipment service network design Transportation Science 36 1 2002 1 20 (Pubitemid 34268730)
2. J.F. Bard, and A.I. Jarrah Large-scale constrained clustering for rationalizing pickup and delivery operations Transportation Research Part B 43 5 2009 542 561
3. C. Barnhart, N. Krishnan, D. Kim, and K. Ware Network design for express shipment delivery Computational Optimization and Applications 21 3 2002 239 262 (Pubitemid 34176305)
4. R. Battiti, and G. Tecchiolli The reactive tabu search ORSA Journal of Computing 6 2 1994 126 140
5. G. Berbeglia, J.-F. Cordeau, I. Gribkovskaia, and G. Laporte Static pickup and delivery problems: a classification scheme and survey TOP 15 1 2007 1 31
6. M. Boudia, M.A.O. Louly, and C. Prins A reactive GRASP and path relinking for a combined production-distribution problem Computers & Operations Research 34 11 2006 3402 3419
7. G. Codato, and M. Fischetti Combinatorial Benders cuts for mixed-integer linear programming Operations Research 54 4 2006 756 766 (Pubitemid 44521585)
8. J.F. Cordeau, and G. Laporte The dial-a-ride problem (DARP): variants, modeling issues and algorithms 4OR 1 2003 89 101
9. C. Cortés, M. Matamala, and C. Contardo The pickup-and-delivery problem with transfers: formulation and a branch-and-cut solution method European Journal of Operational Research 200 3 2010 711 724
10. T.G. Crainic, and G. Laporte Planning models for freight transportation European Journal of Operational Research 97 3 1997 409 438 (Pubitemid 127418508)
11. J. Desrosiers, and Y. Dumas The shortest path for the construction of vehicle routes with pick-up, delivery and time constraints H.A. Eiselt, Pederzoli Lecture Notes in Economics and Mathematical Systems 302; Advances in Optimization and Control 1988 Springer-Verlag 144 157
12. J. Desrosiers, F. Soumis, and M. Desrochers Routing with time window with column generation Networks 14 1984 545 565 (Pubitemid 14663841)
13. Y. Dumas, J. Desrosiers, and F. Soumis The pickup and delivery problem with time windows European Journal of Operational Research 54 1 1991 7 22 (Pubitemid 21712574)
14. T.A. Feo, K. Venkatraman, and J.F. Bard A GRASP for a difficult single machine scheduling problem Computers & Operations Research 18 8 1991 635 643
15. G. Laporte, S. Chapleau, P. Landry, and H. Mercure An algorithm for the design of mailbox collection routes in urban areas Transportation Research Part B: Methodological 23 4 1989 271 280
16. P. Hansen, and N. Mladenović Variable neighborhood search: Principles and applications European Journal of Operational Research 130 3 2001 449 467 (Pubitemid 32875304)
17. D. Kim, C. Barnhart, K. Ware, and G. Reinhardt Multimodal express package delivery: a service network design application Transportation Science 33 4 1999 391 407 (Pubitemid 30519519)
18. G. Kontoravdis, and J.F. Bard A GRASP for the vehicle routing problem with time windows ORSA Journal on Computing 7 1 1995 10 23
19. A. Langevin, and F. Soumis Design of multiple-vehicle delivery tours satisfying time constraints Transportation Research Part B: Methodological 23 2 1989 123 138
20. Li H, Lim A.A metaheuristic for the pickup and delivery problem with time windows. In: Proceedings of the 13th IEEE Conference on Tools and Artificial Intelligence (ICTAI), Dallas, TX; 2001. p. 16070.
21. Mitrović-Minić S. Pickup and delivery problem with time windows: a survey. SFU CMPT TR, vol. 12, issue 1; 1998. p. 143. 〈ftp://ftp.fas.sfu.ca/pub/cs/TR/1998/CMPT1998-12.pdf〉.
22. S. Mitrović-Minić, and G. Laporte The pickup and delivery problem with time windows and transshipment INFOR 44 3 2006 217 227 (Pubitemid 44863031)
23. W.P. Nanry, and J.W. Barnes Solving the pickup and delivery problem with time windows using reactive tabu search Transportation Research Part B 34 2 2000 107 121 (Pubitemid 30135209)
24. S. Ropke, and D. Pisinger An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows Transportation Science 40 4 2006 455 472 (Pubitemid 44746135)
25. S. Ropke, J.F. Cordeau, and G. Laporte Models and branch-and-cut algorithms for pickup and delivery problems with time windows Networks 49 4 2007 258 272 (Pubitemid 47324734)
26. S. Ropke, and J.F. Cordeau Branch and cut and price for the pickup and delivery problem with time windows Transportation Science 43 3 2009 267 286
27. K.S. Ruland, and E.Y. Rodin The pickup and delivery problem: faces and branch-and-cut algorithm International Journal of Computer Mathematics 33 12 1997 1 13 (Pubitemid 127371487)
28. M. Savelsbergh, and M. Sol The general pickup and delivery problem Transport Science 29 1 1995 17 29
29. J.S. Shang, and C.K. Cuff Multicriteria pickup and delivery problem with transfer opportunity Computers & Industrial Engineering 30 4 1996 631 645 (Pubitemid 126375882)
30. P. Shaw Using constraint programming and local search methods to solve vehicle routing problems M. Maher, J.F. Puget, Lecture Notes in Computer Science 1520; Principles and Practice of Constraint Programming 1998 Springer-Verlag Berlin 417 431 (Pubitemid 128151602)
31. M.M. Solomon Algorithms for the vehicle routing and scheduling problems with time window constraints Operations Research 35 2 1987 254 265
32. S.R. Thangiah, A. Fergany, and S. Awan Real-time split-delivery pickup and delivery time window problems with transfers Central European Journal of Operations Research 15 4 2007 329 349
33. H. Xu, Z.L. Chen, S. Rajagopal, and S. Arunapuram Solving a practical pickup and delivery problem Transport Science 37 3 2003 347 364
34. S. Yan, S.C. Chen, and C.H. Chen Air cargo fleet routing and timetable setting with multiple on-time demands Transportation Research Part E: Logistics and Transportation Review 42 5 2006 409 430 (Pubitemid 44111756)