Optimizing Transportation Route With Uncertain Factor In War

Optimizing the transportation route with uncertain factor is the core of decision-making contents in war, which plays the vital role in enhancing motivation and logistics ability.Because the current paper mainly focuses on certain domain and scarcely on uncertain one, which is nearly blank on military, optimizing the transportation route with uncertain factors is studied in paper. The uncertain factors contain the uncertain parameters, uncertain restrict conditions and uncertain objectives. Here are some research contents.The short time models of appointed credible value are researched as well as the maximal credibility of appointed transportation time, when transportation time is stochastic or fuzzy variable. The minimal loss models of appointed chance value are researched as well as the maximal chance of appointed transportation loss, when transportation loss is fuzzy stochastic or stochastic fuzzy variable. The optimal time and loss models of appointed credible value are researched as well as the maximal credibility of appointed transportation time and loss, when transportation time and loss are uncertain variables.For solving the problem of the necessity node, the special rules of coding, crossover and mutation are designed based on genetic algorithm, at the same time the fitness values of chromosomes are gained by simulation.Network optimizing problems with upper limit capacity of interval number in arcs are researched.Upper limit and lower limit of interval numbe are used to arc's upper limit capacity respectively, conservative maximal flow, optimistic maximal flow, minimal risk optimistic maximal flow and minimal risk flow are defined and their mathematic models are constructed. Based on nonlinear objective function, the minimal risk flow is obtained by calculating the multiple solutions of maximal flow and allotting at specific flow, according to the concept of adjustable loop.For dealing with the problems of uncertain objects in transportation decision , including urgent object and general object, the optimal projects of organization and transportation are researched when there being heavy freights, multi motorcadesand routes, the time interval of adjoin motorcades, restrict of freights and loss. The models and algorithms are constructed by defining satisfaction of urgent object and general object. If the problem is complicated, the algorithms have been designed based on GA, at the same time the methods of dealing with restrict conditions and facilitating variables are provided in paper.Finally, the research works and results of this dissertation are summed up and some innovations are brought forward.