A Marriage Honey Bee Optimization Approach to the Asymmetric Traveling Salesman Problem

Basit Öğe Kaydı
dc.contributor.authorÇelik, Yüksel
dc.contributor.authorÜlker, Erkan
dc.date.accessioned2020-03-26T18:30:51Z
dc.date.available2020-03-26T18:30:51Z
dc.date.issued2012
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractIn the travelling salesman problem (TSP), a travelling salesman completes a tour of “n” number of cities by stopping once in each city and completes the tour by returning to his starting point, while minimizing the distance and the cost. The asymmetric travelling salesman problem (ATSP) is the problem in which the cost of travel from city A to B is different from that from B to A. Marriage in Honey Bee Optimisation (MBO) is a meta-heuristic procedure inspired by the mating and insemination process of honey bees. In this study, we seek to use an MBO algorithm for an optimal solution to the ATSP problem, which has previously been solved by different methods. The results of the MBO algorithm for ATSP are compared with Genetic Algorithm (GA), another meta-heuristic method.en_US
dc.identifier.citationÇelik, Y., Ülker, E., (2012). A Marriage Honey Bee Optimization Approach to the Asymmetric Traveling Salesman Problem. International Journal of Innovative Computing, Information and Control, 4(2), 595-602.
dc.identifier.endpage602en_US
dc.identifier.issn1308-7711en_US
dc.identifier.issue2en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.startpage595en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12395/28216
dc.identifier.volume4en_US
dc.identifier.wosWOS:000304504700004en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.institutionauthorÜlker, Erkan
dc.language.isoenen_US
dc.publisherSILA SCIENCEen_US
dc.relation.ispartofInternational Journal of Innovative Computing, Information and Controlen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectMarriage honey bee optimizationen_US
dc.subjectTravelling salesman problemen_US
dc.subjectSwarm intelligenceen_US
dc.subjectAsymmetric travelling salesman problem
dc.titleA Marriage Honey Bee Optimization Approach to the Asymmetric Traveling Salesman Problemen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
28216.pdf
Boyut:
289.15 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Makale Dosyası
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Bilgisayar Mühendisliği Bölümü/Makale Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu