The application of ant colony optimization in the solution of 3D traveling salesman problem on a sphere

Basit Öğe Kaydı
dc.contributor.authorEldem, Huseyin
dc.contributor.authorUlker, Erkan
dc.date.accessioned2020-03-26T19:42:47Z
dc.date.available2020-03-26T19:42:47Z
dc.date.issued2017
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractTraveling Salesman Problem (TSP) is a problem in combinatorial optimization that should be solved by a salesperson who has to travel all cities at the minimum cost (minimum route) and return to the starting city (node). Todays, to resolve the minimum cost of this problem, many optimization algorithms have been used. The major ones are these metaheuristic algorithms. In this study, one of the metaheuristic methods, Ant Colony Optimization (ACO) method (Max-Min Ant System - MMAS), was used to solve the Non-Euclidean TSP, which consisted of sets of different count points coincidentally located on the surface of a sphere. In this study seven point sets were used which have different point count. The performance of the MMAS method solving Non-Euclidean TSP problem was demonstrated by different experiments. Also, the results produced by ACO are compared with Discrete Cuckoo Search Algorithm (DCS) and Genetic Algorithm (GA) that are in the literature. The experiments for TSP on a sphere, show that ACO's average results were better than the GA's average results and also best results of ACO successful than the DCS. (C) 2017 Karabuk University. Publishing services by Elsevier B.V. This is an open access article under the CC BY-NC-ND licenseen_US
dc.identifier.doi10.1016/j.jestch.2017.08.005en_US
dc.identifier.endpage1248en_US
dc.identifier.issn2215-0986en_US
dc.identifier.issue4en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage1242en_US
dc.identifier.urihttps://dx.doi.org/10.1016/j.jestch.2017.08.005
dc.identifier.urihttps://hdl.handle.net/20.500.12395/35519
dc.identifier.volume20en_US
dc.identifier.wosWOS:000413972500002en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherELSEVIER - DIVISION REED ELSEVIER INDIA PVT LTDen_US
dc.relation.ispartofENGINEERING SCIENCE AND TECHNOLOGY-AN INTERNATIONAL JOURNAL-JESTECHen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectAnt colony optimizationen_US
dc.subjectMetaheuristicen_US
dc.subjectSpherical geometryen_US
dc.subjectMax-Min Ant Systemen_US
dc.subjectnonEuclidean TSPen_US
dc.titleThe application of ant colony optimization in the solution of 3D traveling salesman problem on a sphereen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu