Small diameter neighbourhood graphs for the traveling salesman problem: At most four moves from tour to tour

Computers and Operations Research

Volumn 26, Issue 4, 1999, Pages 321-327

  Gutin, Gregory ^a   Yeo, Anders ^b  

^a BRUNEL UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

Local search; Neighbourhoods; Traveling salesman problem

Indexed keywords

GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

LOCAL SEARCH; SMALL DIAMETER NEIGHBORHOOD GRAPHS;

TRAVELING SALESMAN PROBLEM;

ALGORITHM; METHODOLOGY;

EID: 0032764659     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00065-3     Document Type: Article

References (16)

1. [1] Johnson DS, McGeoch LA. The traveling salesman problem: a case study in local optimization. In: Aarts EHL, Lenstra JK. editors, Local search in combinatorial optimization, New York: Wiley, 1997:215-310.
2. [2] Punnen AP, Glover F. Implementing ejection chains with combinatorial leverage for the TSP. Research Report, Univ. of Colorado-Boulder, 1997.
3. [3] Rego C. Relaxed tours and path ejections for the traveling salesman problem. Technical Report, Lab. PRiSM, Univ. de Versailles, 1996.
4. [4] Burkard RE, Deineko VG, Woeginger GJ. The travelling salesman problem and the PQ-tree. Technical Report SFB56, Technical Univ. of Graz, January 1996. Published in Proceedings of the IPCO V, Lecture Notes in Computer Science, vol. 1084, Berlin: Springer, 1996:490-504.
5. [5] Glover F. Ejection chains, reference structures, and alternating path algorithms for traveling salesman problem. Research Report, Univ. of Colorado-Boulder, Graduate School of Business, 1992. A shortened version appeared in Discrete Applied Mathematics 1996;65:223-53.
6. [6] Reinelt G. The traveling salesman: computational solutions for TSP applications. Berlin: Springer, 1994.
7. [7] Angel E. Talk at the 5th Twente Workshop on Graphs and Combinatorial Optimization, May 1997.
8. [8] Carlier J, Villon P. A new heuristic for the traveling salesman problem. RAIRO, 1990;24:245-53.
9. [9] Deineko V, Woeginger GJ. A study of exponential neighbourhoods for the travelling salesman problem and for the quadratic assignment problem. Technical Report Woe-05, July 1997.
10. [10] Balas E, Simonetti N. Linear time dynamic programming algorithms for some new classes of restricted TSP's. Management Sci. Res. Report MSRR-617. Carnegie Mellon Univ., Pittsburg, 1996. A preliminary version appeared in Proceedings of the IPCO V, Lecture Notes in Computer Science vol. 1084, Berlin: Springer 1996;316-29.
11. [10] Balas E, Simonetti N. Linear time dynamic programming algorithms for some new classes of restricted TSP's. Management Sci. Res. Report MSRR-617. Carnegie Mellon Univ., Pittsburg, 1996. A preliminary version appeared in Proceedings of the IPCO V, Lecture Notes in Computer Science vol. 1084, Berlin: Springer 1996;316-29.
12. [11] Glover F, Punnen A. The traveling salesman problem: new solvable cases and linkages with the development of approximation algorithms. Journal of Operational Research Society 1997;48:502-10.
13. [12] Gutin G. On an approach for solving the traveling salesman problem. Proceedigs of the USSR Conference on System Research, Moscow, 1984:184-5 (in Russian).
14. [13] Gutin G. Exponential neighbourhood local search for the traveling salesman problem. Special Issue of Computers and Operations Research on the TSP, to appear.
15. [14] Punnen AP. The traveling salesman problem: new polynomial approximation algorithms and domination analysis. Manuscript, December 1996.
16. [15] 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, Math. Institute of Belorussian Acad. of Sci., Minsk, vol. 31, 1981:11-3 (in Russian).