On the behavior of pheromone trial in ACO method and novel algorithms

Đỗ Đức Đông, Hoàng Xuân Huấn


Ant colony optimization (ACO) is a kind of randomized search heuristic method for solving NP-hard problems of combinatorial optimization. Experiment results have shown that these algorithms outperform other nature-inspired algorithms such that simulated annealing, genetic algorithm ect... This paper presents mathematical analysis on behavior of pheromone trail in two most popular ACO algorithms: ACS (Ant Colony System) and MMAS (Max-Min Ant System), then, suggest new ideas for improving pheromone update rules.

DOI: https://doi.org/10.15625/1813-9663/27/3/490 Display counter: Abstract : 54 views. PDF : 48 views. PDF (Tiếng Việt) : 17 views.

Journal of Computer Science and Cybernetics ISSN: 1813-9663

Published by Vietnam Academy of Science and Technology