首页 | 官方网站   微博 | 高级检索  
     

三种现代优化算法的比较研究
引用本文:沈斌,江维,胡中功.三种现代优化算法的比较研究[J].自动化与仪器仪表,2009(3):111-113.
作者姓名:沈斌  江维  胡中功
作者单位:武汉工程大学电气信息学院,湖北武汉,430073
摘    要:现代最优化算法比较常见的有遗传算法、蚁群算法、微粒群算法、人工鱼群算法等。本文主要对前三种算法优化性能进行比较研究。首先介绍了三种算法的基本原理,然后总结了各自的优缺点并从原理和参数两个方面对三种算法进行了对比分析,最后以经典TSP问题为例进行了仿真研究并得出了一些指导算法适用范围的结论。

关 键 词:遗传算法  蚁群算法  微粒群算法  比较研究

A comparative study of three modem optimization algorthms
SHEN Bin,JIANG Wei,HU Zhong-gong.A comparative study of three modem optimization algorthms[J].Automation & Instrumentation,2009(3):111-113.
Authors:SHEN Bin  JIANG Wei  HU Zhong-gong
Abstract:The common modem optimization algorithm include genetic algotithm(GA), ant colony algotithn(ACO), particle swarm algorithm optinization(PSO), artificial fish-swarm algodthtm(AF)and so on. This article mainly make a comparative study of the optimization performance of GA. ACO and PSO. First introduced the basic principles of the three algorithms, then summarized the advantages and disadvantages respectively, made a comparative analysis of the three algorithms from principles and parameters two aspects, At last simulated with the classic TSP as an example and obtain some meaningful conclusions which guide the application scope of the algorithms.
Keywords:Genefic algorithm (GA)  Ant colony algorithm(ACO)  Particle swarm algorithm optimization(PSO)  Comparative study
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号