期刊文献+

函数优化的元胞蚂蚁算法 被引量:18

Cellular ant algorithm for function optimization
下载PDF
导出
摘要 蚂蚁算法是一种源于大自然中生物世界的新的仿生类算法,已在一系列困难的组合优化问题求解中取得了成效;元胞自动机作为一种离散的动态模型在大规模的仿真计算能力方面为研究系统的行为提供了有效的虚拟实验室.基于蚂蚁算法和元胞自动机的原理,提出了一种元胞蚂蚁算法及其数学描述,可用于求解连续系统的优化问题.算法在MATLAB环境下实现,并对一些难题实例进行了验证和测试,获得了较好的效果. Ant algorithm is a new bionic algorithm which sources from the biological world in nature. The algorithm has successfully solved series of difficult problem of different discrete systems optimization problems. Cellular automata is a discrete and dynamic model that has provided effective virtual laboratory in the field of large-scale simulation computation for studying the behavior of systems. Based on the idea of ant algorithm and the principle of cellular automata, this paper gives a cellular ant algorithm and its mathematical description that can be used for solving the optimization problem of continuous systems. The algorithm is coded in MATLAB, and is tested through series of typical problem instances that give promising results.
作者 朱刚 马良
出处 《系统工程学报》 CSCD 北大核心 2007年第3期305-308,共4页 Journal of Systems Engineering
基金 国家自然科学基金资助项目(70471065) 上海市重点学科建设资助项目(T0502)
关键词 蚂蚁算法 元胞自动机 函数优化 ant algorithm cellular automata function optimization
  • 相关文献

参考文献14

二级参考文献36

  • 1郝柏林.从抛物线谈起-混沌动力学引论[M].上海科技教育出版社,1995.1-20. 被引量:6
  • 2马良.中国144城市TSP的蚂蚁搜索算法[J].计算机应用研究,2000,17(1):36-37. 被引量:6
  • 3马振华 刘坤林 等.运筹学与最优化理论卷[M].北京:清华大学出版社,1998.254-278. 被引量:6
  • 4潘威海 马良.蚂蚁算法在城市高密度光纤辅设优化中的应用.2001中国控制与决策学术年会论文集[M].沈阳:东北大学出版社,2001.404-408. 被引量:1
  • 5杨若黎,顾基发.一种高效的模拟退火全局优化算法[J].系统工程理论与实践,1997,17(5):29-35. 被引量:101
  • 6Dorigo M, Maniezzo V, Colorni A. The ant system:Optimization by a colony of cooperating agents [J].IEEE Trans on SMC, 1996,26(1):28-41. 被引量:1
  • 7Dorigo M, Gambardella L M. Ant colony system.. A cooperative learning approach to the traveling salesman problem[J]. IEEE Trans on Evolutionary Computing,1997,1 (1) : 53-56. 被引量:1
  • 8Colorni A, Dorigo M, Maniezzo V. Ant colony system for job-shop scheduling [J]. Belgian J of Operations Research Statistics and Computer Science, 1994,34 (1):39-53. 被引量:1
  • 9Maniezzo V. Exact and approximate nondeterministic tree search procedures for the quadratic assignment problem[J]. Informs J of Computer, 1999, (11) :358-369. 被引量:1
  • 10Bilchev G, Parmee I C. The ant colony metaphor for searching continuous design spaces[J]. Lecture Notesin Computer Science, 1995, 993:25-39. 被引量:1

共引文献444

同被引文献139

引证文献18

二级引证文献92

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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