Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016).
Articles in this Issue were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence.
Articles are hosted by MDPI on mdpi.com as a courtesy and upon agreement with the previous journal publisher.
Math. Comput. Appl. 2013, 18(3), 313-322; https://doi.org/10.3390/mca18030313
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.
Published: 1 December 2013
PDF [634 KB, uploaded 9 March 2016]
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.Keywords:
Simulated Annealing; Travelling salesman problem; Roulette wheel selection; Meta-heuristics
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).
Share & Cite This Article
MDPI and ACS Style
Bayram, H.; Şahin, R. A New Simulated Annealing Approach for Travelling Salesman Problem. Math. Comput. Appl. 2013, 18, 313-322.
Article Metrics
Comments
[Return to top]
Math. Comput. Appl.
EISSN 2297-8747
Published by MDPI AG, Basel, Switzerland
RSS
E-Mail Table of Contents Alert