| 容量受限工厂选址问题模型及贪婪蚁群算法求解 |
| |
| 引用本文： | 于宏涛,高立群.容量受限工厂选址问题模型及贪婪蚁群算法求解[J].东北大学学报(自然科学版),2011,32(12):1688-1691. |
| |
| 作者姓名： | 于宏涛 高立群 |
| |
| 作者单位： | 东北大学信息科学与工程学院; |
| |
| 基金项目： | 国家自然科学基金资助项目(60674021) |
| |
| 摘 要： | 研究了在容量受限条件下的工厂选址问题.针对现有模型对覆盖问题、经济效益问题和发展状况问题考虑不足,提出了一种新的数学模型.由于容量受限的工厂选址是一个复杂的决策过程,较难得到满意解和最优解,提出一种新的改进蚁群算法对其进行求解.改进蚁群算法在传统蚁群算法的基础上结合了贪婪算法.仿真结果一方面说明了新的数学模型的有效性,另一方面证明了改进蚁群算法改善了传统蚁群算法易于陷入局部最优解的缺点,提高了寻优质量.
|
| 关 键 词： | 蚁群算法 贪婪算法 容量受限 工厂选址 背包问题 |
Model and Solution Based on Greedy Ant Colony Algorithm for Capacitated Facility Location Problem |
| |
| YU Hong-tao,GAO Li-qun.Model and Solution Based on Greedy Ant Colony Algorithm for Capacitated Facility Location Problem[J].Journal of Northeastern University(Natural Science),2011,32(12):1688-1691. |
| |
| Authors: | YU Hong-tao GAO Li-qun |
| |
| Institution: | YU Hong-tao,GAO Li-qun(School of Information Science & Engineering,Northeastern University,Shenyang 110819,China.) |
| |
| Abstract: | Capacitated facility location problem is investigated.A new mathematical model is put forward to improve the existing models that do not well address the economic benefit problem and development problem.Since capacitated facility location is a complicated decision process and thus it is often difficult to get an optimal and satisfactory solution,the model is solved by using a new improved ant colony algorithm,which combines conventional ant colony algorithm and greedy idea.Simulation results not only valida... |
| |
| Keywords: | ant colony algorithm greedy algorithm capacitated facility location knapsack problem |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《东北大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《东北大学学报(自然科学版)》下载免费的PDF全文 |
