Sensitivity analysis of ACO start strategies for subset problems

Authors:
Stefka Fidanova;Pencho Marinov;Krassimir Atanassov
Affiliations:
IPP, Bulgarian Academy of Sciences, Sofia, Bulgaria;IPP, Bulgarian Academy of Sciences, Sofia, Bulgaria;CLBME, Bulgarian Academy of Science, Sofia, Bulgaria
Venue:
NMA'10 Proceedings of the 7th international conference on Numerical methods and applications
Year:
2010

Citing 5
Cited 0

Swarm intelligence: from natural to artificial systems

Swarm intelligence: from natural to artificial systems
MAX-MIN Ant system

Future Generation Computer Systems
Ant Colony Optimization

Ant Colony Optimization
ACO-VRPTWRV: A New Algorithm for the Vehicle Routing Problems with Time Windows and Re-used Vehicles based on Ant Colony Optimization

ISDA '06 Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications - Volume 01
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ant Colony Optimization (ACO) has been used successfully to solve hard combinatorial optimization problems. This metaheuristic method is inspired by the foraging behavior of ant colonies, which manage to establish the shortest routes to feeding sources and back. On this work we use estimation of start nodes with respect to the quality of the solution. Various start strategies are offered. Sensitivity analysis of the algorithm behavior according strategy parameters is made. Our ideas is applied on Multiple Knapsack Problem (MKP) like a representative of the subset problems.