| 无容量限制设施选址问题的分支定界法 |
| |
| 引用本文： | 李翼,赵茂先,李岳佳.无容量限制设施选址问题的分支定界法[J].山东理工大学学报,2012(1):70-73. |
| |
| 作者姓名： | 李翼 赵茂先 李岳佳 |
| |
| 作者单位： | 山东科技大学信息科学与工程学院 |
| |
| 基金项目： | 山东省自然科学基金资助项目(Y2008A01) |
| |
| 摘 要： | 设施选址问题是经典的优化问题.一个好的选址方法可以有效节省费用,促进生产和消费的协调与配合,使得设施系统平衡发展.企业的优势和公共设施的盈利能力同样依赖于设施的选址结果.介绍了无容量限制的设施选址问题,给出了该问题的数学模型,提出了解决此问题的一个精确算法———分支定界法,最后通过一个算例说明了算法的有效性.
|
| 关 键 词： | 设施选址问题 无容量限制 分支定界法 |
Branch and bound algorithm for the uncapacitated facility location problem |
| |
| LI Yi,ZHAO Mao-xian,LI Yue-jia.Branch and bound algorithm for the uncapacitated facility location problem[J].Journal of Shandong University of Technology:Science and Technology,2012(1):70-73. |
| |
| Authors: | LI Yi ZHAO Mao-xian LI Yue-jia |
| |
| Institution: | (College of Information Science and Engineering,Shandong University of Science and Technology,Qingdao 266590,China) |
| |
| Abstract: | Facility location problems are classical optimization problems.A good location method can save money efficiently,promote the coordination of production and consumption and obtain the balanced development of facility system.The competitive advantage of firms and the profitability of public facilities depend on the results of these locations.In this paper,uncapacitated facility location problem is introduced.We give a branch and bound method,which is an exact algorithm to solve this problem.Numerical examples illustrate this approach. |
| |
| Keywords: | facility location problem uncapacitated branch and bound |
| 本文献已被 CNKI 等数据库收录！ |
|
