Ant colony optimization (ACO) algorithms have proved to be able to adapt to dynamic optimization problems (DOPs) when they are enhanced to maintain diversity and transfer knowledge. Several approaches have been integrated with ACO to improve its performance for DOPs. Among these integrations, the ACO algorithm with immigrants schemes has shown good results on the dynamic travelling salesman problem. In this paper, we investigate ACO algorithms to solve a more realistic DOP, the dynamic vehicle routing problem (DVRP) with traffic factors. Random immigrants and elitism-based immigrants are applied to ACO algorithms, which are then investigated on different DVRP test cases. The results show that the proposed ACO algorithms achieve promising results, especially when elitism-based immigrants are used. © 2012 Springer-Verlag.
CITATION STYLE
Mavrovouniotis, M., & Yang, S. (2012). Ant colony optimization with immigrants schemes for the dynamic vehicle routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7248 LNCS, pp. 519–528). https://doi.org/10.1007/978-3-642-29178-4_52
Mendeley helps you to discover research relevant for your work.