【作者】 黄泽汉；

【导师】 谭跃进；

【作者基本信息】 国防科学技术大学 ， 管理科学与工程， 2009， 博士

【摘要】 未来高技术战争中军用物资需求品种繁多、数量巨大、时间紧迫,为确保战争胜利,参战部队必须获得迅速及时、安全可靠、经济有效的物资保障服务,为此对物流保障系统提出了更高的服务质量要求。物流保障网络是服务于现代化战争,以基地、仓库等保障实体为依托,以各种运输保障通道为连接,以满足部队需求为目标,把各种保障资源按一定的要求和原则合理部署,在空间上成网络化布局的物流保障系统。网络路径规划技术是当前研究的热点之一,军事领域的物流保障网络路径规划技术研究更引起军内外学者的广泛注意,在现有物流保障网络设施基础上,通过对物资运输路径进行规划,对提高我军物资保障能力,确保战争胜利具有关键作用。本文在综述网络路径规划技术研究现状的基础上,重点研究了物流保障系统的定义及建模、物流保障网络及服务质量参数体系、关键网络资源调度策略、网络路径规划技术等内容,主要研究工作如下:在分析物流保障系统组成结构、基本功能及影响要素的基础上,给出了物流保障网络的建模与分析方法、网络化模型以及明确物流保障网络路径规划技术的研究范围。提出了建立物流保障网络服务质量参数体系基本原则。在研究分析计算机网络、通信网络、交通物流网络服务质量参数基础上,建立了物流保障网络层次模型,即网络拓扑层、网络传输层、网络应用层;提出了各个层次上的服务质量参数,包括任务完成率等若干新的参数,建立了物流保障网络服务质量参数体系。在分析保障物资分割运输属性的基础上,讨论了单任务网络路径规划问题。根据物资流在网络上传输时完全不可分割、基于时间可分割、基于空间可分割三种属性,考虑用户对物资保障的规模性、时效性、安全性、经济性等服务质量要求,运用运筹学、图论、计算机仿真等理论和方法,分别建立基于不同传输性质的网络路径规划模型,设计相应的算法,求解满足网络拓扑属性约束和服务质量要求的网络路径规划方案。针对多个保障任务可能同时发生的情形,研究了多任务网络路径规划问题。首先,根据不同保障任务对关键网络资源使用需求程度以及对整个保障网络系统效能的贡献度为基础,提出了一种基于综合度量的关键网络资源调度策略;其次,结合物资流在网络上的传输属性,提出了基于传输时间的独立路径问题;最后,给定任务集合,以任务完成率为优化目标,建立了多任务网络路径规划模型,利用多蚁群并行优化原理,设计了多任务网络路径规划的算法,并且针对每一个任务,搜索网络时空资源相互独立的优化路径,求解任务完成率最高的网络路径规划方案。更多还原

【Abstract】 In the future high-tech local warfare, the variety of military material requirements is various, the amount is huge and the schedule is tight. To assure the victory of warfare, each unit of the force must be supported not only in time but also reliably and effectively, which requires the logistics support system to provide higher service quality. A logistics support network (LSN), which serves modern warfare, consists of support entities such as bases and warehouses and is connected by traffic networks. LSN disposes various support resources according to some rules and requirements and comes into being a network layout system.Recently, network path planning is the research focus in the field of network application, especially military logistics support network. Based on existing LSN, optimization of path planning is of key significance to improve the support ability and assure the victory of warfare.Based on summarizing the current progress on path planning techniques of LSN, this thesis studies the definition and modeling of LSN, the service quality parameters system, the key network resource scheduling and the path planning of LSN. The main results are as follows.By systematically analyzing the structure, functions and factors affecting LSN, this thesis proposes a modeling and analysis method of LSN and defines the research bound of path planning of LSN.Some basic principles for parameters system of service quality are presented. Based on the service quality of Internet, communication network and traffic network, a three-layers parameters system of service quality of LSN is proposed, i.e., the network topology layer, the network transportation layer and the network application layer. Some new indexes such as the mission performability are proposed.The path planning problem with single task is studied considering materials partition attributes. Taking into account the quantity, time, reliability and cost et al, for indivisible transportation, partition-transportation by time and partition-transportation by space respectively, this thesis proposes path planning model, designs according algorithms and obtains satisfied schemes with network topology constrains and service quality constrains using methods of operational research, graph theory, computer simulation et al.The path planning problem with multitasks is studied. Firstly, based on the grade for using the key network resources and the contribution for system efficiency, a key network resource scheduling strategy based on Combined Measurement is presented. Secondly, according to transportation attribute of material flow, an irrelated path problem based on transportation time and space is presented. Lastly, given a set of tasks, aiming at the mission performability, this thesis establishes a multitasks path planning model and designs an algorithm based on the principle of multi-ant colonies parallel optimization, which searches the irrelated path on time and space for each mission and obtains a set of path planning schemes with maximal mission performability.更多还原