Now showing items 1-10 of 40
Ant colony optimization with memory-based immigrants for the dynamic vehicle routing problem.
A recent integration showed that ant colony optimization (ACO) algorithms with immigrants schemes perform well on different variations of the dynamic travelling salesman problem. In this paper, we address ACO for the dynamic ...
Ant colony optimization with immigrants schemes for the dynamic vehicle routing problem.
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 ...
Dynamic vehicle routing: A memetic ant colony optimization approach
Empirical study on the effect of population size on MAX-MIN ant system in dynamic environments
(IEEE Press, 2016-07)
In this paper, the effect of the population size on the performance of the MAX -MIN ant system for dynamic optimization problems (DOPs) is investigated. DOPs are generated with the dynamic benchmark generator for ...
An Adaptive Multi-Population Framework for Locating and Tracking Multiple Optima
(IEEE Press, 2015-11-30)
Multi-population methods are effective to solve dynamic optimization problems. However, to efficiently track multiple optima, algorithm designers need to address a key issue: how to adapt the number of populations. In this ...
Adapting the pheromone evaporation rate in dynamic routing problems
Memory-based immigrants for ant colony optimization in changing environments.
Ant colony optimization (ACO) algorithms have proved that they can adapt to dynamic optimization problems (DOPs) when they are enhanced to maintain diversity. DOPs are important due to their similarities to many real-world ...