Journals / An International Journal of Optimization and Control: Theories & Applications (IJOCTA) / 2016 / Cilt: 6 - Sayı: 2

Using 2-Opt based evolution strategy for travelling salesman problem

Pages
2103–2113
Publication Date
2022-10-11
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

It is seen that the proposed algorithm offers valuable solutions.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Harmony search algorithm that matches the (µ+1) evolution strategy, is a heuristic method simulated by the process of music improvisation.
📊
Key Findings & Data:Instead of conventional selection operators such as roulette wheel, the transformation of real number values of harmony search algorithm to order index of vertex representation and improvement of solutions are obtained by using the 2-Opt local search algorithm.
💡
Conclusion & Impact:It is seen that the proposed algorithm offers valuable solutions.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

Harmony search algorithm that matches the (µ+1) evolution strategy, is a heuristic method simulated by the process of music improvisation. In this paper, a harmony search algorithm is directly used for the travelling salesman problem. Instead of conventional selection operators such as roulette wheel, the transformation of real number values of harmony search algorithm to order index of vertex representation and improvement of solutions are obtained by using the 2-Opt local search algorithm. Then, the obtained algorithm is tested on two different parameter groups of TSPLIB. The proposed method is compared with classical 2-Opt which randomly started at each step and best known solutions of test instances from TSPLIB. It is seen that the proposed algorithm offers valuable solutions.

🔖

Cite This Article

KARAGUL, K., TOKAT, S., AYDEMİR, E. (2022). Using 2-Opt based evolution strategy for travelling salesman problem. An International Journal of Optimization and Control: Theories & Applications (IJOCTA), Cilt: 6 - Sayı: 2, 2103–2113. https://ajindex.com/articles/440702

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (15)

  1. Laporte G, The Traveling Salesman Problem: An overview of exact and approximate algorithms, European Journal of Operational Research, Vol. 59, pp. 231-247, (1992)
  2. Croes GA, A Method for Solving TravellingSalesman Problems. Operations Research, Vol. 6, No. 6, pp. 791-812, (1958)
  3. Holland JH, Adaptation in Natural and Artificial Systems. MIT Press, Cambridge, Mass., USA, (1975)
  4. Kirkpatrick S, Gelatt JrCD, Vecchi MP, Optimization by simulated annealing. Science, Vol. 220, No. 4598, pp. 671-680, (1983)
  5. Geem ZW, Kim JH, Loganathan GV, A new heuristic optimization algorithm: harmony search. Simulation, Vol. 76, No. 2, pp. 60-68, (2001)
  6. Yang XS, Harmony Search as a Metaheuristic Algorithm. in Music-Inspired Harmony Search Algorithm. 2009, Springer Berlin / Heidelberg. pp. 1-14, (2009)
  7. Sureja N, New Inspirations in Nature: A Survey. International Journal of Computer Applications & Information Technology, pp.21-24, (2012)
  8. Abdel-Raouf O, Metwally MAB, A Survey of Harmony Search Algorithm. International Journal of Computer Applications, pp.17-26, (2013
  9. Freisleben B, Merz P, Genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. in Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC '96), pp. 616-621, (1996)
  10. Chowdhury A, Ghosh A, Sinha S, Das S, Ghosh A, A novel genetic algorithm to solve travelling salesman problem and blocking flow shop scheduling problem. International Journal of Bio-Inspired Computation, Vol. 5, No. 5, pp. 303-314, (2013)
  11. Wang Y, Tian D, An improved simulated annealing algorithm for traveling salesman problem. in Proceedings of the International Conference on Information Technology and Software Engineering, Vol. 211 of Lecture Notes In Electrical Engineering, pp. 525-532, (2013)
  12. Fiechter CN, A parallel tabu search algorithm for large traveling salesman problems. Discrete Applied Mathematics, Vol. 51, No. 3, pp. 243- 267, (1994)
  13. Stüzle T, Hoos H, MAX-MIN Ant system and local search for the traveling salesman problem. Reference Future Generations Computer Systems, Vol. 16, No. 8, pp. 889-914, (1997)
  14. Randall M, Montgomery J, The accumulated experience Ant colony for the traveling salesman problem. International Journal of Computational Intelligence and Applications, Vol.3, No.2, pp. 189-198, (2003)
  15. Chu SC, Roddick JF, Pan JS, Ant colony system with communication strategies. Information Sciences, Vol.