首页 | 本学科首页   官方微博 | 高级检索  
     

蚁群优化算法及其应用
引用本文:胡小兵,黄席樾.蚁群优化算法及其应用[J].计算机仿真,2004,21(5):81-85.
作者姓名:胡小兵  黄席樾
作者单位:1. 重庆大学自动化学院,重庆,400044;重庆大学数理学院,重庆,400044
2. 重庆大学自动化学院,重庆,400044
摘    要:蚂蚁算法是由意大利学者M.Dorigo等人提出的一种新型的模拟进化算法。该算法首先应用于旅行商问题并获得了极大的成功,其后,又被用于求解指派问题、Job—shop调度问题、图着色问题和网络路由问题等。实践证明,蚂蚁算法是一种鲁棒性强、收敛性好、实用性广的优化算法,但同时也存在一些不足,如收敛速度慢和容易出现停滞现象等。

关 键 词:蚁群优化  组合优化  随机搜索  启发式算法
文章编号:1006-9348(2004)05-0081-05
修稿时间:2003年3月28日

Ant Colony Optimization Algorithm and Its Application
HU Xiao-bing,HUANG Xi-yue.Ant Colony Optimization Algorithm and Its Application[J].Computer Simulation,2004,21(5):81-85.
Authors:HU Xiao-bing    HUANG Xi-yue
Affiliation:HU Xiao-bing~1,2,HUANG Xi-yue~1
Abstract:Ant Algorithm is a novel simulated evolutionary algorithm which was proposed first by M.Dorigo and had been applied to Traveling Salesman Problems (TSP) with great success. Later, the algorithm has been applied to other combinatorial optimization problems such as Quadratic Assignment Problem (QAP), Vehicle Routing Problem (VRP), Graph Coloring Problem (GCP) and Network Routing Problem (NRP) etc.. It has been proved that Ant Algorithm has the characteristics of strong robustness, good convergence and versatility but at the same time has some shortcomings such as needing longer computing time and easy to enter stagnation.
Keywords:Ant colony optimization(ACO)  Combinatorial optimization  Stochastic search  Meta-heuristic algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号