Research On Military Vehicle Scheduling Problem Based On Genetic Simulated Annealing Algorithm

Military Logistics has changed positively with the development of high and new technology in order to meet the requirements of today's information wars.The role of military logistics in military action is also increasingly outstanding.As Our country's interior Troops,The Chinese people's armed police forces is responsible for all heavy tasks,such as guard duty and anti-terrorist attacks and dealing with some emergencies and so on.Because of the tough tasks and the great responsibility,they are required to be able to move at any time and can reach the destination to deal with complicated problems when something happens.The motor transport is the main mode of the Armed Police Force,and in this way they deliver supplies to the subordinate units,transport personnel and materials and arrange vehicle routes scientifically to maximize the effectiveness of motor transport to deliver something to the destination quickly and efficiently.The Vehicle scheduling program of The Chinese people's armed police forces is arranged by the people's experience,so it will lead to the randomicity and irrationality which will bad for the construction and development of the Troop Logistics.Therefore,how to arrange vehicle scheduling program scientifically and efficiently became a important Subject for the construction of the Armed Forces Logistics.This paper introduces the concept and the inherent characteristics and the sort of military logistics in detail,and compares the advantages and disadvantages of some commonly used vehicle scheduling optimization algorithm.It also introduces the security model of the Armed Police Force,and the subordinate units are delivered by the superior military warehouse in usual.When dealing with emergency situations,a group is a disposal individual and marched the place which events happened to dispose under the command of a higher authority.Be based on different ways of dealing with emergencies in normal,they build two models called the mathematical model of VSP with soft time windows in usual and the mathematical model of VSP with a single time window.Besides,it introduces the concept and implementation steps of GA and SA in detail.Because of GA is prone to premature convergence and SA has good climbing characteristics,the State receiving mechanism of SA was introduced into the selection and crossing of GA,so there is competition between child generation and parent generation in the selection and crossing operation.The best individual sin group will be optimized and greatly improved the global searching ability through incorporating SA into GA.The fitness was drawn and Squared it as selected objects,so that increase probability of being selected individual which has good fitness.The search capability has been strengthened though using a adaptive strategies to adjust crossover and mutation probability.Finally,the results show the effectiveness and feasibility by using MATLAB software Programming to solve numerical example.It also shows the contents of this paper can be well applied to the Armed Police Force vehicle scheduling problem.This paper summarized the full text and he existing problems and pointed out the shortcomings and further research content.