Research On Military Logistics Distribution Routing Optimization Based On Time Dependent Network

Deepen reform of national defense and army opinions put forward new demands for architecture and organizational processes of logistics. Military logistics, as an important component of military logistics, play a key role in military logistics system. Military logistics distribution is a major part of military logistics activities. The establishment of a sound and efficient military distribution network is the main task of military logistics distribution activities. Under wartime conditions, due to the distribution lines are vulnerable to military strikes, bad line surrounding battlefield environment and the urgent materials distribution task, it’s particularly important to choose a short time, low risk and low loss distribution path in military distribution networks.From the characteristics of wartime military logistics network optimization to start, the article, considering the timeliness, economy, reliability and many other goals of the wartime military transport path optimization, summarizes the wartime military logistics and distribution activities have some characteristics of multi-target, multi-constraint, more requirements, dynamic. Combined with the main factors influencing the military distribution in wartime, this paper determines the edge impedance of military logistics distribution network, as road passage time impedance, risk impedance based on road reliability, fees impedance considering the cost of recanalization blocking and the integrated impedance based on Time-Risk-Cost.In full consideration the characteristics of wartime military distribution, combined with characteristics of military distribution network, the author establish a military distribution network route optimization model based on time-dependent network, and then add the waiting time which is generated by road interruption because of enemy attacks in time-dependent network algorithm(TDN algorithm), eventually propose the time-dependent network shortest time path algorithm considering the waiting time (TDN-T algorithm) and time-dependent network integrated shortest path algorithm (TDN-Z algorithm), which solve the military distribution shortest path problem under the condition of time-dependent network. The algorithms above, considering the waits risk as a prerequisite, full account of the objective function from a single factor optimization to multiple factors optimization and solve various types of objective optimization problem of wartime military logistics network,which are short time, low energy consumption, high reliability and integrated optimum.Finally, according to the military logistics and distribution task in Military Region B, the author establishes a military distribution network route optimization model of major cities in Military Region B based on time-dependent network. Then, combined with wartime transport task Ⅰ, the author established military distribution network with time as the road impedance of Military Region B and using TDN-T algorithm obtained the shortest time path. Combined with wartime transport task Ⅱ, considering the circumstances as wartime must going through and forbidding, the author established military distribution network with integrated impedance based on Time-Risk-Cost as the road impedance of Military Region B and using TDN-Z algorithm obtained the integrated shortest path.. It provides decision makers with multiple alternatives and provides a basis for tdecision making of contingent wartime distribution path options.