A novel local search algorithm for the traveling salesman problem that exploits backbones

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 343-348

  Zhang, Weixiong ^a   Looks, Moshe ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LIN-KERNIGHAN; LOCAL PERTURBATION; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; ORIGINAL ALGORITHMS; REAL-WORLD;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; HEURISTIC METHODS;

TRAVELING SALESMAN PROBLEM;

EID: 33749002709     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. K. D. Boese. Models for Iterative Global Optimization. PhD thesis, UCLA/Computer Science Department, 1996.
2. W. Cook and P. Seymour. Tour merging via branch-decomposition. INFORMS J. of Computing, to appear.
3. O. Dubois and G. Dequen. A backbone-search heuristic for efficient solving of hard 3-SAT formula. In Proc. of IJCAI-01, pages 248-53, 2001.
4. J. Gu and X. Huang. Efficient local search with search space smoothing: A case study of the traveling salesman problem (TSP). IEEE Trans. SMC, 24:728-735, 1994.
5. G. Gutin and A.P. Punnen, editors. The Traveling Salesman Problem and Its Variations. Kluwer, 2002.
6. K. Helsgaun. An effective implementation of the lin-kernighan traveling salesman heuristic. European J. Operations Research, 126:106-130, 2000.
7. T. Hogg, B.A. Huberman, and C. Williams. Phase transitions and the search problem. Artificial Intelligence, 81:1-15, 1996.
8. D. S. Johnson. 8th dimacs implementation challenge: The TSP. http://www.research.att.com/̃dsj/chtsp.
9. D. S. Johnson and L. A. McGeoch. Experimental analysis of heuristics for the STSP. In The Traveling Salesman Problem and its Variations, pages 369-443. Kluwer, 2002.
10. S. Lin and B.W. Kernighan. An effective heuristic algorithm for the Traveling Salesman Problem. Operations Research, 21:498-516, 1973.
11. O. Martin, S. W. Otto, and E. W. Felten. Large-step Markov chains for the traveling salesman problem. Complex Systems, 5:299-326, 1991.
12. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity from characteristic 'phase transitions'. Nature, 400:133-137, 1999.
13. J.C. Pemberton and W. Zhang. Epsilon-transformation: Exploiting phase transitions to solve combinatorial optimization problems. Artificial Intelligence, 81:297-325, 1996.
14. G. Reinelt. TSPLIB - a traveling salesman problem library. ORSA J. Computing, 3:376-384, 1991.
15. B. Selman, H. Kautz, and B. Cohen. Noise strategies for local search. In Proc. of AAAI-94, pages 337-43, 1994.
16. W. Zhang. Configuration landscape analysis and backbone guided local search: Part I: satisfiability and maximum satisfiability. Artificial Intelligence, 158(1):1-26, 2004.