期刊文献+

蚁群算法理论及应用研究的进展 被引量:210

Development on ant colony algorithm theory and its application
下载PDF
导出
摘要 蚁群算法是优化领域中新出现的一种仿生进化算法.该算法采用分布式并行计算机制,易与其他方法结合,具有较强的鲁棒性;但搜索时间长、易限入局部最优解是其突出的缺点.针对蚁群算法,首先介绍其基本原理;然后讨论了近年来对蚁群算法的若干改进以及在许多新领域中的发展应用;最后评述了蚁群算法未来的研究方向和主要研究内容. Ant colony algorithm is a novel category of bionic algorithm for optimization problems. Parallel computation mechanism is adopted in this algorithm. Ant colony algorithm has strong robustness and is easy to combine with other methods in optimization, but it has the limitation of stagnation, and is easy to fall into local optimums. Firstly, the basic principle of ant colony algorithm is introduced. Then, a series of schemes on improving the ant colony algorithm are discussed, and the new applications are also provided. Finally, some remarks on the further research and directions are presented.
出处 《控制与决策》 EI CSCD 北大核心 2004年第12期1321-1326,1340,共7页 Control and Decision
基金 国家航空科学基金资助项目(01C52015) 江苏省"333"工程基金资助项目.
关键词 蚁群算法 信息素 智能计算 优化 Heuristic methods Motion planning Optimization Parallel algorithms Quality of service Strategic planning
  • 相关文献

参考文献3

二级参考文献23

  • 1 SALAMA H F, REEVWS D S, VINIOTIS Y. Evaluation of multicastrouting algorithm for real-time communication on high-speed networks [J]. IEEE Journalon Selected Areas in Communication,1997,15(3):332-345.
  • 2 BERTSEKAS D, GALLAGER R G. Data networks (2nd ed) [M]. EnglewoodCliffs,NJ:Prentice-Hall,1992.
  • 3 HWANG F K,RICHARDS D S.Steiner tree problems [J].IEEENetworks,1992,22(1):55-89.
  • 4 GELENBE E, GHANWANI A, SRINIVASON V. Improved neural heuristics for multicastrouting [J].IEEE Journal on Selected Areas in Communication,1997,15(2):147-155.
  • 5 KOU L,MARKOWSKY G,BERMAN L. A fast algorithm for Steiner trees [J].ActaInformation,1981,15:141-145.
  • 6 ZHU Q,PARSA M,GACIA-LUNA-ACEVES J J. A source-based algorithm fordelay-constrained minimum-cost multicasting [A]. In: Proc IEEE INFOCOM [C].1995.377-385.
  • 7 KOMPELLA V P,PASQUALE J C,POLYZOS G C.Multicasting for multimedia applications[A]. In:Proc. IEEE INFOCOM[C].1992.2078-2085.
  • 8 ROUSKAS G N,BALDINE I. Multicast routing with end-to-end delay and delayvariation constraints [J].IEEE Journal on Selected Areas inCommunication,1997,15(3):346-356.
  • 9 DORIGO M,GAMBARDELLA L M. Ant colony system: a cooperative learning approach tothe traveling salesman problem [J].IEEE Trans EvolutionaryComputation,1997,1(1):53-65.
  • 10 STUTZLE T, HOOS H. Max-min ant system and local for the traveling salesmanproblem [A]. Proceeding of 1997 IEEE International Conference on EvolutionaryComputation(ICEC97) [C].1997.309-314. Received date: 2000-05-19

共引文献20

同被引文献2082

引证文献210

二级引证文献1463

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部