Now showing items 1-10 of 77
Adapting the pheromone evaporation rate in dynamic routing problems
An ant system with direct communication for the capacitated vehicle routing problem.
(University of Manchester., 2011)
A memetic particle swarm optimization algorithm for multimodal optimization problems.
(Elsevier B.V., 2012)
Recently, multimodal optimization problems (MMOPs) have gained a lot of attention from the evolutionary algorithm (EA) community since many real-world applications are MMOPs and may require EAs to present multiple optimal ...
Guest editorial: memetic computing in the presence of uncertainties.
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 ...
Evolutionary dynamic optimization: test and evaluation environments.
Analyzing evolutionary algorithms for dynamic optimization problems based on the dynamical system.
An immigrants scheme based on environmental information for ant colony optimization for the dynamic travelling salesman problem.
Ant colony optimization (ACO) algorithms have proved to be powerful methods to address dynamic optimization problems. However, once the population converges to a solution and a dynamic change occurs, it is difficult for ...