The Dynamic Ant Colony Optimization Based on Permutation and its Application

Abstract:

Article Preview

To overcome the disadvantages of getting into local optimum of the Ant Colony Optimization, this paper proposes a dynamic adaptive ant algorithm based on permutation. To avoid algorithms getting into stagnation in their anaphase, the lower bound of pheromones is set as a nonzero constant. According to the quality of the solutions ants get in the ant colony, the best part of the ants is selected to release pheromones in a defined amount in terms of the quality of the solutions so as to enhance ants’ capability of searching for optimum solutions in anaphase. The algorithm adopts a more intelligent selection rule of behavior , so the ants can adjust the balance coefficient between exploration and development dynamically in the searching process to effectively inhibit precocity phenomenon in the process of convergence,and improve the searching capability of the algorithm.

Info:

Periodical:

Advanced Materials Research (Volumes 179-180)

Edited by:

Garry Zhu

Pages:

818-823

DOI:

10.4028/www.scientific.net/AMR.179-180.818

Citation:

X. W. Luo "The Dynamic Ant Colony Optimization Based on Permutation and its Application", Advanced Materials Research, Vols. 179-180, pp. 818-823, 2011

Online since:

January 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.