Niching for Population-Based Ant Colony Optimization

Authors:
Daniel Angus
Affiliations:
Swinburne University of Technology, Australia
Venue:
E-SCIENCE '06 Proceedings of the Second IEEE International Conference on e-Science and Grid Computing
Year:
2006

Citing 0
Cited 5

Ant Colony Optimization with Castes

ICANN '08 Proceedings of the 18th international conference on Artificial Neural Networks, Part I
Computational Intelligence in Radio Astronomy: Using Computational Intelligence Techniques to Tune Geodesy Models

SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
Optimising efficiency and gain of small meander line RFID antennas using ant colony system

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Population-based ant colony optimisation for multi-objective function optimisation

ACAL'07 Proceedings of the 3rd Australian conference on Progress in artificial life
Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most Ant Colony Optimization (ACO) algorithms are able to find a single (or few) optimal, or near-optimal, solutions to difficult (NP-hard) problems. An issue though is that a small change to the problem can have a large impact on a specific solution by decreasing its quality, or worse still, by rendering it infeasible. Niching methods, such as fitness sharing and crowding, have been implemented with success in the field of Evolutionary Computation (EC) and are aimed at simultaneously locating and maintaining multiple optima to increase search robustness - typically in multi-modal function optimization. In this paper it is shown that a niching technique applied to an ACO algorithm permits the simultaneous location and maintenance of multiple areas of interest in the search space.