An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with LIFO or FIFO loading

INFOR

Volumn 45, Issue 4, 2007, Pages 223-238

  Carrabs, Francesco ^a   Cerulli, Raffaele ^a   Cordeau, Jean François ^b,c  

^a UNIVERSITY OF SALERNO   (Italy)

^b HEC MONTRÉAL   (Canada)

^c INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

Additive branch and bound; FIFO loading; LIFO loading; Pickup and delivery; Traveling salesman problem

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CONTROL THEORY; UNLOADING;

ADDITIVE BRANCH-AND-BOUND; ELIMINATION RULES; FIFO LOADING; LIFO LOADING; PICKUP AND DELIVERY;

TRAVELING SALESMAN PROBLEM;

EID: 51349124105     PISSN: 03155986     EISSN: None     Source Type: Journal    
DOI: 10.3138/infor.45.4.223     Document Type: Article

References (34)

1. Ahuja, R., Magnanti, T., Orlin, J. Network Flows. Prentice Hall, 1993.
2. Camerini, P.M., Fratta, L., Maffioli, F. A note on finding optimum branchings. Networks, 9: 309-312, 1979.
3. Carpaneto, G., Fischetti, M., Toth, P. New lower bounds for the symmetric travelling salesman problem. Mathematical Programming (Series B), 45: 233-254, 1989.
4. Carrabs, F., Cordeau, J.-F., Laporte, G. Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS Journal on Computing, 19: 618-632, 2007.
5. Cassani, L. Algoritmi euristici per il TSP with rear-loading. qDegree Thesis, Universit di Milano, Italy, http://www.crema.unimi.it/~righini/Papers/ Cassani.pdf, 2004.
6. Chu, Y.J., Liu, T.H. On the shortest arborescence of a directed graph. Science Sinica, 14: 13961400, 1965.
7. Cordeau, J.-F., Iori, M., Laporte, G., Salazar-Gonzalez, J.-J. A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks, 2008. Forthcoming.
8. Cordeau, J.-F., Laporte, G., Potvin, J.-Y., Savelsbergh, M.W.P. Transportation on demand. In Barnhart, C., Laporte, G. editors, Transportation, Handbooks in Operations Research and Management Science, Volume 14, 429-466. Elsevier, Amsterdam, 2007.
9. Edmonds, J. Optimum branching. Journal Research of the National Bureau of Standards, 71B: 233-240, 1967.
10. Erdogan, G., Cordeau, J.-F., Laporte, G. The pickup and delivery traveling salesman problem with first-in-first-out loading. Technical Report CIRRELT-2007-61, HEC Montréal, 2007.
11. Ficarelli, F. Mathematical programming algorithms for the TSP with rear-loading. Degree Thesis, Universita di Milano, Italy, http://optlab.dti. unimi.it/Papers/Ficarelli.pdf, 2005.
12. Fischetti, M., Toth, P. An additive bounding procedure for combinatorial optimization problems. Operations Research, 37: 319-328, 1989.
13. Fischetti, M., Toth, P. An additive bounding procedure for the asymmetric travelling salesman problem. Mathematical Programming, 53: 173-197, 1992.
14. Fischetti, M., Toth, P. An efficient algorithms for the min-sum arborescence problem on complete digraph. ORSA Journal on Computing, 5 (4): 426-434, 1993.
15. Gabow, H., Galil, Z., Spencer, T., Tarjan, R.E. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica, 6 (2): 109-122, 1986.
16. Gabow, H.N., Galil, Z., Spencer, T.H. Efficient implementation of graph algorithms using contraction. Journal ACM, 36 (3): 540-572, 1989.
17. Gutin, G., Punnen, A.P., The Traveling Salesman Problem and Its Variations. Kluwer, Boston, 2002.
18. Healy, P., Moll, R. A new extension of local search applied to the dial-a-ride problem. European Journal of Operational Research, 83: 83-104, 1995.
19. Kalantari, B., Hill, A.V., Arora, S.R. An algorithm for the traveling salesman problem with pickup and delivery customers. European Journal of Operational Research, 22: 377-386, 1985.
20. Ladany, S.P., Mehrez, A. Optimal routing of a single vehicle with loading and unloading constraints. Trasportation Planning and Technology, 8: 301-306, 1984.
21. Levitin, G. Organization of computations that enable one to use stack memory optimally. Soviet Journal of Computer & System Science, 24: 151-159, 1986.
22. Levitin, G., Abezgaouz, R. Optimal routing of multiple-load AGV subject to LIFO loading constraints. Computers & Operations Research, 30: 397-410, 2003.
23. Little, J.D.C., Murty, K.G., Sweeney, D.W., Karel, C. An algorithm for the traveling salesman problem. Operations Research, 11: 972-989, 1963.
24. Or, I., Traveling salesman type combinatorial problems and their relations to the logistics of blood banking. PhD thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, 1976.
25. Pacheco, J.A., Problemas de rutas con ventanas de tiempo. PhD thesis, Department of Estadistica and Investigation Operativa, Universitad complutense de Madrid, 1994.
26. Pacheco, J.A. Problemas de rutas con carga y descarga en sistemas LIFO: solutiones exactas. Estudios de Econimia Aplicada, 3: 69-86, 1995.
27. Pacheco, J.A. Heuristico para los problemas de ruta con carga y descarga en sistemas LIFO. SORT, Statistics and Operations Research Transactions, 21: 69-86, 1997a.
28. Pacheco, J.A. 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, 1997b.
29. Renaud, J., Boctor, F.F., Laporte, G. Perturbation heuristics for the pickup and delivery traveling salesman problem. Computers & Operations Research, 29: 1129-1141, 2002.
30. Renaud, J., Boctor, F.F., Ouenniche, J. A heuristic for the pickup and delivery traveling salesman problem. Computers & Operations Research, 27: 905-916, 2000.
31. Ruland, K.S., Rodin, E.Y. The pickup and delivery problem: Faces and branch-and-cut algorithm. Computer and Mathematics with Applications, 33: 1-13, 1997.
32. Savelsbergh, M.W.P. An efficient implementation of local search algorithms for contrained routing problems. European Journal of Operational Research, 47: 75-85, 1990.
33. Tarjan, R.E. Finding optimum branching. Networks, 7: 25-35, 1977.
34. Volchenkov, S.G. Organization of computations utilizing stack storage. Engineering Cybernetics, Soviet Journal of Computer & System Science, 20: 109-115, 1982.