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

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

Authors

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

DOI:

https://doi.org/10.15625/1813-9663/27/3/490

Abstract

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.

Metrics

Metrics Loading ...

Published

26-04-2012

How to Cite

[1]
Đỗ Đức Đông and H. X. Huấn, “On the behavior of pheromone trial in ACO method and novel algorithms”, JCC, vol. 27, no. 3, pp. 263–274, Apr. 2012.

Issue

Section

Computer Science