In this paper, it is about the Vehicle Routing Problem (VRP) in the Logistic,the study isbase on Genetic Algorithm. The mathematical model of the VRP for GA is build. In thispaper , a improved genetic algorithm is proposed for the VRP ,the GA avoids effectively thecommon effects of early convergence and the diversity of population intraditional geneticalgorithm . Make use of the coding method of the natural sequence for the VRP;Theindividual choice method is lots, this text adopted a dish wager choice method;gave up thethe tradition probability system, but adopted from atuoadaption probability system, make atinherit the process to the cross and the variation which are two important processes of ,according to the value of the individual orientation of adoption to cross differently all rateand variation all rate, improve the existence ability of the excellent individual, guaranteedthe whole healthy of the evolution that grows at the same time.This algorithm can find theoptimal or nearly optimal solution to the vehicle routing problem effectively , which isproved by a number of experiments provided by this paper. |