期刊文献+

蚁群算法在连续空间寻优问题求解中的应用 被引量:100

Ant system algorithm in continuous space optimization
在线阅读 下载PDF
导出
摘要 将蚁群算法引入连续空间的函数寻优问题求解 ,通过将传统蚁群算法中的“信息量留存”过程拓展为连续空间中的“信息量分布函数”,定义了相应的求解算法。对多极值函数和非线性连续函数的寻优实例仿真取得了良好的结果 ,显示了蚁群算法在连续空间优化问题中的应用前景。 The aim is to introduce the traditional ant system (AS) algorithm which is fit in combined optimization problem into optimization problem in continuous space. By expanding the trail remaining process in traditional AS into trail distribution function in continuous space, an extended AS algorithm is proposed. Simulation results of the global optimum value searching of multi-minimum continuous function and nonlinear continuous function demonstrate the effectiveness and the applicability of the algorithm.
作者 汪镭 吴启迪
出处 《控制与决策》 EI CSCD 北大核心 2003年第1期45-48,57,共5页 Control and Decision
基金 国家自然科学基金资助项目 (79970 0 30 6 0 10 40 0 4 70 2 710 35 ) 国家高性能计算基金资助项目 (995 2 0)
关键词 蚁群算法 连续空间寻优问题 信息量分布函数 组合优化问题 NP问题 Algorithms Nonlinear programming Scheduling Simulation
  • 相关文献

参考文献11

  • 1[1]Dorigo M, Gambardella L M. Ant colony system: A cooperative learning approach to the travelling salesman problem[J]. IEEE Trans Evol Comp,1997,1(1):53-66.
  • 2[2]Dorigo M, Maniezzo V, Colorni A. Ant system: Optimization by a colony of cooperating agents[J]. IEEE Trans SMC: Part B,1996,26(1):29-41.
  • 3[3]Gambardella L M, Dorigo M. Solving symmetric and asymmetric TSPs by ant colonies[A]. Proc IEEE Int Conf Evol Comp[C]. Piscataway, 1996.622-627.
  • 4[4]Boryczka U, Boryczka M. Generative policies in ant systems for scheduling[A]. 6th European Congr Intell Tech Soft Comp[C]. Bruxelles,1998.1:382-386.
  • 5[5]Boryczka U. Learning with delayed rewards in ant sys-tems for the job-shop scheduling problem[A]. First Int Conf Rough Sets Current Trends Comp[C]. Bruxelles,1998.271-274.
  • 6[6]Gambardella L M, Taillard E D, Dorigo M. Ant colonies for the quadratic assignment problem[J]. J Oper Res Soci,1999,50(2):167-176.
  • 7[7]Maniezzo V,Dorigo M,Colorni A.Algodesk:An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem[J]. European J Oper Res,1995,81(1):188-204.
  • 8[8]Maniezzo V. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem[J]. Infor J Comp,1999,11(4):358-369.
  • 9[9]Maniezzo V, Colorni A. Ant system applied to the quadratic assignment problem[J]. IEEE Trans Knowl Data Eng,1999,11(5):769-778.
  • 10[10]Leguizamon G, Michalewicz Z. A new version of ant system for subset problems[A]. Proc Congr Evol Comp[C]. Darmstadt,1999.2:1459-1464.

同被引文献721

引证文献100

二级引证文献594

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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