改进遗传蚁群算法求解优化问题的设计与实现  

Design and Realization of Improved Genetic Ant Colony Algorithm Solving Optimization Problems

作　　者：丁国强[1] 孙泽宇[1] 李传锋[1] 

机构地区：[1]洛阳理工学院计算机与信息工程系,河南洛阳471023

出　　处：《计算机测量与控制》2011年第10期2558-2561,共4页Computer Measurement &Control

基　　金：国家自然科学基金资助项目(60975058);河南省教育厅自然科学基金项目(2010510016;2011590001)

摘　　要：传统的组合优化蚁群算法在求解优化过程中要消耗大量的时间,极易陷入局部最优解和收敛速度过慢等弊端,同时还会产生大量无用的冗余迭代码,运算效率低;因此,提出一种遗传蚁群优化算法;该算法具备了遗传算法快速搜索全局能力的同时也具备了蚁群算法并行性和正反馈机制;利用遗传算法改变选择算子、交叉算子和变异算子操作来确定路径上信息素的分布,将蚁群算法用于特征选择,采用支持向量机分类器分类性能反馈用于评价特征子集解,并通过对改变信息素的迭代、参数选择和增加对信息素局部更新方式指导特征结点重新组合;仿真实验表明,该算法可以有效提高计算精度,加快收敛速度,优化全局最优解的同时增强了系统的鲁棒性和稳定性。The combination of traditional ant colony algorithm in solving the optimization process to consume a large amount of time, easily falling into local optimal solution and convergence is slow and other disadvantages, while also generating a lot of useless redundant iterative code, operation efficiency is low. Therefore, ant colony optimization algorithm is proposed. The algorithm based on genetic algorithm has the ability to search the global ant colony algorithm also has a parallel and positive feedback mechanisms. Changes in the use of genetic algorithm selection operator, crossover operator and mutation operator action to determine the distribution of pheromone on the path, the ant colony algorithm for feature selection using support vector machine classifiers for evaluating the performance characteristics of the feedback sub-Variorum And by changing the pheromone iteration, parameter selection and increase the local pheromone update feature nodes guided the re-combination. Simulation results show that the algorithm can effectively improve the accuracy, speed up the convergence, global optimization while enhancing the robustness and stability.

关 键 词：蚁群算法 支持向量机 特征权值 优化 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]