An ACO algorithm for the shortest common supersequence problem
New ideas in optimization
Journal of Heuristics
Optimal node placement in an optical packet switching Manhattan street network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Ant Colony Optimization
A new hybrid heuristic approach for solving large traveling salesman problem
Information Sciences—Informatics and Computer Science: An International Journal
Exchange strategies for multiple Ant Colony System
Information Sciences: an International Journal
Systems and Computers in Japan
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
International Journal of Hybrid Intelligent Systems
| Hi-index | 0.00 |
In this paper we propose an ant colony optimization variant where several independent colonies try to simultaneously solve the same problem. The approach includes a migration mechanism that ensures the exchange of information between colonies and a mutation operator that aims to adjust the parameter settings during the optimization. The proposed method was applied to several benchmark instances of the node placement problem. The results obtained shown that the multi-colony approach is more effective than the single-colony. A detailed analysis of the algorithm behavior also reveals that it is able to delay the premature convergence.