Exponential neighbourhood local search for the traveling salesman problem

Computers and Operations Research

Volumn 26, Issue 4, 1999, Pages 313-320

  Gutin, Gregory ^a  

^a BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

Local search; Neighbourhoods; Traveling salesman problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

EXPONENTIAL NEIGHBORHOOD LOCAL SEARCH;

TRAVELING SALESMAN PROBLEM;

ALGORITHM; COMPUTER SYSTEM; METHODOLOGY;

EID: 0032768046     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00064-1     Document Type: Article

References (21)

1. [1] Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. The travelling salesman problem. Chichester: Wiley, 1985.
2. [2] Reinelt G. The traveling salesman problem: computational solutions for TSP applications, Springer Lecture Notes in Computer Science, Vol. 840, Berlin, Springer, 1994.
3. [3] Johnson DS, McGeoch LA. The traveling salesman problem: a case study in local optimization. Aarts EHL, Lenstra JK Editors In local search in combinatorial optimization. New York: Wiley, 1997:215-310.
4. [4] Croes GA. A method for solving travelling-salesman problems. Operations Research 1958;6:791-812.
5. [5] Lin S. Computer solutions to the travelling salesman problem. Bell System Technical Journal 1965;44:2245-69.
6. [6] Balas E, Simonetti N. Linear time dynamic programming algorithms for some new classes of restricted TSP's. Management Science Research Report MSRR-617. Canegie Mellon University, Pittsburgh (1996). A preliminary version appeared in Proceedings of the IPCO V Lecture Notes in Computer Science, 1084, Springer, Berlin, 1996:316-29.
7. [6] Balas E, Simonetti N. Linear time dynamic programming algorithms for some new classes of restricted TSP's. Management Science Research Report MSRR-617. Canegie Mellon University, Pittsburgh (1996). A preliminary version appeared in Proceedings of the IPCO V Lecture Notes in Computer Science, 1084, Springer, Berlin, 1996:316-29.
8. [7] Burkard RE, Deineko VG, Woeginger GJ. The travelling salesman problem and the PQ-tree. Technical Report SFB56. Technical University of Graz, Austria, January (1996). Published in Proceedings of the IPCO V, Lecture notes in Computer Science Vol. 1084, Berlin: Springer, 1996:490-504.
9. [8] Carlier J, Villon P. A new heuristic for the traveling salesman problem. RAIRO 1990;24:245-53.
10. [9] Glover F. Ejection chains, reference structures, and alternating path algorithms for traveling salesman problem. Research Report. University Colorado-Boulder, Graduate School of Business, 1992.
11. [10] Glover F, Punnen A. The traveling salesman problem: new solvable cases and linkages with the development of approximation algorithms. Journal of the Opererational Research Society 1997;48:502-10.
12. [11] Potts CN, van de Velde SL. Dynasearch - iterative local improvement by dynamic programming: part I, the travelling salesman problem. Technical Report. University of Twente, The Netherlands, 1995.
13. [12] Punnen AP. The traveling salesman problem: new polynomial approximation algorithms and domination analysis. Research Report. University New Brunswick, St. John, Canada, 1996.
14. [13] Punnen AP, Glover F. Implementing ejection chains with combinatorial leverage for the TSP. Research Report. University of New Brunswick, St. John, Canada, 1997.
15. [14] Rego C. Relaxed tours and path ejections for the traveling salesman problem. Technical Report. Laboratory PRiSM, University de Versailles, 1996.
16. [15] Khanna S, Motwani R, Sudan M, Vazirani U. On syntactic versus computational views of approximability. In Proceedings of the 35th IEEE Symposium on Foundation Computer Science (1994).
17. [16] Sarvanov VI, Doroshko NN. Approximate solution of the traveling salesman problem by a local algorithm with scanning neighbourhoods of factorial cardinality in cubic time. Software: algorithms and programs. Minsk Mathematic Institute of Belorussian Academy of Science 31;1981:11-3 (in Russian).
18. [17] Gutin G. On an approach for solving the traveling salesman problem. Proceedings of The USSR Conference on System Research Moscow, 1984:184-5 (in Russian).
19. [18] Gutin G. On the efficiency of a local algorithm for solving the traveling salesman problem. Automation and Remote Control. 1988 (11); (part 2), 1514-9.
20. [19] Feller W. An introduction to probability theory and its applications. New York: Wiley, 1968.
21. [20] Deineko V, Woeginger GJ. A study of exponential neighbourhoods for the traveling salesman problem and the quadratic assignment problem. Technical Report Woe05, Technical University of Graz, Austria, July 1997.