Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Distance related: a procedure for applying directly Artificial Bee Colony algorithm in routing problems

Trachanatzi Dimitra, Rigakis Manousos, Marinaki Magdalini, Marinakis Ioannis, Matsatsinis Nikolaos

Simple record


URIhttp://purl.tuc.gr/dl/dias/43808083-BCB9-43D9-8EF0-203A07D815AD-
Identifierhttps://doi.org/10.1007/s00500-019-04438-w-
Identifierhttps://link.springer.com/article/10.1007/s00500-019-04438-w-
Languageen-
Extent19 pagesen
TitleDistance related: a procedure for applying directly Artificial Bee Colony algorithm in routing problemsen
CreatorTrachanatzi Dimitraen
CreatorΤραχανατζη Δημητραel
CreatorRigakis Manousosen
CreatorΡηγακης Μανουσοςel
CreatorMarinaki Magdalinien
CreatorΜαρινακη Μαγδαληνηel
CreatorMarinakis Ioannisen
CreatorΜαρινακης Ιωαννηςel
CreatorMatsatsinis Nikolaosen
CreatorΜατσατσινης Νικολαοςel
PublisherSpringer Natureen
Content SummaryThe aim of the present paper is to introduce an innovative algorithmic approach, the Distance Related Artificial Bee Colony Algorithm (DRABC), as a variant of the original Artificial Bee Colony (ABC) algorithm. The aforementioned approach has been employed in the solution of the team orienteering problem (TOP). TOP fits into the category of vehicle routing problems with Profits, and such, each node is associated with a score value. The objective of the TOP is the formation of feasible routes with respect to a total travel time limit that corresponds to the total score value maximization. Summarizing the proposed approach, the algorithm applies the original equations of the ABC, on accordingly encoded solution vectors, namely on vectors that present the Euclidean distance between consecutive nodes in a route. This process is combined with a decoding method, to express the solution vector as an ordered sequence of nodes. This encoding/decoding method is referred to as “Distance Related” procedure. The proposed approach achieves most of the best known solutions of the benchmark instances found in the literature, and the performance of the DRABC algorithm is compared to others regarding the solution of the TOP.en
Type of ItemPeer-Reviewed Journal Publicationen
Type of ItemΔημοσίευση σε Περιοδικό με Κριτέςel
Licensehttp://creativecommons.org/licenses/by/4.0/en
Date of Item2020-10-26-
Date of Publication2020-
SubjectArtificial Bee Colonyen
SubjectEvolutionary algorithmsen
SubjectTeam Orienteering Problemen
Bibliographic CitationD. Trachanatzi, M. Rigakis, M. Marinaki, Y. Marinakis and N. Matsatsinis, "Distance related: a procedure for applying directly Artificial Bee Colony algorithm in routing problems," Soft Comput., vol. 24, no. 12, pp. 9071-9089, June, 2020. doi: 10.1007/s00500-019-04438-wen

Services

Statistics