Next Article in Journal
Some Relations on Hermite Matrix Polynomials
Previous Article in Journal
Cropped Quad-Tree Based Solid Object Colouring with Cuda
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
MCA
Volume 18
Issue 3
10.3390/mca18030313
mca-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles
Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Previous articles were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence, and they are hosted by MDPI on mdpi.com as a courtesy and upon agreement with Association for Scientific Research (ASR).
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A New Simulated Annealing Approach for Travelling Salesman Problem

by
Hüsamettin Bayram
1,* and
Ramazan Şahin
2,*
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
Versions Notes

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 Simulated Annealing; Travelling salesman problem; Roulette wheel selection; Meta-heuristics

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 Style

Bayram, 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

APA Style

Bayram, H., & Şahin, R. (2013). A New Simulated Annealing Approach for Travelling Salesman Problem. Mathematical and Computational Applications, 18(3), 313-322. https://doi.org/10.3390/mca18030313

Article Metrics

Back to TopTop