ABSTRACT
In this chapter, a new version of the bumble bees mating optimization (BBMO) algorithm, the adaptive memory bumble bees mating optimization (ABBMO), is presented. BBMO is an algorithm that simulates the mating behavior of the bumble bees. It has been applied in a number of different problems, mainly in routing problems. The novelty of the proposed ABBMO algorithm compared with the other BBMO algorithms is that a replacement in the feeding procedure of the path re-linking (PR) with an adaptive memory is realized and, thus, a faster and very effective method is proposed. The algorithm is used for the solution of the location routing problem with stochastic demands with very good results in a number of benchmark instances, and it is compared in these instances with the computational results of other algorithms from the literature giving very satisfactory computational results.
