A Novel ACO with Average Entropy

  • LI Y
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

LI, Y. (2009). A Novel ACO with Average Entropy. Journal of Software Engineering and Applications, 02(05), 370–374. https://doi.org/10.4236/jsea.2009.25049

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free