Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints

European Journal of Operational Research

Volumn 223, Issue 1, 2012, Pages 60-75

  Cheang, Brenda ^a   Gao, Xiang ^b   Lim, Andrew ^b   Qin, Hu ^a   Zhu, Wenbin ^c  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Distance constraint; Last in first out loading; Metaheuristic; Pickup and delivery; Traveling salesman

Indexed keywords

DISTANCE CONSTRAINTS; LAST IN FIRST OUTS; METAHEURISTIC; PICKUP AND DELIVERY; TRAVELING SALESMAN;

HEURISTIC ALGORITHMS; PROBLEM SOLVING; SIMULATED ANNEALING; TABU SEARCH; TRAVELING SALESMAN PROBLEM;

LOADING;

EID: 84864475314     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2012.06.019     Document Type: Article

References (45)

1. R.K. Ahuja, J.B. Orlin, S. Pallottino, M.P. Scaparra, and M.G. Scutellà A multi-exchange heuristic for the single-source capacitated facility location problem Management Science 50 6 2004 749 760
2. R.K. Ahuja, J.B. Orlin, and D. Sharma Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem Mathematical Programming 91 1 2001 71 97 (Pubitemid 33758908)
3. Alba, M.A., Cordeau, J.-F., Dell'Amico, M., Iori, M., in press. A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks. INFORMS Journal on Computing.
4. R. Bent, and P. Van Hentenryck A two-stage hybrid local search for the vehicle routing problem with time windows Transportation Science 38 4 2004 515 530
5. R. Bent, and P. Van Hentenryck A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows Computers and Operations Research 33 4 2006 875 893 (Pubitemid 41492054)
6. O. Bräysy, and M. Gendreau Vehicle routing problem with time windows, part I: route construction and local search algorithms Transportation Science 39 1 2005 104 118 (Pubitemid 40466664)
7. F. Carrabs, R. Cerulli, and J.-F. Cordeau An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with LIFO or FIFO loading INFOR: Information Systems and Operational Research 45 4 2007 223 238
8. Carrabs, F., Cerulli, R., Grazia Speranza, M., in press. A branch-and-bound algorithm for the double travelling salesman problem with two stacks. Networks.
9. F. Carrabs, J.-F. Cordeau, and G. Laporte Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading INFORMS Journal on Computing 19 4 2007 618 632
10. Cassani, L., Righini, G., 2004. Heuristic algorithms for the TSP with rear-loading. In: 35th Annual Conference of the Italian Operational Research Society (AIRO XXXV). Lecce, Italy.
11. J.-F. Cordeau, M. Iori, G. Laporte, and J.J. Salazar González A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading Networks 55 1 2010 46 59
12. Côté, J.-F., Gendreau, M., Potvin, J.-Y., 2009. Large Neighborhood Search for the Single Vehicle Pickup and Delivery Problem with Multiple Loading Stacks. Working paper CIRRELT-2009-47.
13. I. Dumitrescu, S. Ropke, J.-F. Cordeau, and G. Laporte The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm Mathematical Programming 121 2 2009 269 305
14. G. Erdogan, J.-F. Cordeau, and G. Laporte The pickup and delivery traveling salesman problem with first-in-first-out loading Computers and Operations Research 36 6 2009 1800 1808
15. A.L. Erera, J.C. Morales, and M. Savelsbergh The vehicle routing problem with stochastic demand and duration constraints Transportation Science 44 4 2010 474 492
16. A. Felipe, M.T. Ortuño, and G. Tirado The double traveling salesman problem with multiple stacks: a variable neighborhood search approach Computers and Operations Research 36 11 2009 2983 2993
17. A. Felipe, M.T. Ortuño, and G. Tirado New neighborhood structures for the double traveling salesman problem with multiple stacks TOP 17 1 2009 190 213
18. A. Felipe, M.T. Ortuño, and G. Tirado Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints European Journal of Operational Research 211 1 2011 66 75
19. A. Frangioni, E. Necciari, and M. Scutellà A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems Journal of Combinatorial Optimization 8 2 2004 195 220
20. X. Gao, A. Lim, H. Qin, and W. Zhu Multiple pickup and delivery TSP with LIFO and distance constraints: a VNS approach Lecture Notes in Computer Science 6704 2011 193 202
21. P. Healy, and R. Moll A new extension of local search applied to the dial-a-ride problem European Journal of Operational Research 83 1 1995 83 104
22. J. Homberger, and H. Gehring A two-phase hybrid metaheuristic for the vehicle routing problem with time windows European Journal of Operational Research 162 1 2005 220 238
23. T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno, and M. Yagiura Effective local search algorithms for routing and scheduling problems with general time-window constraints Transportation Science 39 2 2005 206 232 (Pubitemid 40748590)
24. M. Iori, and S. Martello Routing problems with loading constraints TOP 18 1 2010 4 27
25. B. Kalantari, A.V. Hill, and S.R. Arora An algorithm for the traveling salesman problem with pickup and delivery customers European Journal of Operational Research 22 3 1985 377 386 (Pubitemid 15602973)
26. S.P. Ladany, and A. Mehrez Optimal routing of a single vehicle with loading and unloading constraints Transportation Planning and Technology 8 4 1984 301 306 (Pubitemid 14552602)
27. G. Laporte, Y. Nobert, and M. Desrochers Optimal routing under capacity and distance restrictions Operations Research 33 5 1985 1050 1073 (Pubitemid 15589837)
28. G. Levitin, and R. Abezgaouz Optimal routing of multiple-load AGV subject to LIFO loading constraints Computer and Operations Research 30 3 2003 397 410 (Pubitemid 36650127)
29. C.-L. Li, D. Simchi-Levi, and M. Desrochers On the distance constrained vehicle routing problem Operations Research 40 4 1992 790 799
30. H. Li, and A. Lim Local search with annealing-like restarts to solve the VRPTW European Journal of Operational Research 150 1 2003 115 127
31. Y. Li, A. Lim, W.-C. Oon, H. Qin, and D. Tu The tree representation for the pickup and delivery traveling salesman problem with LIFO loading European Journal of Operational Research 212 3 2011 482 496
32. A. Lim, and X. Zhang A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows INFORMS Journal on Computing 19 3 2007 443 457
33. R.M. Lusby, J. Larsen, M. Ehrgott, and D. Ryan An exact method for the double TSP with multiple stacks International Transactions in Operational Research 17 5 2010 637 652
34. N. Mladenović, and P. Hansen Variable neighborhood search Computers and Operations Research 24 11 1997 1097 1100
35. Y. Nagata, and O. Bräysy A powerful route minimization heuristic for the vehicle routing problem with time windows Operations Research Letters 37 5 2009 333 338
36. G. Nagy, and S. Salhi Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries European Journal of Operational Research 162 1 2005 126 141
37. Pacheco, J.A., 1997. Metaheuristic based on a simulated annealing process for one vehicle pick-up and delivery problem in LIFO unloading systems. In: Proceedings of the Tenth Meeting of the Europen Chapter of Combinatorial Optimization (ECCO X). Tenerife, Spain.
38. H.L. Petersen, C. Archetti, M. Speranza, and S. Grazia Exact solutions to the double travelling salesman problem with multiple stacks Networks 56 4 2010 229 243
39. H.L. Petersen, and O.B.G. Madsen The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches European Journal of Operational Research 198 1 2009 139 147
40. D. Pisinger, and S. Ropke A general heuristic for vehicle routing problems Computers and Operations Research 34 8 2007 2403 2435 (Pubitemid 46073431)
41. G. Reinelt TSPLIB - traveling salesman problem library ORSA Journal on Computing 3 4 1991 376 384
42. J. Renaud, F.F. Boctor, and G. Laporte Perturbation heuristics for the pickup and delivery traveling salesman problem Computers and Operations Research 29 9 2002 1129 1141 (Pubitemid 34294740)
43. J. Renaud, F.F. Boctor, and J. Ouenniche A heuristic for the pickup and delivery traveling salesman problem Computers and Operations Research 27 10 2000 905 916 (Pubitemid 30306605)
44. P. Toth, and D. Vigo The vehicle routing problem 2002 SIAM Philadelphia, PA
45. F. Tricoire, K.F. Doerner, R.F. Hartl, and M. Iori Heuristic and exact algorithms for the multi-pile vehicle routing problem OR Spectrum 33 4 2010 931 959