Now showing items 1-10 of 114
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 algorithm with adaptive hill climbing strategy for dynamic optimization problems.
Dynamic optimization problems challenge traditional evolutionary algorithms seriously since they, once converged, cannot adapt quickly to environmental changes. This paper investigates the application of memetic algorithms, ...
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 ...
A clustering particle swarm optimizer for locating and tracking multiple optima in dynamic environments
In the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but also to track the trajectory of the changing ...
Guest editorial: memetic computing in the presence of uncertainties.
A review of personal communications services.
(Nova Science Publishers., 2009)
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 ...