期刊文献+

基于均匀设计的蚁群算法参数设定 被引量:42

Parameter Establishment of an Ant System Based on Uniform Design
下载PDF
导出
摘要 蚁群算法的参数设置一直是依靠经验和试验来确定,造成试验工作量大且难以得到最优的参数组合,影响了算法的使用.通过将蚁群算法基本模型的参数设定问题描述成均匀设计中多因素多水平的试验设计,从而能够用较少的试验很快设定算法参数的取值.TSP问题的仿真试验表明,利用均匀设计得到的参数组合可使蚁群算法获得较优的运行性能,说明了该方法的可行性和有效性. The enactment of the parameters of an ant system is determined by experience and experiment. This leads to heavy work load and makes the optimal combination of the parameters difficult to obtain. Uniform design method is used to convert the problem of parameter establishment into the experimental design of multi-factor and multi-level and reduces the work load of experiment greatly of simulation. The method applied to the traveling salesman problem shows good performance feasibility and effectiveness.
出处 《控制与决策》 EI CSCD 北大核心 2006年第1期93-96,共4页 Control and Decision
基金 国家自然科学基金项目(70171033 70471046) 安徽省基金项目(01041176 AHSK03-04D44)
关键词 蚁群算法 均匀设计 旅行商问题 Ant system Uniform design Traveling salesman problem
  • 相关文献

参考文献6

二级参考文献44

  • 1王颖,谢剑英.一种自适应蚁群算法及其仿真研究[J].系统仿真学报,2002,14(1):31-33. 被引量:232
  • 2关中玉,宋桂菊.PID参数的均匀设计[J].自动化仪表,1993,14(4):13-16. 被引量:4
  • 3Barto A G, Sutton R S, Brower P S, Associative search network: A reinforcement learning associative memory[ J ]. Biological Cybem,1981,40(2): 201-211.
  • 4Coloni A, Dorigo M, Maniezzo V, Ant system: Optimization by a colony of cooperating agent[J].IEEE Trans on Systems,Man and Cybemetics-Part B:Cybemetcs.1996,26(1):29-41
  • 5Dorigo M,Gambardella L M. Ant colony system: A cooperative learning approach to the tavelling salesman Problem[J].IEEE Trans on Evolutionary Computation.1996,1(1):53-66
  • 6Stuitzle T, Hoos H H. MAX- MIN ant system[J]. Future Generation Computer Systems, 2000, 16: 889-914.
  • 7Sttitzle T, Dorigo M. ACO algorithms for the quadratic assignment problem[ A]. In Corne D, Dorigo M, Glover F, eds., New Methods in Optimization[ M]. New York: McGraw-Hill, 1999.
  • 8Maniezzo V, Colorni A. The ant system applied to the quadratic assignment problem[ J]. IEEE Transactions on Knowledge and Data Engineering, 1999, 11(5): 769-778.
  • 9Gilmore P. Optimal and suboptimal algorithms for the quadratic assignment problem[J]. Journal of SIAM, 1962, 10: 305-313.
  • 10Taillard D. Robust taboo search for the quadratic assignment problem[J]. Parallel Computing, 1991, 17:443 - 455.

共引文献281

同被引文献352

引证文献42

二级引证文献182

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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