文章基本信息

标题：RESEARCH OF COMBINATORIAL OPTIMIZATION PROBLEM BASED ON GENETIC ANT COLONY ALGORITHM
本地全文：下载
作者：ZEYU SUN ; ZHENPING LI
期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2013
卷号：47
期号：3
出版社：Journal of Theoretical and Applied
摘要：Ant colony algorithm of the traditional combinative optimization consumes a large amount of time in the process of solving the optimization, which has a tendency to partial optimization and slow convergence along with many redundant useless iterative codes and low operation efficiency. A generic optimized ant colony algorithm is thus proposed. This algorithm has the ability to fast global search of generic algorithm along with parallelism and positive feedback mechanism of ant algorithm. It determines the distribution of pheromone on the path by means of generic algorithm changing selection operators, crossover operators and mutation operators. Then ant algorithm is applied into feature selection. Supporting vector machine classifiers is used to evaluate the performance of the feedback sub-variorum. The pheromones are recombined through changing the pheromone iteration, parameter selection and increasing the local update of pheromones feature nodes. The simulation experiment shows that this algorithm can improve the accuracy effectively, speed up the convergence, improve global optimization, and promote the robustness and stability.
关键词：Ant Colony Algorithm; Combinatorial Optimization; Traveling Salesman Problem; Pheromones; Genetic Algorithm