Dergiler / Mathematical and Computational Applications / 2013 / Cilt: 18 - Sayı: 3

A NEW SIMULATED ANNEALING APPROACH FOR TRAVELLING SALESMAN PROBLEM

Sayfa
313–322
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

The results have shown that the proposed techniques are more effective than conventional SA, both in terms of solution quality and time.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:The aim of this study is to improve searching capability of simulated annealing (SA) heuristic through integration of two new neighborhood mechanisms.
📊
Temel Bulgular & Veri:Due to its ease of formulation, difficulty to solve and various real life applications several Travelling Salesman Problems (TSP) were selected from the literature for the testing of the proposed methods.
💡
Sonuç & Katkı:The results have shown that the proposed techniques are more effective than conventional SA, both in terms of solution quality and time.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Alan Parametreleri

Abstract

The aim of this study is to improve searching capability of simulated annealing (SA) heuristic through integration of two new neighborhood mechanisms. Due to its ease of formulation, difficulty to solve and various real life applications several Travelling Salesman Problems (TSP) were selected from the literature for the testing of the proposed methods. The proposed methods were also compared to conventional SA with swap neighborhood. The results have shown that the proposed techniques are more effective than conventional SA, both in terms of solution quality and time.

🔖

Bu Makaleye Atıf Yap

BAYRAM, H., ŞAHİN, R. (2013). A NEW SIMULATED ANNEALING APPROACH FOR TRAVELLING SALESMAN PROBLEM. Mathematical and Computational Applications, Cilt: 18 - Sayı: 3, 313–322. https://ajindex.com/articles/279798

📄 Tam Metin PDF Okuyucu

📄

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

Kaynakça (14)

  1. E. Aarts, J. K. Lenstra, Local search in combinatorial optimization, Chichester, U.K., Wiley
  2. G. Gutin, Traveling salesman problems, Handbook of Graph theory, Boca Raton, U.S.A, CRC Press, 2003
  3. S. Kirkpatrick, C.D. Gelatt, M.P. Vecchi, Optimization by Simulated Annealing, Science 220, 671-680, 1983.4. V. Cerny, Thermodynamical Approach to the Traveling Salesman Problem: An Efficient Simulation Algorithm, Journal of Optimization Theory and Applications 45(1), 41-51, 1985
  4. R. Zhang, C. Wu, A hybrid immune simulated annealing algorithm for the job shop scheduling problem, Applied Soft Computing 10, 79-89, 2010
  5. R. Şahin, A Simulated Annealing Algorithm for Solving the Bi-Objective Facility Layout Problem, Expert Systems with Applications 38(4), 4460-4465, 2011
  6. B. Cakir, F. Altiparmak, B. Dengiz, Multi-objective optimization of a stochastic assembly line balancing: A hybrid simulated annealing algorithm, Computers & Industrial Engineering 60, 376-384, 2011
  7. S.W. Lin, V.F. Yu, S.Y. Chou, Solving the truck and trailer routing problem based on a simulated annealing heuristic, Computers & Operations Research 36, 1683-1692, 2009
  8. H. Szu, R. Hartley, Fast Simulated Annealing, Physics Letters A 122, 157-162, 1987
  9. L. Ingber, A. Petraglia, M.R. Petraglia, M.A.S. Machado, Adaptive simulated annealing, Stochastic global optimization and its applications with fuzzy adaptive simulated annealing, 33-62, Springer Berlin Heidelberg
  10. L. Ingber,Very fast simulated re-annealing, Mathematical and computer modeling 12, 967-973, 1989
  11. G. Dueck, T. Scheuer, Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing, Journal of computational physics 90, 161-175, 1990
  12. P. Czyzzak, A. Jaszkiewicz, Pareto simulated annealing-a metaheuristic technique for multiple-objective combinatorial optimization, Journal of Multi-Criteria Decision Analysis 7, 34-47, 1998
  13. M. Malek, M. Guruswamy, M. Pandya, H. Owens, Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem, Annals of Operations Research 21, 59-84, 1989
  14. X. Geng, Z. Chen, W. Yang, D. Shi, K. Zhao, Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search, Applied Soft Computing 11, 3680-3689, 2011 16. M. Kalender, A.Kheiri, E. Ozcan, E.K. Burke, A greedy gradient-simulated annealing hyper-heuristic for a curriculum-based course timetabling proble