Experimenting an Artificial Bee Colony algorithm to approach the capacitated vehicle routing problem

ThŒis paper is focused on the comparison of results obtained by the resolution of the capacitated vehicle routing problem. A modi€ed algorithm of classical arti€cial bee colony (ABC) is described and implemented in this article, in particular, a new type of neighborhood operator is introduced. Œe idea on the base of ABC is creating an algorithm of Swarm - Intelligence which mimics the behavior of a honey bee swarm. Œe performance of the proposed metaheuristic is evaluated on two sets of standard benchmark instances and is compared with the well-known results obtained by savings algorithm of Clarke and Wright and with those calculated using ABC-enhanced by Szeto et al. Œe computational results show that the proposed ABC outperforms the Saving algorithm and that it can produce good solutions when compared with the ABC-enhanced.