The one-commodity pickup-and-delivery travelling salesman problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2570, Issue , 2003, Pages 89-104

  Hernández Pérez, Hipólito ^a   Salazar González, Juan José ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; PICKUPS; SALES;

0-1 INTEGER LINEAR PROGRAMMING; BRANCH AND CUT; COMPUTATIONAL EXPERIMENT; EXACT METHODS; OPTIMAL SOLUTIONS; PICKUP AND DELIVERY; TRAVEL DISTANCE; TRAVELLING SALESMAN PROBLEM;

TRAVELING SALESMAN PROBLEM;

EID: 21144442311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36478-1_10     Document Type: Article

References (19)

1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, "Network Flows", in G.L. Nemhauser, A.H.G. Rinnooy Kan, M.J. Todd (Editors), "Optimization" I, North-Holland, 1989.
2. S. Anily, R. Hassin, "The Swapping Problem", Networks 22 (1992) 419-433.
3. S. Anily, G. Mosheiov, "The traveling salesman problem with delivery and backhauls", Operations Research Letters 16 (1994) 11-18.
4. D. Applegate, R. Bixby, V. Chvatal, W. Cook, "Concorde: a code for solving Traveling Salesman Problem", http://www.math.princeton.edu/tsp/concorde.html, 1999.
5. P. Augerat, J.M. Belenguer, E. Benavent, A. Corberán, D. Naddef, G. Rinaldi, "Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem", Research Report 949-M, 1995, Universite Joseph Fourier, Grenoble, France.
6. E. Balas, M.W. Padberg, "Set Partitioning: A survey", SIAM Review 18 (1976) 710-760.
7. J.F. Benders, "Partitioning Procedures for Solving Mixed Variables Programming Problems", Numerische Mathematik 4 (1962) 238-252.
8. M.R. Garey, D.S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness", W.H. Freeman and Co., 1979.
9. M. Gendreau, G. Laporte, D. Vigo, "Heuristics for the traveling salesman problem with pickup and delivery", Computers & Operations Research 26 (1999) 699-714.
10. B.L. Golden, W.R. Stewart, "Empirical analysis of heuristics", in E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Editors), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, 1985.
11. H. Hernández, J.J. Salazar, "A Branch-and-Cut Algorithm for the Pickup-and-Delivery Travelling Salesman Problem", technical report, University of La Laguna, 2001. Available on http://webpages.ull.es/users/jjsalaza/pdtsp.htm.
12. M. Jünger, G. Reinelt, G. Rinaldi, "The Travelling Salesman Problem", in M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (Editors), Handbook in Operations Research and Management Science: Network Models, Elsevier, 1995.
13. L.G. Khachian, "A polynomial Algorithm in Linear Programming", Soviet Mathematics Doklady 20 (1979) 191-194.
14. L. Gouveia, "A result on projection for the the Vehicle Routing Problem", European Journal of Operational Research 83 (1997) 610-624.
15. G. Mosheiov, "The Travelling Salesman Problem with pick-up and delivery", European Journal of Operational Research 79 (1994) 299-310.
16. D. Naddef, "Polyhedral theory and Branch-and-Cut algorithms for Symmetric TSP", Chapter 4 in G. Gutin, A. Punnen (Editors), The Traveling Salesman Problem and its Variants, Kluwer, 2001.
17. M.W. Padberg, G. Rinaldi, "A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems", SIAM Review 33 (1991) 60-100.
18. M.W.P. Savelsbergh, M. Sol, "The General Pickup and Delivery Problem", Transportation Science 29 (1995) 17-29.
19. P. Toth, D. Vigo (Editors), "The Vehicle Routing Problem", SIAM Discrete Mathematics and its Applications, 2001.