欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
介绍了一种基于线性规划及对偶分析的物资运输指挥控制方法，该方法根据供求双方的物资供求量、运输路径的长度和运输工具的运载能力，建立一个以总运输时间为最小的线性规划和该线性规划的对偶线性规划模型，通过求解线性规划以及对偶分析来查找影响总运输时间的瓶颈和不合理的物资配置，最终制订一个符合要求的物资总运载力以及耗费时间为最小的运输指挥控制方案。一个典型的机械化作战师物资运输指挥控制方案分析表明：消除时间瓶颈可将总运输时间减少34．80％；改进物资配置可将总运输时间和总运载量分别减少19．58％和8．73％。
英文摘要：
A command and control method of fast transportation of battlefield supplies based on a linear programming and its dual programming is presented in this paper. The input parameters of this method include available routes and their kilometers between different supply and demand nodes, supply numbers, demand numbers, available vehicles at each supply node, vehicle load capacity, speed movement across routes, and units assigned to each supply and demand node. By removing time-bottleneck and improving assignment of supplies at supply nodes, a satisfactory command and control scheme of fast transportation of battlefield supplies could be solved as a linear programming and its dual programming by minimizing on the over all time of transporting supplies from supply nodes to demand nodes across routes. The results show that from an example of transportation of battlefield supplies of mechanized force, the over all time of transporting supplies decreased by 34.80% due to removing time-bottleneck, the over all time and capability of transporting supplies decreased by 19.58% and 8.73% respectively due to improving assignment of supplies at supply nodes.
同期刊论文项目
同项目期刊论文
期刊信息
位置：