A New Simulated Annealing Approach for Travelling Salesman Problem
1
Department of Industrial Engineering Hitit University, Çorum, Turkey
2
Department of Industrial Engineering Gazi University, Ankara, Turkey
*
Authors to whom correspondence should be addressed.
Math. Comput. Appl. 2013, 18(3), 313-322; https://doi.org/10.3390/mca18030313
Published: 1 December 2013
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.
Share and Cite
MDPI and ACS Style
Bayram, H.; Şahin, R. A New Simulated Annealing Approach for Travelling Salesman Problem. Math. Comput. Appl. 2013, 18, 313-322. https://doi.org/10.3390/mca18030313
AMA Style
Bayram H, Şahin R. A New Simulated Annealing Approach for Travelling Salesman Problem. Mathematical and Computational Applications. 2013; 18(3):313-322. https://doi.org/10.3390/mca18030313
Chicago/Turabian StyleBayram, Hüsamettin, and Ramazan Şahin. 2013. "A New Simulated Annealing Approach for Travelling Salesman Problem" Mathematical and Computational Applications 18, no. 3: 313-322. https://doi.org/10.3390/mca18030313
