| 兵力展开问题研究 |
| |
| 引用本文： | 高尚,孙川.兵力展开问题研究[J].指挥控制与仿真,2006,28(5):22-23. |
| |
| 作者姓名： | 高尚 孙川 |
| |
| 作者单位： | 1. 江苏科技大学电子信息学院,江苏,镇江,212003
2. 南开大学信息技术科学学院,天津,300071 |
| |
| 摘 要： | 如何将基地的兵力以最短时间展开到多个阵地中,是运输问题中的一种。为解决此问题对著名的兵力展开问题进行了研究。建立了兵力展开问题的数学模型,此模型是一个混合整数规划模型。提出了一种求解方法,该方法可解决类似的混合整数规划问题。最后给出了一个实例。
|
| 关 键 词： | 兵力展开 运输问题 混合整数规划 算法 |
| 文章编号： | 1673-3819(2006)05-0022-02 |
| 修稿时间： | 6/6/2006 12:00:00 AM |
Research on Manpower Deployment |
| |
| GAO Shang,SUN Chuan.Research on Manpower Deployment[J].Command Control & Simulation,2006,28(5):22-23. |
| |
| Authors: | GAO Shang SUN Chuan |
| |
| Abstract: | How to transport the forces to the battlefields as quickly as possible is a manpower deployment problem. It is also one kind of transportation problems. To crack this hard nut, a study is carried on this well-known topic. This paper sets up a mathematic model for the manpower deployment, which is a mixed integer programming model. Furthermore, a solving method is put forward to settle the similar mixed integer programming problems. Finally , an example is given. |
| |
| Keywords: | manpower deployment transportation problem mixed integer programming algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《指挥控制与仿真》浏览原始摘要信息 |
| 点击此处可从《指挥控制与仿真》下载免费的PDF全文 |
