战场运输在线路径规划算法研究  

Online Route Planning Algorithms for Battlefield Transportation

作　　者：曾斌[1] 姚路[1] 秦潇 ZENG Bin;YAO Lu;QIN Xiao(Department of Management Engineering,Naval University of Engineering,Wuhan 430033,China)

机构地区：[1]海军工程大学管理工程系

出　　处：《火力与指挥控制》2020年第1期79-84,共6页Fire Control & Command Control

基　　金：国家自然科学基金资助项目（71201172）

摘　　要：针对战场运输保障任务批次多,不确定性强等特点,提出了一种轻型在线的运输路径规划算法。以节省整体运输开销为目标,利用图论思想对运输路径的相互关系进行了数学建模,定义了路径连接的必要条件和合并算子。并借鉴了节约法等启发式方法的思路,提出了一个路径优化合并方法和相应在线调度算法,能够按照负载平衡和最小开销策略分配运力,按需对现有任务合并。模拟实验结果表明,与过去按分管关系指派任务的方法相比,运输开销得到显著减小。A lightweight and adaptive transportation team dispatching and route planning algorithm is proposed in order to solve the problems of multiple and uncertain battlefield maintenance tasks.The objective of the algorithm is to minimize the whole transportation costs.Firstly,the relationship of the vehicle paths is modelled and described by using graph theory,in which the necessary conditions of path connection and operator of path combination are defined.Then,a path combining method is proposed according to the thought of saving methods on the basis of the graph model.Furthermore,the framework structure of the transportation tasks dispatcher algorithm is described in detail,which can dispatch transportation resource according to the rules of load balance or minimal cost and combine current tasks when resource fall short.The simulation results show that the proposed planning algorithm saves more cost than the organizational dispatcher.

关 键 词：在线路径规划 节约法 战场运输 图论 任务合并 

分 类 号：TJ01[兵器科学与技术—兵器发射理论与技术] U116[交通运输工程]