Now showing items 1-3 of 3
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 ...
Multi-colony ant algorithms for the dynamic travelling salesman problem
(IEEE Press, 2014-12)
A multi-colony ant colony optimization (ACO) algorithm consists of several colonies of ants. Each colony uses a separate pheromone table in an attempt to maximize the search area explored. Over the years, multi-colony ACO ...
Pheromone modification strategy for the dynamic travelling salesman problem with weight changes
Ant colony optimization (ACO) algorithms have proved to be able to adapt in problems that change dynamically. One of the key issues for ACO when a change occurs is that the pheromone trails generated in the previous ...