Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/E9203DEB-F950-4EEB-BBDA-DF307F6D8E57 | ||
| Year | 2015 | ||
| Type of Item | Peer-Reviewed Journal Publication | ||
| License |
|
||
| Bibliographic Citation | Y. Marinakis and M. Marinaki, "Combinatorial neighborhood topology bumble bees mating optimization for the vehicle routing problem with stochastic demands‖, " Soft Comp., nol. 19,no.2 , pp. 353-373,Feb. 2015.doi:10.1007/s00500-014-1257-1 https://doi.org/10.1007/s00500-014-1257-1 | ||
| Appears in Collections |
The bumble bees mating optimization (BBMO) algorithm is a relatively new swarm intelligence algorithm that simulates the mating behavior that a swarm of bumble bees performs. In this paper, this nature inspired algorithm is used in a hybrid scheme with other metaheuristic algorithms for successfully solving the vehicle routing problem with stochastic demands (VRPSD). More precisely, the proposed algorithm for the solution of the VRPSD, the combinatorial neighborhood topology bumble bees mating optimization, combines a BBMO algorithm, the variable neighborhood search algorithm and a path relinking procedure. The algorithm is evaluated on a set of benchmark instances (40 instances) from the literature and 16 new best solutions are found. The algorithm is compared with a number of algorithms from the literature (two versions of a particle swarm optimization algorithm, the classic one and the combinatorial expanding neighborhood topology particle swarm optimization algorithm, a differential evolution algorithm, a genetic algorithm and a honey bees mating optimization) and with the initial version of the BBMO algorithm.
Copyright © DIAS 2013
