Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
EN  |  EL

Αναζήτηση

Πλοήγηση

Ο Χώρος μου

A glowworm swarm optimization algorithm for the vehicle routing problem with stochastic demands

Marinaki Magdalini, Marinakis Ioannis

Απλή Εγγραφή


URIhttp://purl.tuc.gr/dl/dias/8BE32E53-454C-4D09-98A7-3BF6F0ED5DF0-
Αναγνωριστικόhttps://www.sciencedirect.com/science/article/pii/S0957417415006995?via%3Dihub-
Αναγνωριστικόhttps://doi.org/10.1016/j.eswa.2015.10.012-
Γλώσσαen-
Μέγεθος19 pagesen
ΤίτλοςA glowworm swarm optimization algorithm for the vehicle routing problem with stochastic demandsen
ΔημιουργόςMarinaki Magdalinien
ΔημιουργόςΜαρινακη Μαγδαληνηel
ΔημιουργόςMarinakis Ioannisen
ΔημιουργόςΜαρινακης Ιωαννηςel
ΕκδότηςElsevieren
ΠερίληψηThe Glowworm Swarm Optimization (GSO) algorithm is a relatively new swarm intelligence algorithm that simulates the movement of the glowworms in a swarm based on the distance between them and on a luminescent quantity called luciferin. This algorithm has been proven very efficient in the problems that has been applied. However, there is no application of this algorithm, at least to our knowledge, in routing type problems. In this paper, this nature inspired algorithm is used in a hybrid scheme (denoted as Combinatorial Neighborhood Topology Glowworm Swarm Optimization (CNTGSO)) with other metaheuristic algorithms (Variable Neighborhood Search (VNS) algorithm and Path Relinking (PR) algorithm) for successfully solving the Vehicle Routing Problem with Stochastic Demands. The major challenge is to prove that the proposed algorithm could efficiently be applied in a difficult combinatorial optimization problem as most of the applications of the GSO algorithm concern solutions of continuous optimization problems. Thus, two different solution vectors are used, the one in the continuous space (which is updated as in the classic GSO algorithm) and the other in the discrete space and it represents the path representation of the route and is updated using Combinatorial Neighborhood Topology technique. A migration (restart) phase is, also, applied in order to replace not promising solutions and to exchange information between solutions that are in different places in the solution space. Finally, a VNS strategy is used in order to improve each glowworm separately. The algorithm is tested in two problems, the Capacitated Vehicle Routing Problem and the Vehicle Routing Problem with Stochastic Demands in a number of sets of benchmark instances giving competitive and in some instances better results compared to other algorithms from the literature. en
ΤύποςPeer-Reviewed Journal Publicationen
ΤύποςΔημοσίευση σε Περιοδικό με Κριτέςel
Άδεια Χρήσηςhttp://creativecommons.org/licenses/by/4.0/en
Ημερομηνία2018-10-19-
Ημερομηνία Δημοσίευσης2016-
Θεματική ΚατηγορίαCombinatorial Neighborhood Topologyen
Θεματική ΚατηγορίαGlowworm Swarm Optimizationen
Θεματική ΚατηγορίαPath relinkingen
Θεματική ΚατηγορίαVariable Neighborhood Searchen
Θεματική ΚατηγορίαVehicle Routing Problem with Stochastic Demandsen
Βιβλιογραφική ΑναφοράM. Marinaki and Y. Marinakis, "A glowworm swarm optimization algorithm for the vehicle routing problem with stochastic demands," Expert Syst. Appl., vol. 46, pp. 145-163, Mar. 2016. doi: 10.1016/j.eswa.2015.10.012en

Υπηρεσίες

Στατιστικά