The Research And Application Of Vehicle Routing Problem Based On Genetic Algorithm And Simulated Annealing Algorithm

In the logistics , the Vehicle Routing Problem(VRP) plays a very important role in saving the automobile resources and does constructive effort in cost control.Using the nature rule of superior win and the inferior being washed out ,genetic algorithm(GA) can count the initial solution in the beginning and get the better solution and feasible solution in the counting process, and gets rid of the non-feasible solution . The using of Simulated Annealing Algorithm(SAA) provides a new method for the VRP and prevents it from local best solution . Thus , I incorporate GA with SAA and take advantage of both of good points to create the best overall situation solution . I add memory device in the process of creation of solution and keep record of the best solution ,which can prevent the best solution from lost.This paper applies GA and SAA to solve the VRP with time windows (Time windows means that, logistics vehicle should deliver goods to the customers during the time windows. It is also called time Limit Problem) , I take advantage of the data from FAW TOYOTA material logistics management system ,and apply GA linked to SAA with memory to do my research and to do practice about VRP with time windows ,after that, I get the best solution of highest possibility and achieve the anticipated effect.