Now showing items 1-4 of 4
Ant algorithms with immigrants schemes for the dynamic vehicle routing problem
Many real-world optimization problems are subject to dynamic environments that require an optimization algorithm to track the optimum during changes. Ant colony optimization (ACO) algorithms have proved to be powerful ...
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 immigrants schemes for the dynamic railway junction rescheduling problem with multiple delays
Train rescheduling after a perturbation is a challenging task and is an important concern of the railway industry as delayed trains can lead to large fines, disgruntled customers and loss of revenue. Sometimes not just one ...
Applying ant colony optimization to dynamic binary-encoded problems
Ant colony optimization (ACO) algorithms have proved to be able to adapt to dynamic optimization problems (DOPs) when stagnation behaviour is addressed. Usually, permutation-encoded DOPs, e.g., dynamic travelling salesman ...