| 混合蚁群优化在粮食紧急调运问题中的应用 |
| |
| 引用本文： | 张秋闻,甄彤,马志.混合蚁群优化在粮食紧急调运问题中的应用[J].计算机工程与应用,2009,45(15):219-222. |
| |
| 作者姓名： | 张秋闻 甄彤 马志 |
| |
| 作者单位： | 河南工业大学 信息科学与工程学院，郑州 450001 |
| |
| 基金项目： | 国家科技支撑计划重点项目，河南省高等学校新世纪优秀人才支持计划 |
| |
| 摘 要： | 粮食紧急调运问题的数学模型和手工算法过去已有研究，但是当问题较为复杂时，手工算法就要花费大量时间而且准确性也难以保证。针对这一缺陷，提出一种搜索效率较高的混合蚁群算法，阐述了混合蚁群算法的基本原理，给出了求解粮食紧急调运问题的具体步骤。计算机实验结果表明，混合蚁群算法在求解粮食紧急调运问题上是有效的。
|
| 关 键 词： | 粮食紧急调运 蚁群算法 动态扫描 优化 |
| 收稿时间： | 2008-3-26 |
| 修稿时间： | 2008-6-24
|
Hybrid ant colonies algorithm for grain urgency transportation |
| |
| ZHANG Qiu-wen,ZHEN Tong,MA Zhi.Hybrid ant colonies algorithm for grain urgency transportation[J].Computer Engineering and Applications,2009,45(15):219-222. |
| |
| Authors: | ZHANG Qiu-wen ZHEN Tong MA Zhi |
| |
| Affiliation: | College of Information Science and Engineering，Henan University of Technology，Zhengzhou 450001，China |
| |
| Abstract: | Models and handwork algorithms of the grain urgency transportation have been studied before，but when the problems become complex，it will take lots of time to get the answer if you work them out by hand，and you can’t ensure the answer is right.Aiming at this limitation，a hybrid ant colony system of high search efficiency is put forward，the basic principle is summarized and the steps for solving grain urgency transportation problem are described as well.The result shows that hybrid ant colony system is effective for solving grain urgency transportation problem. |
| |
| Keywords: | grain urgency transportation ant colony algorithm dynamic sweep optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
