东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2011, Vol. 32 ›› Issue (12): 1688-1691.DOI: -

• 论著 • 上一篇    下一篇

容量受限工厂选址问题模型及贪婪蚁群算法求解

于宏涛;高立群;   

  1. 东北大学信息科学与工程学院;
  • 收稿日期:2013-06-19 修回日期:2013-06-19 发布日期:2013-04-04
  • 通讯作者: -
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(60674021)

Model and solution based on greedy ant colony algorithm for capacitated facility location problem

Yu, Hong-Tao (1); Gao, Li-Qun (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110819, China
  • Received:2013-06-19 Revised:2013-06-19 Published:2013-04-04
  • Contact: Yu, H.-T.
  • About author:-
  • Supported by:
    -

RichHTML

1

PDF (PC)

2157

摘要： 研究了在容量受限条件下的工厂选址问题.针对现有模型对覆盖问题、经济效益问题和发展状况问题考虑不足,提出了一种新的数学模型.由于容量受限的工厂选址是一个复杂的决策过程,较难得到满意解和最优解,提出一种新的改进蚁群算法对其进行求解.改进蚁群算法在传统蚁群算法的基础上结合了贪婪算法.仿真结果一方面说明了新的数学模型的有效性,另一方面证明了改进蚁群算法改善了传统蚁群算法易于陷入局部最优解的缺点,提高了寻优质量.

关键词: 蚁群算法, 贪婪算法, 容量受限, 工厂选址, 背包问题

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 validate the new model, but also show that the improved ant colony algorithm can enhance the ability of escaping from local optimal solution.

中图分类号: