摘要
蚁群算法是一种新型的模拟进化算法,具有很好的通用性和鲁棒性,在解决组合优化问题方面有良好效果,但存在如计算时间较长、容易陷入局部最优等问题。本文在蚁群算法的基础上,引入了杂交及变异机制,提出了一种具有新型变异特征的蚁群新算法,在减少计算时间的同时可避免早熟现象。
Ant colony algorithm is a novel simulated evolutionary algorithm,which has good result on solving combinatorial problems such as TSPs. The research shows that this algorithm can be commonly used and offer very good robustness., But it also has some shortcomings such as needing longer computing time, and it is easy to fall in local best. To solve this problem, a new ant colony algorithm, an ant colony algorithm with new genetic features, is proposed in the paper here. Because of the introduction of Crossover and Mutation Operator, it can decrease computing time, at the same time, it can avoid early maturing phenomenon.
出处
《微计算机信息》
北大核心
2006年第02Z期261-263,共3页
Control & Automation
基金
河南省科技厅重大科技项目项目编号:0222020600
关键词
蚁群算法
横拟进化算法
旅行商问题
遗传算法
Ant colony algorithm
Simulated evolutionary aigorithm
TSP
Genetic algorithm
