{"type":"ScholarlyArticle","title":"A Novel Local Search Algorithm for the Traveling Salesman Problem that Exploits Backbones","authors":[{"name":"Weixiong Zhang","slug":"weixiong-zhang","given":"Weixiong","family":"Zhang","affiliation":"Department of Computer Science and Engineering Washington University in Saint Louis Saint Louis , MO 63130 , USA"},{"name":"Moshe Looks","slug":"moshe-looks","given":"Moshe","family":"Looks","affiliation":"Department of Computer Science and Engineering Washington University in Saint Louis Saint Louis , MO 63130 , USA"}],"abstract":"We present and investigate a new method for the Traveling Salesman Problem (TSP) that incorporates backbone information into the well known and widely applied Lin-Kernighan (LK) local search family of algorithms for the problem. We consider how heuristic backbone information can be obtained and develop methods to make biased local perturbations in the LK algorithm and its variants by exploiting heuristic backbone information to improve their efficacy. We present extensive experimental results, using large instances from the TSP Challenge suite and real-world instances in TSPLIB, showing the significant improvement that the new method can provide over the original algorithms.","doi":null,"url":"https://ijcai.org/proceedings/2005/182","pdf":"https://ijcai.org/proceedings/2005/0182.pdf","markdown":"https://ijcai.org/proceedings/2005/182.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/182","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":182,"pages":{"first":343,"last":349},"keywords":[],"videos":[],"references":[{"position":1,"raw":"K. D. Boese. Models for Iterative Global Optimization. PhD thesis, UCLA/Computer Science Department, 1996.","title":"Models for Iterative Global Optimization","authors":"K D Boese","year":"1996","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"W. Cook and P. Seymour. Tour merging via branch- decomposition. INFORMS J. of Computing, to appear.","title":"Tour merging via branchdecomposition","authors":"W Cook, P Seymour","year":null,"venue":"INFORMS J. of Computing","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"O. Dubois and G. Dequen. A backbone-search heuristic for ef- ficient solving of hard 3-SAT formula. In Proc. of IJCAI-01, pages 248-53, 2001.","title":"A backbone-search heuristic for efficient solving of hard 3-SAT formula","authors":"O Dubois, G Dequen","year":"2001","venue":"Proc. of IJCAI-01","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"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.","title":"Efficient local search with search space smoothing: A case study of the traveling salesman problem (TSP)","authors":"J Gu, X Huang","year":"1994","venue":"IEEE Trans. SMC","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"G. Gutin and A.P. Punnen, editors. The Traveling Salesman Problem and Its Variations. Kluwer, 2002.","title":"The Traveling Salesman Problem and Its Variations","authors":null,"year":"2002","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"K. Helsgaun. An effective implementation of the lin-kernighan traveling salesman heuristic. European J. Operations Research, 126:106-130, 2000.","title":"An effective implementation of the lin-kernighan traveling salesman heuristic","authors":"K Helsgaun","year":"2000","venue":"European J. Operations Research","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"T. Hogg, B.A. Huberman, and C. Williams. Phase transitions and the search problem. Artificial Intelligence, 81:1-15, 1996.","title":"Phase transitions and the search problem","authors":"T Hogg, B A Huberman, C Williams","year":"1996","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"D. S. Johnson. 8th dimacs implementation challenge: The TSP. http://www.research.att.com/ dsj/chtsp.","title":"8th dimacs implementation challenge: The TSP","authors":"D S Johnson","year":null,"venue":null,"doi":null,"url":"http://www.research.att.com/dsj/chtsp","internal_url":null},{"position":9,"raw":"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.","title":"Experimental analysis of heuristics for the STSP","authors":"D S Johnson, L A Mcgeoch","year":"2002","venue":"The Traveling Salesman Problem and its Variations","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"S. Lin and B.W. Kernighan. An effective heuristic algorithm for the Traveling Salesman Problem. Operations Research, 21:498- 516, 1973.","title":"An effective heuristic algorithm for the Traveling Salesman Problem","authors":"S Lin, B W Kernighan","year":"1973","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"O. Martin, S. W. Otto, and E. W. Felten. Large-step Markov chains for the traveling salesman problem. Complex Systems, 5:299-326, 1991.","title":"Large-step Markov chains for the traveling salesman problem","authors":"O Martin, S W Otto, E W Felten","year":"1991","venue":"Complex Systems","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity from characteristic 'phase transitions'. Nature, 400:133-137, 1999.","title":"Determining computational complexity from characteristic 'phase transitions","authors":"R Monasson, R Zecchina, S Kirkpatrick, B Selman, L Troyansky","year":"1999","venue":"Nature","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"J.C. Pemberton and W. Zhang. Epsilon-transformation: Exploit- ing phase transitions to solve combinatorial optimization prob- lems. Artificial Intelligence, 81:297-325, 1996.","title":"Epsilon-transformation: Exploiting phase transitions to solve combinatorial optimization problems","authors":"J C Pemberton, W Zhang","year":"1996","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"G. Reinelt. TSPLIB -a traveling salesman problem library. ORSA J. Computing, 3:376-384, 1991.","title":"TSPLIB -a traveling salesman problem library","authors":"G Reinelt","year":"1991","venue":"ORSA J. Computing","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"B. Selman, H. Kautz, and B. Cohen. Noise strategies for local search. In Proc. of AAAI-94, pages 337-43, 1994.","title":"Noise strategies for local search","authors":"B Selman, H Kautz, B Cohen","year":"1994","venue":"Proc. of AAAI-94","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"W. Zhang. Configuration landscape analysis and backbone guided local search: Part I: satisfiability and maximum satis- fiability. Artificial Intelligence, 158(1):1-26, 2004.","title":"Configuration landscape analysis and backbone guided local search: Part I: satisfiability and maximum satisfiability","authors":"W Zhang","year":"2004","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}