摘要
简要描述随机服务系统基本理论和常用数学模型。针对坦克弹药保障中两种典型的决策问题,即阵地配置方案优选和指派保障车辆数量问题,运用运筹学的方法,将其视为先到先服务的随机服务系统。在一定的简化条件下,运用三种数学模型进行系统评估,根据排队模型计算得出的一些定量指标,表明集中配置优于分散配置;并提供了完成保障任务必须的车辆指派数量。结论不仅符合实际的战场需要,而且能提出较为合理的解决方案,算法简单易行。
This paper describes the basic models of random service system. Aiming at two kinds of typical problems, such as position configure in choosing optimal operation and the number of support vehicle assignment, adopting operational researches, taking it as a first arriving first serving system, it puts forward three mathematical models under certain simplified conditions. According to some quantitative indexes which were counted by queuing models, it indicates that concentrative support is better than dispersed support, and gives out the correct number of support vehicle assignment The conclusions not only meets actual battlefield requirements, but also provides a more reasonable solution. The algorithm is easy and simple.
出处
《指挥控制与仿真》
2007年第4期101-103,107,共4页
Command Control & Simulation
关键词
随机服务系统
坦克弹药保障
配置方式
保障能力
random service system
tank-cannonball support
configure mode
support ability
