The Traveling Salesman Problem (TSP) is one of the most well known combinatorial optimization problem and has wide range of application. Since the TSP is NP-hard, many heuristics for the TSP have been developed. This study proposes a new heuristic for the TSP based on one of these heuristics named Local Clustering Optimization (LCO). LCO is a metaheuristic proposed by Furukawa at el. to give an accurate solution for large scale problems in a reasonable time. However, conventional LCO-based heuristics for the TSP is not suited to solving asymmetric instances. The proposed method iteratively adopts tour construction heuristics such as nearest neighbor and random insertion to get an accurate solution more efficiently for the both asymmetric and symmetric TSP. The proposed method and other heuristics are applied to benchmark instances from TSPLIB and randomly generated instances. The experiment shows the proposed method is superior to conventional LCO in terms of accuracy of the solution. However, the proposed method is inefficient for instances which are not close to Euclidean due to the same property of insertion heuristic.
Skip Nav Destination
Close
Sign In or Register for Account
ASME/ISCIE 2012 International Symposium on Flexible Automation
June 18–20, 2012
St. Louis, Missouri, USA
Conference Sponsors:
- Dynamic Systems and Control Division
ISBN:
978-0-7918-4511-0
PROCEEDINGS PAPER
A New Heuristic for Traveling Salesman Problem Based on LCO
Soichiro Yokoyama
,
Soichiro Yokoyama
Hokkaido University, Sapporo, Hokkaido, Japan
Search for other works by this author on:
Ikuo Suzuki
,
Ikuo Suzuki
Hokkaido University, Sapporo, Hokkaido, Japan
Search for other works by this author on:
Masahito Yamamoto
,
Masahito Yamamoto
Hokkaido University, Sapporo, Hokkaido, Japan
Search for other works by this author on:
Masashi Furukawa
Masashi Furukawa
Hokkaido University, Sapporo, Hokkaido, Japan
Search for other works by this author on:
Soichiro Yokoyama
Hokkaido University, Sapporo, Hokkaido, Japan
Ikuo Suzuki
Hokkaido University, Sapporo, Hokkaido, Japan
Masahito Yamamoto
Hokkaido University, Sapporo, Hokkaido, Japan
Masashi Furukawa
Hokkaido University, Sapporo, Hokkaido, Japan
Paper No:
ISFA2012-7227, pp. 345-350; 6 pages
Published Online:
July 23, 2013
Citation
Yokoyama, S, Suzuki, I, Yamamoto, M, & Furukawa, M. "A New Heuristic for Traveling Salesman Problem Based on LCO." Proceedings of the ASME/ISCIE 2012 International Symposium on Flexible Automation. ASME/ISCIE 2012 International Symposium on Flexible Automation. St. Louis, Missouri, USA. June 18–20, 2012. pp. 345-350. ASME. https://doi.org/10.1115/ISFA2012-7227
Download citation file:
- Ris (Zotero)
- Reference Manager
- EasyBib
- Bookends
- Mendeley
- Papers
- EndNote
- RefWorks
- BibTex
- ProCite
- Medlars
Close
Sign In
2
Views
0
Citations
Related Proceedings Papers
Related Articles
Hierarchical Optimization-Based Approach for Two-Dimensional Rectangular Layout Design Problems
J. Comput. Inf. Sci. Eng (December,2014)
Constructing Rigid-Foldable Generalized Miura-Ori Tessellations for Curved Surfaces
J. Mechanisms Robotics (February,2021)
Design of Dynamic Systems Using Surrogate Models of Derivative Functions
J. Mech. Des (October,2017)
Related Chapters
Selection of the Order of the Construction of Structures of a Multiple-Structure Project, Taking Into Account Time-Cost Optimisation
International Conference on Control Engineering and Mechanical Design (CEMD 2017)
Construction and Optimization of New Platforms Based on the Mega-Frame Theory
International Conference on Mechanical and Electrical Technology 2009 (ICMET 2009)
Part 2, Section II—Materials and Specifications
Companion Guide to the ASME Boiler and Pressure Vessel Code, Volume 1, Third Edition