A new simulated annealing approach for travelling salesman problem

dc.contributor.authorBayram, Hüsamettin
dc.contributor.authorŞahin, Ramazan
dc.date.accessioned2019-05-13T09:08:29Z
dc.date.available2019-05-13T09:08:29Z
dc.date.issued2013
dc.departmentHitit Üniversitesi, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü
dc.description.abstractThe 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.
dc.identifier.citationBayram, H., Şahn, R. (2013). A new simulated annealing approach for travelling salesman problem. Mathematical and Computational Applications, 18(3), 313-322.
dc.identifier.endpage322en_US
dc.identifier.issn1300-686X
dc.identifier.issue3en_US
dc.identifier.scopusqualityN/A
dc.identifier.startpage313en_US
dc.identifier.urihttps://hdl.handle.net/11491/2003
dc.identifier.volume18en_US
dc.indekslendigikaynakScopus
dc.indekslendigikaynakTR-Dizin
dc.language.isoen
dc.relation.ispartofMathematical and Computational Applications
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectMeta-Heuristicsen_US
dc.subjectRoulette Wheel Selectionen_US
dc.subjectSimulated Annealingen_US
dc.subjectTravelling Salesman Problemen_US
dc.titleA new simulated annealing approach for travelling salesman problem
dc.typeArticle

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Yükleniyor...
Küçük Resim
İsim:
hüsamettin-bayram2013.pdf
Boyut:
633.88 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text