Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/39A77DE6-54FF-4DA5-848B-6AA445C4AC5E | ||
| Έτος | 2019 | ||
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | ||
| Άδεια Χρήσης |
|
||
| Βιβλιογραφική Αναφορά | E. Rapanaki, I.-D. Psychas, M., Marinaki, and Y. Marinakis, “An Artificial Bee Colony algorithm for the multiobjective energy reduction multi-depot vehicle routing problem,” in Learning and Intelligent Optimization, vol 11968, Lecture Notes in Computer Science, N. Matsatsinis, Y. Marinakis, P. Pardalos, Eds., Cham, Switzerland: Springer Nature, 2020, pp. 208–223, doi: 10.1007/978-3-030-38629-0_17. https://doi.org/10.1007/978-3-030-38629-0_17 | ||
| Εμφανίζεται στις Συλλογές |
Artificial Bee Colony algorithm is a very powerful Swarm Intelligence Algorithm that has been applied in a number of different kind of optimization problems since the time that it was published. In recent years there is a growing number of optimization models that trying to reduce the energy consumption in routing problems. In this paper, a new variant of Artificial Bee Colony algorithm, the Parallel Multi-Start Multiobjective Artificial Bee Colony algorithm (PMS-ABC) is proposed for the solution of a Vehicle Routing Problem variant, the Multiobjective Energy Reduction Multi-Depot Vehicle Routing Problem (MERMDVRP). In the formulation four different scenarios are proposed where the distances between the customers and the depots are either symmetric or asymmetric and the customers have either demand or pickup. The algorithm is compared with three other multiobjective algorithms, the Parallel Multi-Start Non-dominated Sorting Differential Evolution (PMS-NSDE), the Parallel Multi-Start Non-dominated Sorting Particle Swarm Optimization (PMS-NSPSO) and the Parallel Multi-Start Non-dominated Sorting Genetic Algorithm II (PMS-NSGA II) in a number of benchmark instances.
Copyright © DIAS 2013
