Το έργο με τίτλο Bumble bees mating optimization algorithm for the vehicle routing problem από τον/τους δημιουργό/ούς Marinakis Ioannis, Marinaki Magdalini διατίθεται με την άδεια Creative Commons Αναφορά Δημιουργού 4.0 Διεθνές
Βιβλιογραφική Αναφορά
Y. Marinakis and M. Marinaki, “Bumble Bees Mating Optimization Algorithm for the Vehicle Routing Problem”, in Handbook of Swarm Intelligence- Concepts, Principles and Applications, 2011, pp. 347-369. doi: 10.1007/978-3-642-17390-5_15
https://doi.org/10.1007/978-3-642-17390-5_15
Recently, a number of swarm intelligence algorithms based on the behaviour of the bees have been presented. These algorithms are divided, mainly, in two categories according to the bees’ behaviour in the nature, the foraging behaviour and the mating behaviour. The most important approaches that simulate the foraging behaviour of the bees are the Artificial Bee Colony algorithm, the Virtual Bee algorithm, the Bee Colony Optimization algorithm, the BeeHive algorithm, the Bee Swarm Optimization algorithm and the Bees algorithm. Contrary to the fact that there are many algorithms that are based on the foraging behaviour of the bees, the main algorithm proposed based on the mating behaviour is the Honey Bees Mating Optimization algorithm. This chapter introduces a new algorithmic nature inspired approach based on Bumble Bees Mating Optimization for successfully solving the Vehicle Routing Problem. Bumble Bees Mating Optimization algorithm is a new population-based swarm intelligence algorithm that simulates the mating behaviour that a swarm of bumble bees perform. Two sets of benchmark instances are used in order to test the proposed algorithm with very satisfactory results.