Future Generation Computer Systems
Inferential Performance Assessment of Stochastic Optimisers and the Attainment Function
EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
Bi-Criterion Optimization with Multi Colony Ant Algorithms
EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
Ant Colony Optimization
Ant Colony Optimization for Multi-Objective Optimization Problems
ICTAI '07 Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 01
EA'09 Proceedings of the 9th international conference on Artificial evolution
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
On the Invariance of Ant Colony Optimization
IEEE Transactions on Evolutionary Computation
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Automatic configuration of multi-objective ACO algorithms
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Automatic generation of multi-objective ACO algorithms for the bi-objective knapsack
ANTS'12 Proceedings of the 8th international conference on Swarm Intelligence
Hi-index | 0.00 |
Over the last few years, there have been a number of proposals of ant colony optimization (ACO) algorithms for tackling multiobjective combinatorial optimization problems. These proposals adapt ACO concepts in various ways, for example, some use multiple pheromone matrices and multiple heuristic matrices and others use multiple ant colonies. In this article, we carefully examine several of the most prominent of these proposals. In particular, we identify commonalities among the approaches by recasting the original formulation of the algorithms in different terms. For example, several proposals described in terms of multiple colonies can be cast equivalently using a single ant colony, where ants use different weights for aggregating the pheromone and/or the heuristic information. We study algorithmic choices for the various proposals and we identify previously undetected trade-offs in their performance