An efficient solving of the traveling salesman problem: the ant colony system having parameters optimized by the Taguchi method

Basit Öğe Kaydı
dc.authoridSEN, BAHA/0000-0003-3577-2548
dc.contributor.authorPeker, Musa
dc.contributor.authorSen, Baha
dc.contributor.authorKumru, Pinar Yildiz
dc.date.accessioned2024-09-29T16:08:18Z
dc.date.available2024-09-29T16:08:18Z
dc.date.issued2013
dc.departmentKarabük Üniversitesien_US
dc.description.abstractOwing to its complexity, the traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics. The TSP is defined as the provision of minimization of total distance, cost, and duration by visiting the n number of points only once in order to arrive at the starting point. Various heuristic algorithms used in many fields have been developed to solve this problem. In this study, a solution was proposed for the TSP using the ant colony system and parameter optimization was taken from the Taguchi method. The implementation was tested by various data sets in the Traveling Salesman Problem Library and a performance analysis was undertaken. In addition to these, a variance analysis was undertaken in order to identify the effect values of the parameters on the system. Implementation software was developed using the MATLAB program, which has a useful interface and simulation support.en_US
dc.identifier.doi10.3906/elk-1109-44
dc.identifier.endpage2036en_US
dc.identifier.issn1300-0632
dc.identifier.issn1303-6203
dc.identifier.scopus2-s2.0-84889595045en_US
dc.identifier.scopusqualityQ3en_US
dc.identifier.startpage2015en_US
dc.identifier.urihttps://doi.org/10.3906/elk-1109-44
dc.identifier.urihttps://hdl.handle.net/20.500.14619/7479
dc.identifier.volume21en_US
dc.identifier.wosWOS:000326161300015en_US
dc.identifier.wosqualityQ3en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherTubitak Scientific & Technological Research Council Turkeyen_US
dc.relation.ispartofTurkish Journal of Electrical Engineering and Computer Sciencesen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectAnt colony systemen_US
dc.subjectTaguchi methoden_US
dc.subjectroute planningen_US
dc.subjecttraveling salesman problemen_US
dc.titleAn efficient solving of the traveling salesman problem: the ant colony system having parameters optimized by the Taguchi methoden_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

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