Solving capacitated vehicle routing problem by artificial bee colony algorithm

Abstract

This paper presents a new Artificial Bee Colony algorithm for solving the capacitated vehicle routing problem. The main novel characteristic of the proposed approach relies upon an efficient way of coordinating, for each group of bees, a well-defined focus of work. In the algorithm, we provide two specializations namely diversification and intensification where the former is controlled by the employed and the scout bees whereas the latter by the onlookers. The two datasets commonly used as benchmark instances are used to assess the performance of the proposed algorithm. The results show that the proposed algorithm obtains interesting results.