| 战时维修力量最大覆盖选址问题 |
| |
| 引用本文： | 李明,曲长征,张波,高飞. 战时维修力量最大覆盖选址问题[J]. 物流科技, 2010, 33(6): 58-60 |
| |
| 作者姓名： | 李明 曲长征 张波 高飞 |
| |
| 作者单位： | 军械工程学院,河北,石家庄050003 |
| |
| 摘 要： | 以战时维修力量配置为背景,扩展了传统的最大覆盖选址模型的应用范围,对优先度函数进行了定义,并建立了基于需求点优先度的最大覆盖选址模型,运用拉格朗日松弛算法对模型进行了求解。
|
| 关 键 词： | 维修力量 优先度 最大覆盖选址 |
The Maximal Covering Location Problem of Maintenance Force in War |
| |
| LI Ming,QU Chang-zheng,ZHANG Bo,GAO Fei. The Maximal Covering Location Problem of Maintenance Force in War[J]. Logistics Management, 2010, 33(6): 58-60 |
| |
| Authors: | LI Ming QU Chang-zheng ZHANG Bo GAO Fei |
| |
| Affiliation: | (Ordnance Engineering College,Shijiazhuang 050003,China) |
| |
| Abstract: | This paper extends the application of the maximal covering location problem under the allocation of maintenance force in war.As the priority function being defined,a maximal covering location model based on the priority of requirement nodes is set up.A lagrangean relaxation algorithm is used to solve the problem. |
| |
| Keywords: | maintenance force priority the maximal covering location problem |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
