A Marriage in Honey Bee Ooptimisation Approach to the Asymmetric Travelling Salesman Problem
Yükleniyor...
Dosyalar
Tarih
2012
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In 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.
Açıklama
Anahtar Kelimeler
Asymmetric Travelling Salesman Problem (ATSP), Marriage in Honey Bee Optimisation (MBO), Swarm Intelligence, Travelling Salesman Problem (TSP)
Kaynak
International Journal of Innovative Computing, Information and Control
WoS Q Değeri
Scopus Q Değeri
Q3
Cilt
8
Sayı
6
Künye
Çelik, Y., Ülker, E., (2012). A Marriage in Honey Bee Ooptimisation Approach to the Asymmetric Travelling Salesman Problem. International Journal of Innovative Computing, Information and Control, 8(6), 4123-4132.
