Now showing items 1-4 of 4
An ant system with direct communication for the capacitated vehicle routing problem.
(University of Manchester., 2011)
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 ...
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 ...
A memetic ant colony optimization algorithm for the dynamic travelling salesman problem.
Ant colony optimization (ACO) has been successfully applied for combinatorial optimization problems, e.g., the travelling salesman problem (TSP), under stationary environments. In this paper, we consider the dynamic TSP ...