A MARRIAGE IN HONEY BEE OPTIMISATION APPROACH TO THE ASYMMETRIC TRAVELLING SALESMAN PROBLEM

dc.contributor.authorCelik, Yuksel
dc.contributor.authorUlker, Erkan
dc.date.accessioned2020-03-26T18:23:31Z
dc.date.available2020-03-26T18:23:31Z
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.endpage4132en_US
dc.identifier.issn1349-4198en_US
dc.identifier.issn1349-418Xen_US
dc.identifier.issue6en_US
dc.identifier.startpage4123en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12395/27671
dc.identifier.volume8en_US
dc.identifier.wosWOS:000305161100018en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherICIC INTERNATIONALen_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 in honey bee optimisation (MBO)en_US
dc.subjectTravelling salesman problem (TSP)en_US
dc.subjectAsymmetric travelling salesman problem (ATSP)en_US
dc.subjectSwarm intelligenceen_US
dc.titleA MARRIAGE IN HONEY BEE OPTIMISATION APPROACH TO THE ASYMMETRIC TRAVELLING SALESMAN PROBLEMen_US
dc.typeArticleen_US

Dosyalar