Dynamic vehicle routing: A memetic ant colony optimization approach
Journal
Studies in Computational Intelligence
Date Issued
January 1, 2013
Author(s)
DOI
10.1007/978-3-642-39304-4_11
Abstract
Over the years, several variations of the dynamic vehicle routing problem (DVRP) have been considered due to its similarities with many real-world applications. Several methods have been applied to address DVRPs, in which ant colony optimization (ACO) has shown promising results due to its adaptation capabilities. In this chapter, we generate another variation of the DVRP with traffic factor and propose a memetic algorithm based on the ACO framework to address it. Multiple local search operators are used to improve the exploitation capacity and a diversity scheme based on random immigrants is used to improve the exploration capacity of the algorithm. The proposed memetic ACO algorithm is applied on different test cases of the DVRP with traffic factors and is compared with other peer ACO algorithms. The experimental results show that the proposed memetic ACO algorithm shows promising results. © 2013 Springer-Verlag Berlin Heidelberg.