Skip to main content

Advertisement

SpringerLink
Log in

A list-based simulated annealing algorithm with crossover operator for the traveling salesman problem

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

The traveling salesman problem (TSP) is one of the most popular combinatorial optimization problems today. It is a problem that is easy to identify but hard to solve. Therefore, it belongs to the class of NP-hard optimization problems, and it is a problem of high time complexity. The TSP can be used to solve various real-world problems. Therefore, researchers use it as a standard test bench for performance evaluation of new algorithms. In this study, a new simulated annealing algorithm with crossover operator was proposed, and it was called LBSA-CO. The LBSA-CO is a population-based metaheuristic method. In this method, a list-based temperature cooling schedule, which can adapt to the topology of the solution space of the problem, was used. The solutions in the population were improved with the inversion, insertion and 2-opt local search operators. The order crossover (OX1) and genetic edge recombination crossover (ER) operators were applied to the improved solutions to accelerate the convergence. In addition, the Taguchi method was used to tune the parameters of the LBSA-CO. The proposed method was tested on 65 well-known TSP instances. The results indicated that this method performs better than the state-of-the-art methods on many instances.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Gary MR, Johnson DS (1979). Computers and intractability: a guide to the theory of np completeness WH Freeman and Co. New York

  2. Johnson DS (1990) Local optimization and the traveling salesman problem. In: Paterson MS (ed) Automata, languages and programming. Springer-Verlag, Berlin/Heidelberg, pp 446–461. https://doi.org/10.1007/BFb0032050

    Chapter  Google Scholar 

  3. Held M, Karp RM (1962) A dynamic programming approach to sequencing problems. J Soc Ind Appl Math 10(1):196–210

    Article  MathSciNet  Google Scholar 

  4. Lawler EL, Wood DE (1966) Branch-and-bound methods: A survey. Oper Res 14(4):699–719

    Article  MathSciNet  Google Scholar 

  5. Padberg M, Rinaldi G (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev 33(1):60–100

    Article  MathSciNet  Google Scholar 

  6. Miliotis P (1978) Using cutting planes to solve the symmetric travelling salesman problem. Math Program 15(1):177–188

    Article  MathSciNet  Google Scholar 

  7. Dantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling-salesman problem. J Oper Res Soc Am 2(4):393–410

    MathSciNet  MATH  Google Scholar 

  8. Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498–516

    Article  MathSciNet  Google Scholar 

  9. Martin O, Otto SW, Felten EW (1991) Large-step markov chains for the traveling salesman problem. oregon graduate institute of science and technology, department of computer science and engineering

  10. Helsgaun K (2006) An effective implementation of K-opt moves for the Lin-Kernighan TSP heuristic (Doctoral dissertation. Roskilde University, Department of Computer Science)

    Google Scholar 

  11. Helsgaun K (2009) General k-opt submoves for the Lin-Kernighan TSP heuristic. Math Program Comput 1(2–3):119–163

    Article  MathSciNet  Google Scholar 

  12. Dong C, Jäger G, Richter D, Molitor P (2009) Effective tour searching for TSP by contraction of pseudo backbone edges. In: Goldberg AV, Zhou Y (eds) Algorithmic Aspects in Information and Management: 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 175–187. https://doi.org/10.1007/978-3-642-02158-9_16

    Chapter  Google Scholar 

  13. Cook W, Seymour P (2003) Tour merging via branch-decomposition. INFORMS J Comput 15(3):233–248

    Article  MathSciNet  Google Scholar 

  14. Nagata Y, Kobayashi S (2013) A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. INFORMS J Comput 25(2):346–363

    Article  MathSciNet  Google Scholar 

  15. Yang XS (2010) Nature-inspired metaheuristic algorithms. Luniver press

  16. Hussain A, Muhammad YS, Sajid MN (2018) An improved genetic algorithm crossover operator for traveling salesman problem. Turkish J Math Comput Sci 9:1–13

    Google Scholar 

  17. Saji Y, Riffi ME (2016) A novel discrete bat algorithm for solving the travelling salesman problem. Neural Comput Appl 27(7):1853–1866

    Article  Google Scholar 

  18. Ezugwu AES, Adewumi AO (2017) Discrete symbiotic organisms search algorithm for travelling salesman problem. Expert Syst Appl 87:70–78

    Article  Google Scholar 

  19. Akhand MA, Akter S, Rashid MA, Yaakob SB. (2015) Velocity tentative PSO: an optimal velocity implementation based particle swarm optimization to solve traveling salesman problem. IAENG Int J Comput Sci 42(3)

  20. Zhan SH, Lin J, Zhang ZJ, Zhong YW (2016). List-based simulated annealing algorithm for traveling salesman problem. Computational intelligence and neuroscience

  21. Osaba E, Yang XS, Diaz F, Lopez-Garcia P, Carballedo R (2016) An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng Appl Artif Intell 48:59–71

    Article  Google Scholar 

  22. Hatamlou A (2018) Solving travelling salesman problem using black hole algorithm. Soft Comput 22(24):8167–8175

    Article  Google Scholar 

  23. Khan I, Maiti MK (2019) A swap sequence based artificial bee colony algorithm for traveling salesman problem. Swarm Evol Comput 44:428–438

    Article  Google Scholar 

  24. Akhand MAH, Ayon SI, Shahriyar SA, Siddique N, Adeli H (2020) Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput 86:105887

    Article  Google Scholar 

  25. Gündüz M, Kiran MS, Özceylan E (2015) A hierarchic approach based on swarm intelligence to solve the traveling salesman problem. Turk J Electr Eng Comput Sci 23(1):103–117

    Article  Google Scholar 

  26. Mahi M, Baykan ÖK, Kodaz H (2015) A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem. Appl Soft Comput 30:484–490

    Article  Google Scholar 

  27. Ezugwu AES, Adewumi AO, Frîncu ME (2017) Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem. Expert Syst Appl 77:189–210

    Article  Google Scholar 

  28. Wang C, Lin M, Zhong Y, Zhang H (2015) Solving travelling salesman problem using multiagent simulated annealing algorithm with instance-based sampling. Int J Comput Sci Math 6(4):336–353

    Article  MathSciNet  Google Scholar 

  29. Chen SM, Chien CY (2011) Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Syst Appl 38(12):14439–14450

    Article  Google Scholar 

  30. Khanra A, Maiti MK, Maiti M (2015) Profit maximization of TSP through a hybrid algorithm. Comput Ind Eng 88:229–236

    Article  Google Scholar 

  31. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680

    Article  MathSciNet  Google Scholar 

  32. Askarzadeh A, dos Santos Coelho L, Klein CE, Mariani VC (2016). A population-based simulated annealing algorithm for global optimization. In 2016 IEEE international conference on systems, man, and cybernetics (SMC) (pp. 004626–004633). IEEE

  33. Wang L, Cai R, Lin M, Zhong Y (2019) Enhanced List-Based Simulated Annealing Algorithm for Large-Scale Traveling Salesman Problem. IEEE Access 7:144366–144380

    Article  Google Scholar 

  34. Ingber L (1996) Adaptive simulated annealing (ASA): lessons learned. Control Cybern 25(1):32–54

    MATH  Google Scholar 

  35. Jeong SJ, Kim KS, Lee YH (2009) The efficient search method of simulated annealing using fuzzy logic controller. Expert Syst Appl 36(3):7099–7103

    Article  Google Scholar 

  36. Hime A, e Oliveira, Antonio Petraglia (2013) Solving nonlinear systems of functional equations with fuzzy adaptive simulated annealing. Appl Soft Comput 13(11):4349–4357. https://doi.org/10.1016/j.asoc.2013.06.018

    Article  Google Scholar 

  37. Zhong Y, Lin J, Wang L, Zhang H (2018) Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem. Swarm Evol Comput 42:77–88

    Article  Google Scholar 

  38. Davis L (1985) Applying adaptive algorithms to epistatic domains. In Proceedings of the 9th International joint conference on artificial intelligence, 85, 162–164.

  39. Whitley LD, Starkweather T, D'Ann Fuquay (1989). Scheduling problems and traveling salesmen: The genetic edge recombination operator. In Proceedings of the 3rd international conference on genetic algorithms, 89, 133–40

  40. Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech J 44(10):2245–2269

    Article  MathSciNet  Google Scholar 

  41. Reinelt G (1991) TSPLIB - A traveling salesman problem library. ORSA J Comput 3(4):376–384

    Article  Google Scholar 

  42. Taguchi G (1986). Introduction to quality engineering: designing quality into products and processes (No. 658.562 T3)

  43. Mozdgir A, Mahdavi I, Badeleh IS, Solimanpur M (2013) Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing. Math Comput Model 57(1–2):137–151

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechatronic Engineering, Faculty of Engineering, Necmettin Erbakan University, 42090, Konya, Turkey

    İlhan İlhan

  2. Department of Educational Sciences, Institute of Educational Sciences, Necmettin Erbakan University, 42090, Konya, Turkey

    Gazi Gökmen

Authors
  1. İlhan İlhan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gazi Gökmen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to İlhan İlhan.

Ethics declarations

Conflict of interest

The authors declare that there is no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

İlhan, İ., Gökmen, G. A list-based simulated annealing algorithm with crossover operator for the traveling salesman problem. Neural Comput & Applic 34, 7627–7652 (2022). https://doi.org/10.1007/s00521-021-06883-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-021-06883-x

Keywords

Search

Navigation