Study On Logistics Support Network Path Planning Based On Quality Of Service

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.