蚂蚁算法在组合优化中的应用 |
| |
引用本文: | 马良, 项培军,. 蚂蚁算法在组合优化中的应用[J]. 管理科学, 2001, 4(2): 32-37 |
| |
作者姓名: | 马良 项培军 |
| |
作者单位: | 上海理工大学管理学院,上海 200093 |
| |
基金项目: | 上海市高校青年科学基金资助项目(98QN28) |
| |
摘 要: | 蚂蚁算法是近年来新出现的一种随机型搜索寻优算法 ,自从在 TSP等著名问题中得到富有成效的应用之后 ,已引起越来越多的关注和重视 .本文进一步将这种新型的生物优化思想扩展到其他一些组合优化难题 ,包括目前尚缺乏有效求解手段的多目标组合优化问题 ,从实验上探索了蚂蚁算法的优化能力 ,获得了满意的效果
|
关 键 词: | 组合优化 蚂蚁 算法 |
文章编号: | 1007-9807(2001)02-0032-06 |
修稿时间: | 1999-12-21 |
Applications of the ant algorithm to combinatorial optimization |
| |
Abstract: | Ant algorithm is a newly emerged stochastic searchingoptimization algorithm in recent years. It has been paid much attention to since the successful application in the famous travelling salesman problem. This paper further extends the idea of this new biological optimization strategy to some other hard combinatorial optimization problems, including the multi-attribute situation which lack of efficient solving methods. The ability of optimization for the algorithm is tested experimentally which give encouraging results. |
| |
Keywords: | combinatorial optimization ant algorithm |
本文献已被 万方数据 等数据库收录! |
| 点击此处可从《管理科学》浏览原始摘要信息 |
|
点击此处可从《管理科学》下载免费的PDF全文 |
|