Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading

References

• Carrabs F. Heuristics and exact approaches for transportation problems with pickup and delivery. (2005) . Ph.D. thesis, Dipartimento di Matematica ed Informatica, Universitá di Salerno, Fisciano, ItalyGoogle Scholar
• Cassani L., Righini G. Heuristic algorithms for the TSP with rear-loading. 35th Annual Conf. Italian Oper. Res. Soc. (AIRO XXXV) (2004) September 2004Lecce, Italy http://optlab.dti.unimi.it/Papers/Cassani.pdfGoogle Scholar
• Cordeau J.-F., Laporte G., Potvin J.-Y., Savelsbergh M. W. P., Barnhart C., Laporte G. Transportation on demand. Transportation, Handbooks in Operations Research and Management Science (2007) 14(Elsevier, Amsterdam, The Netherlands) 429–466Google Scholar
• Fischetti M., Toth P. An additive bounding procedure for combinatorial optimization problems. Oper. Res. (1989) 37:319–328Link, Google Scholar
• Hansen P., Mladenović N., Burke E. K., Kendall G. Variable neighborhood search. Search Methodologies (2005) (Springer, New York) 211–238Crossref, Google Scholar
• Healy P., Moll R. A new extension of local search applied to the dial-a-ride problem. Eur. J. Oper. Res. (1995) 83:83–104Crossref, Google Scholar
• Kalantari B., Hill A. V., Arora S. R. An algorithm for the traveling salesman problem with pickup and delivery customers. Eur. J. Oper. Res. (1985) 22:377–386Crossref, Google Scholar
• Ladany S. P., Mehrez A. Optimal routing of a single vehicle with loading and unloading constraints. Transportation Planning and Tech. (1984) 8:301–306Crossref, Google Scholar
• Levitin G. Organization of computations that enable one to use stack memory optimally. Soviet J. Comput. System Sci. (1986) 24:151–159Google Scholar
• Levitin G., Abezgaouzb R. Optimal routing of multiple-load AGV subject to LIFO loading constraints. Comput. Oper. Res. (2003) 30:397–410Crossref, Google Scholar
• Lin S., Kernighan B. W. An effective heuristic algorithm for the traveling salesman problem. Oper. Res. (1973) 21:498–516Link, Google Scholar
• Mladenović N., Hansen P. Variable neighborhood search. Comput. Oper. Res. (1997) 24:1097–1100Crossref, Google Scholar
• Or I. Traveling salesman type combinatorial problems and their relations to the logistics of blood banking. (1976) . Ph.D. thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, ILGoogle Scholar
• Pacheco J. A. Heuristico para los problemas de ruta con carga y descarga en sistemas LIFO (in Spanish). Statist. Oper. Res. Trans. (1997) 21:69–86Google Scholar
• Psaraftis H. N. K-interchange procedures for local search in a precedence-constrained routing problem. Eur. J. Oper. Res. (1983) 13:391–402Crossref, Google Scholar
• Reinelt G. TSPLIB—A Traveling Salesman Problem Library. ORSA J. Comput. (1991) 3:376–384Link, Google Scholar
• Renaud J., Boctor F. F., Laporte G. Perturbation heuristics for the pickup and delivery traveling salesman problem. Comput. Oper. Res. (2002) 29:1129–1141Crossref, Google Scholar
• Renaud J., Boctor F. F., Ouenniche J. A heuristic for the pickup and delivery traveling salesman problem. Comput. Oper. Res. (2000) 27:905–916Crossref, Google Scholar
• Ruland K. S., Rodin E. Y. The pickup and delivery problem: Faces and branch-and-cut algorithm. Comput. Math. with Appl. (1997) 33:1–13Crossref, Google Scholar
• Savelsbergh M. W. P. An efficient implementation of local search algorithms for contrained routing problems. Eur. J. Oper. Res. (1990) 47:75–85Crossref, Google Scholar
• Van Der Bruggen L. J. J., Lenstra J. K., Schuur P. C. Variable depth search for the single-vehicle pickup and delivery problem with time windows. Transportation Sci. (1993) 27:391–402Link, Google Scholar
• Volchenkov S. G. Organization of computations utilizing stack storage. Engrg. Cybernetics, Soviet J. Comput. System Sci. (1982) 20:109–115Google Scholar
• Xu H., Chen Z., Rajagopal S., Arunapuram S. Solving a practical pickup and delivery problem. Transportation Sci. (2003) 37:347–364Link, Google Scholar