Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/B85725E1-EFFD-4E32-8C19-3D45D1D3DD1D | ||
| Year | 2012 | ||
| Type of Item | Conference Paper Abstract | ||
| License |
|
||
| Bibliographic Citation | Y. Marinakis, M. Marinaki and G. Dounias, “Honey Bees Mating Optimization Algorithm for the Vehicle Routing Problem”, in Nature Inspired Cooperative Strategies for Optimization, 2007,pp. 139-148. doi: 10.1007/978-3-540-78987-1_13 https://doi.org/10.1007/978-3-540-78987-1_13 | ||
| Appears in Collections |
This paper introduces a new hybrid algorithmic nature inspired approach based on Honey Bees Mating Optimization, for successfully solving the Vehicle Routing Problem. The proposed algorithm for the solution of the Vehicle Routing Problem, the Honey Bees Mating Optimization (HBMOVRP), combines a Honey Bees Mating Optimization (HBMO) algorithm and the Multiple Phase Neighbor- hood Search — Greedy Randomized Adaptive Search Procedure (MPNS-GRASP) algorithm. The proposed algorithm is tested on a set of benchmark instances and produced very satisfactory results. In all instances, the average quality is less than 0.20%. More specifically, in the fourteen classic instances proposed by Christofides, the average quality is 0.029%. The algorithm is ranked in the 2th place among the most known and effective algorithms in the literature and in the first place among all Nature Inspired methods that have ever been used for this set of instances.
Copyright © DIAS 2013
