Now showing items 1-2 of 2
An Ant Colony Optimization Based Memetic Algorithm for the Dynamic Travelling Salesman Problem
(ACM Press, 2015-07)
Ant colony optimization (ACO) algorithms have proved to be able to adapt for solving dynamic optimization problems (DOPs). The integration of local search algorithms has also proved to significantly improve the output of ...
Ant colony optimization with local search for dynamic travelling salesman problems
For a dynamic travelling salesman problem, the weights (or travelling times) between two cities (or nodes) may be subject to changes. Ant colony optimization (ACO) algorithms have proved to be powerful methods to tackle ...