A new simulated annealing approach for travelling salesman problem
Yükleniyor...
Tarih
2013
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
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.
Açıklama
Anahtar Kelimeler
Meta-Heuristics, Roulette Wheel Selection, Simulated Annealing, Travelling Salesman Problem
Kaynak
Mathematical and Computational Applications
WoS Q Değeri
Scopus Q Değeri
N/A
Cilt
18
Sayı
3
Künye
Bayram, H., Şahn, R. (2013). A new simulated annealing approach for travelling salesman problem. Mathematical and Computational Applications, 18(3), 313-322.
