Blum, A. Roli and M. Dorigo, “HC-ACO: The hy-per-cube framework for ant colony optimization,” in Pro-ceedings of MIC 2001-meta-heuristics International Con-ference, Porto, Portugal, Vol. 2, pp. 399–403, 2001.

has been cited by the following article:

• TITLE: A Novel ACO with Average Entropy

  AUTHORS: Yancang LI

  KEYWORDS: ACO, Modification, Average Entropy, TSP

  JOURNAL NAME: Journal of Software Engineering and Applications, Vol.2 No.5, December 28, 2009

  ABSTRACT: In order to solve the premature convergence problem of the basic Ant Colony Optimization algorithm, a promising modification with changing index was proposed. The main idea of the modification is to measure the uncertainty of the path selection and evolution by using the average information entropy self-adaptively. Simulation study and perform-ance comparison on Traveling Salesman Problem show that the improved algorithm can converge at the global opti-mum with a high probability. The work provides a new approach for solving the combinatorial optimization problems, especially the NP-hard combinatorial optimization problems.