The Application Of Genetic Algorithms In The Logistics Path Planning

Vehicle routing problem is combinatorial optimization problem and a typical NP-hard problem, traditional algorithms usually are not satisfied. Genetic algorithm is an excellence algorithm to solve vehicle routing problem. Because genetic algorithm is an algorithm which uses for reference the selection and evolution of nature, it is a search algorithm with parallelism, stochastic, adapt-self characteristic.The center content of this thesis is how to apply GA to VRP. First, it reviews the past studies on vehicle routing problems and their solution methods. Focusing on the solution method of vehicle routing problem with soft time window (VRPTW). Then, introduces basic theoretic of GA. This thesis detailed describes and analyzes the arithmetic design and carry out it through MATLAB. Finally, through comparing GA with other method, it shows the superiority of GA.Through implementation of the method solving VRPTW, The author draws conclusions as follows: the superiority of GA using in VRP. The excellent solutions are obtained in the application. However because the realistic complicacy problem, the algorithm design of GA will be improved.