Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/B9919BA0-2470-4CB3-9C2D-10104CB6DE6F | ||
| Έτος | 2008 | ||
| Τύπος | Περίληψη Δημοσίευσης σε Συνέδριο | ||
| Άδεια Χρήσης |
|
||
| Βιβλιογραφική Αναφορά | Y. Marinakis, M. Marinaki and N. Matsatsinis, “Honey Bees Mating Optimization for the Location Routing Problem”, in IEEE International Engineering Management Conference, 2008, pp. 1-5. doi: 10.1109/IEMCE.2008.4618013 https://doi.org/10.1109/IEMCE.2008.4618013 | ||
| Εμφανίζεται στις Συλλογές |
This paper introduces a new hybrid algorithmic nature inspired approach based on honey bees mating optimization, for solving successfully one of the most popular supply chain management problems, the location routing problem (LRP). The proposed algorithm for the solution of the location routing problem, the hybrid honey bees mating optimization (HBMO-LRP), combines a honey bees mating optimization (HBMO) algorithm, the multiple phase neighborhood search - greedy randomized adaptive search procedure (MPNS-GRASP) algorithm, the expanding neighborhood search (ENS) strategy and a path relinking (PR) strategy. The algorithm is tested on a set of benchmark instances. The results of the algorithm are very satisfactory for these instances and for seven of them a new best solution has been found.
Copyright © DIAS 2013
