| 约束平面选址问题的蚂蚁算法 |
| |
| 引用本文： | 邱模杰,马良.约束平面选址问题的蚂蚁算法[J].上海理工大学学报,2000,22(3):217-220. |
| |
| 作者姓名： | 邱模杰 马良 |
| |
| 作者单位： | 上海理工大学,管理学院,上海,200093 |
| |
| 基金项目： | 上海市高校青年科学基金资助项目(98QN28) |
| |
| 摘 要： | 对带有区域限制的平面选址问题，给出一种基于人工蚂蚁优化思想的新的求解方法。经数值计算、验证和比较，得到了满意的效果。
|
| 关 键 词： | 约束 蚂蚁算法 平面造址问题 |
| 文章编号： | 1007-6735(2000)03-0217-04 |
| 修稿时间： | 2000年4月3日 |
Ant algorithm for constrained location problem |
| |
| QIU Mo-jie,MA Liang.Ant algorithm for constrained location problem[J].Journal of University of Shanghai For Science and Technology,2000,22(3):217-220. |
| |
| Authors: | QIU Mo-jie MA Liang |
| |
| Abstract: | Location problem is typical in operations research, which has wide applications in real life. Based on the recently developed ant colony optimization strategy, a new algorithm for solving planar location problem with regional constraints is proposed in the paper. By modifying the transition probability and some relevant parameters, the algorithm extends the ant-based ideas used in combinatorial optimization to continuous function optimization. Numerical examples are tested and compared which give effective and encouraging results. |
| |
| Keywords: | constrained location problem ant algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《上海理工大学学报》浏览原始摘要信息 |
|
点击此处可从《上海理工大学学报》下载全文 |
|
