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 ...
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 ...