poster

Hybrid simulated annealing algorithm based on adaptive cooling schedule for TSP

Authors:

Yi Liu,

Shengwu Xiong,

Hongbing LiuAuthors Info & Claims

GEC '09: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation

Pages 895 - 898

https://doi.org/10.1145/1543834.1543969

Published: 12 June 2009 Publication History

Get Access

Abstract

The traveling salesman problem is one of the most notoriously intractable NP-complete optimization problems. Over the last 10 years, simulated annealing and tabu search have emerged as an effective algorithm for the TSP. However, the quality of solutions found by using tabu search approach depends on the initial solution and the iteration process of simulated annealing is slow. To overcome this problem and provide an efficient methodology for the TSP, the heuristic search approach based on simulated annealing which combining tabu search strategy and two neighborhood perturbation factor is developed. The proposed hybrid algorithm is tested on standard benchmark sets and compared with the conventional simulated annealing algorithm. The computational results show that the proposed algorithm has significantly better convergence speed compared with conventional simulated annealing algorithm and can obtain high-quality solutions within reasonable computing times.

References

[1]

R. Durbin and D. Willshaw. An anlaogue approach to the traveling salesman problem using an elastic net approach. Nature, 326(6114):689--691, 1987.

Crossref

Google Scholar

[2]

T.Guo and Z.Michalewize. Inver-over operator for the tsp. In Proceedings of the 5th International Conference on Parallel Problem Solving from Nature, pages 802--812. IEEE, July 1998.

Digital Library

Google Scholar

[3]

Z.C.Huang, X.L.Hu, and S.D.Chen. Dynamic traveling salesman problem based on evolutionary computation. In Proceedings of Congress on Evolutionary Computation, pages 1283--1288. IEEE, May 2001.

Google Scholar

[4]

Aimin Zhou, Lishan Kang, and Zhenyu Yan. Solving dynamic tsp with evolutionary approach in real time. In Proceedings of Congress on Evolutionary Computation, pages 951--957. IEEE, December 2003.

Google Scholar

[5]

F. Glover. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 13(5):533--549, 1986.

Digital Library

Google Scholar

[6]

C. D. Gelatt Jr S. Kirkpatrick and M. P. Vecchi. Optimization by simulated annealing. Science, 220(4598):671--680, 1983.

Crossref

Google Scholar

[7]

Nader Azizi and Saeed Zolfaghari. Adaptive temperature control for simulated annealng:a comparative study. Computers and Operations Research, 13(31):2439--2451, 2004.

Digital Library

Google Scholar

[8]

S. Lin and B.W. Kernighan. An effective heuristic algorithm for the traveling--salesman problem. Computers and Operations Research, 21(2):498--516, 1973.

Digital Library

Google Scholar

[9]

P. Tian, H. Wang, and D. Zhang. Solving the travelling salesman problem by simulated annealing. Journal of Shanghai Jiaotong University, 29(12):111--116, 1995.

Google Scholar

[10]

F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, Dordrecht, 1997.

Digital Library

Google Scholar

[11]

J. Knox. Tabu search performance on the symmetric tsp. Computers and Operations Research, 21(8):786--802, 1994.

Digital Library

Google Scholar

[12]

T. H. Wu and C. C. Chang. A tabu search heuristic for the traveling salesman problem. Journal of Da-Yeh University, 19(1):87--99, 1997.

Google Scholar

Cited By

View all

Khaoula CMorad BEssaid R(2022)SailFish Optimizer Algorithm to Solve the Traveling Salesman ProblemHybrid Intelligent Systems10.1007/978-3-030-96305-7_21(225-232)Online publication date: 4-Mar-2022
https://doi.org/10.1007/978-3-030-96305-7_21
Raju SChandrasekaran M(2018)An improved neighbor cooperation using adjacent node cooperation in peer to peer networksCluster Computing10.1007/s10586-017-1607-8Online publication date: 4-Jan-2018
https://doi.org/10.1007/s10586-017-1607-8
Wang YXu N(2017)A Hybrid Particle Swarm Optimization Method for Traveling Salesman ProblemInternational Journal of Applied Metaheuristic Computing10.4018/IJAMC.20170701048:3(53-65)Online publication date: Jul-2017
https://doi.org/10.4018/IJAMC.2017070104
Show More Cited By

Index Terms

Hybrid simulated annealing algorithm based on adaptive cooling schedule for TSP
1. Mathematics of computing
  1. Probability and statistics
    1. Probabilistic reasoning algorithms
      1. Markov-chain Monte Carlo methods
        Simulated annealing

Recommendations

Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search

The traveling salesman problem (TSP) is a classical problem in discrete or combinatorial optimization and belongs to the NP-complete classes, which means that it may be require an infeasible processing time to be solved by an exhaustive search method, ...
A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem

The rectangle knapsack packing problem is to pack a number of rectangles into a larger stock sheet such that the total value of packed rectangles is maximized. The paper first presents a fitness strategy, which is used to determine which rectangle is to ...
Benchmarking Tabu Search and Simulated Annealing for the Capacitated Vehicle Routing Problem
ICCMB '21: Proceedings of the 2021 4th International Conference on Computers in Management and Business

This paper addresses the Capacitated Vehicle Routing Problem (CVRP) consisting of a single depot and several customers that are supplied with goods by capacitated vehicles from a depot. The main objective of the vehicle routing problem is to minimize ...

Comments

Information & Contributors

Information

Published In

GEC '09: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation

June 2009

1112 pages

ISBN:9781605583266

DOI:10.1145/1543834

General Chairs:
Lihong Xu
Tongji University, China
,
Erik D. Goodman
Michigan State University, USA
,
Program Chairs:
Guoliang Chen
University of Sci. & Tech. of China
,
Darrell Whitley
Colorado State University, USA
,
Yongsheng Ding
Donghua University, China

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 June 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

GEC '09

Sponsor:

GEC '09: GEC '09 - ACM/SIGEVO Genetic and Evolutionary Computation Summit

June 12 - 14, 2009

Shanghai, China

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
561
Total Downloads

Downloads (Last 12 months)12
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Khaoula CMorad BEssaid R(2022)SailFish Optimizer Algorithm to Solve the Traveling Salesman ProblemHybrid Intelligent Systems10.1007/978-3-030-96305-7_21(225-232)Online publication date: 4-Mar-2022
https://doi.org/10.1007/978-3-030-96305-7_21
Raju SChandrasekaran M(2018)An improved neighbor cooperation using adjacent node cooperation in peer to peer networksCluster Computing10.1007/s10586-017-1607-8Online publication date: 4-Jan-2018
https://doi.org/10.1007/s10586-017-1607-8
Wang YXu N(2017)A Hybrid Particle Swarm Optimization Method for Traveling Salesman ProblemInternational Journal of Applied Metaheuristic Computing10.4018/IJAMC.20170701048:3(53-65)Online publication date: Jul-2017
https://doi.org/10.4018/IJAMC.2017070104
Wang Y(2015)Statistical analysis of frequency graph for traveling salesman problemJournal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology10.5555/2740244.274025628:3(1109-1118)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.5555/2740244.2740256
Saji YRiffi MAhiod B(2014)Discrete bat-inspired algorithm for travelling salesman problem2014 Second World Conference on Complex Systems (WCCS)10.1109/ICoCS.2014.7060983(28-31)Online publication date: Nov-2014
https://doi.org/10.1109/ICoCS.2014.7060983
Wang YTian DLi Y(2012)An Improved Simulated Annealing Algorithm for Traveling Salesman ProblemProceedings of the 2012 International Conference on Information Technology and Software Engineering10.1007/978-3-642-34522-7_56(525-532)Online publication date: 6-Nov-2012
https://doi.org/10.1007/978-3-642-34522-7_56
Yai-Fung Lim Pei-Yee Hong Ramli RKhalid R(2011)An improved tabu search for solving symmetric traveling salesman problems2011 IEEE Colloquium on Humanities, Science and Engineering10.1109/CHUSER.2011.6163857(851-854)Online publication date: Dec-2011
https://doi.org/10.1109/CHUSER.2011.6163857

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search

A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem

Benchmarking Tabu Search and Simulated Annealing for the Capacitated Vehicle Routing Problem

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations