Vehicle Routing Problems (VRP) Of Coastal Defense Military Logistics Distribution Based On Ant Colony Algorithm

Before a person going out, he is most interested in the best way form the jumping-off point to the terminal. This issue is just like the transport-sending problem, which is interested in speed, cost and benefit. The Vehicle Routing Problems (VRP) is a key link of the transport-sending problem, it has high value whether for civil use or for military use, whether in normal times or in wartime. Any how, the VRP is becoming a hot spot of research field that so many people are pursuing.Using the theory of nowadays-materials-circulation as the foundation stone, knitting together the request of reformation in our army's logistics system, this paper carry through in-depth research aiming at promoting the fast-ensure-supply ability of coastal defense forces . By discussing the characteristic and operation significance of military materials circulation, this paper thoroughly study on the VRP of coastal defense forces, during the course of the research, we derivate the Ant Colony Algorithm (ACA) to solve and optimize the Vehicle Routing Problems. Further more, we particularly analyze the principle, performance and system model of the ACA, and aiming at the defect of the arithmetic that it is liable to get into the deficiency of local optimum solution, we ameliorate this arithmetic.For the sake of closing up to the practical situation that the units of coastal defense force are dispersive; there are anfractuosities';and the mission requirement is changefully,this paper establish two utility models:one is the model of capacity-restricted multiple goals-deliver optimizing problems; the other is the model of Vehicle Routing Problems with Time Windows(VRPTW). By the two models, we discussing the VRP problems as the requirement quantity and the time limit of mission changing, and at last, the two models are carried out by ACA.Furthermore, combing experimental analysis, we carefully study on each parameter impacting on the Ant Colony Algorithm, and then we draw up the optimum arrangement of parameters of ACA which is in application to the VRP of coastal defense forces. In actual application, it has preferable reference value.At the end of this paper, using three cases named"quick dispatch troops","sending in reason"and"exact guarantee", we analyze and evaluate the parameter setting,capacity-restricted VRP and VRP with Time Windows. At last , we acquire some constructive results.