Logistics And Distribution Center For Vehicle Routing Optimization Problem

With the development of economy and improvement of logistics professional, the logistics allocation develops quickly. In the process of operation, a lot of operational research and decision-making problem should be solved. The Vehicle Routing Problem (VRP) is urgent to be solved. The VRP concerns widely and should consider many factors. At the same time, it influences the service quality, logistic cost and benefit. In the daily life, post deliver, bus dispatch, the pipe layout and so on can be abstract as VRP.The logistic allocation is a complicated systems engineering. Many models and algorithms established to optimize problems are complex and most have the nature of NP. So taking the VRP of distribution center as the subject of this paper has the theoretical and practical meaning. The Vehicle Routing Problem (VRP) is a NP hard problem and with the increase of amount of customer, the allocation schemes that can be chosen increase by exponent. So using the heuristic algorithm to solve the problem like this has become a trend. Hence, based on the analysis of the existing heuristic algorithm for the Vehicle Routing Problem (VRP), a distribution model relevant to the route arrangement was established. An adaptive genetic algorithm was presented for the solution to this problem. Comrutational results based on C language programming demonstrated that the adaptative algorithm improved the quality of the results and can solve the problem effectively.