Improvements to the Or-opt heuristic for the symmetric travelling salesman problem

Journal of the Operational Research Society

Volumn 58, Issue 3, 2007, Pages 402-407

  Babin, G ^a   Deneault, S ^a   Laporte, G ^a  

^a HEC MONTRÉAL   (Canada)

Author keywords

Edge and chain exchanges; Local search heuristics; Symmetric travelling salesman problem

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; RANDOM PROCESSES; TRAVELING SALESMAN PROBLEM;

CHAIN EXCHANGES; LOCAL SEARCH HEURISTICS; PLANAR INSTANCES; SYMMETRIC TRAVELLING SALESMAN PROBLEMS;

HEURISTIC METHODS;

EID: 33846851742     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602160     Document Type: Article

References (18)

1. Applegate D, Bixby R, Chvátal V and Cook W (2003). Implementing the Dantzig-Fulkerson-Johnson algorithm for large scale traveling salesman problems. Math Program Ser B 97:91-153.
2. Bentley JL (1992). Fast algorithms for geometric traveling salesman problems. ORSA J Comput 4: 387-411.
3. Croes GA (1958). A method for solving large scale symmetric traveling salesman problems to optimality. Opns Res 6: 791-812.
4. Dantzig GB, Fulkerson DR and Johnson SM (1954). Solution of a large scale traveling salesman problem. Opns Res 2: 393-410.
5. Golden BL and Stewart WR (1985). Empirical analysis of heuristics. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (eds). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester, pp 207-249.
6. Gutin G and Punnen AP (eds) (2002). The Traveling Salesman Problem and Its Variations. Kluwer: Boston.
7. Hansen P and Mladenović N (2005). First improvement may be better than best improvement: an empirical study. Discrete Appl Math (doi: 10.1016/j.dam.2005.05.020).
8. Helsgaun K (2000). An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur J Opl Res 126: 106-130.
9. Johnson DS et al. (2002). Experimental analysis of heuristics for the ATSP. In: Gutin G and Punnen AP (eds). The Traveling Salesman Problem and Its Variations. Kluwer, Boston, pp 445-487.
10. Johnson DS and McGeoch LA (1997). The traveling salesman problem: a case study. In: Aarts E and Lenstra JK. (eds). Local Search in Combinatorial Optimization. Wiley, Chichester, pp 215-310.
11. Johnson DS and McGeoch LA (2002). Experimental analysis of heuristics for the STSP. In: Gutin G and Punnen AP (eds). The Traveling Salesman Problem and Its Variations. Kluwer, Boston, pp 369-443.
12. Kanji GK (1994). 100 Statistical Tests. Sage: London.
13. Laporte G and Semet FJ (2002). Classical heuristics for the capacitated VRP. In: Toth P and Vigo D (eds). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 109-128.
14. Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (eds) (1985). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley: Chichester.
15. Lin S (1965). Computer solutions of the traveling salesman problem. Bell System Technical Journal 44: 2245-2269.
16. Lin S and Kernighan BW (1973). An effective heuristic algorithm for the traveling salesman problem. Opns Res 21: 972-989.
17. Or I (1976). Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. PhD thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.
18. Zweig G (1995). An effective tour construction and improvement procedure for the traveling salesman problem. Opns Res 43: 1049-1059.