Study On The Optimization Of Vehicle Dispatching Routing Problem Based On R Automotive Transmission Company

Internal distribution logistics is of fundamental importance for the entire logistics system and it plays an increasingly critical role for the cost control,as the lean production ideology has been widely used for the manufacturing enterprise.The Vehicle Routing Problem with Simultaneous Delivery and Pickup can reduce the transportation distance and improve the effectiveness of the enterprise operation.This thesis is aimed at the problem of optimizing the distribution path of the forklift truck in the plant area of R enterprise.Therefore,enterprises can study further about optimizing the vehicle dispatching routing so as to obtain more economic benefits.Firstly,the basic theory and classification of the vehicle routing problem and its solution algorithms are discussed.In this problem,there is one depot with a certain number of homogeneous vehicles under capacity constraint and maximum distance constraint.On this basis,considering the influence of the vehicle quantity and the total distance of the vehicle transportation on the total transportation cost,a VRPSDP mathematical model with the minimum transportation cost as the target is established;designing the chromosome encoding and genetic operators which are more suitable for the VRPSDP.And come up with a new way to simply the full-load vehicle routing problem,considering the cost and efficiency.Finally,simulation experiments are carried out to find out the optimal value of the objective function and the optimal vehicle routing scheme based on the genetic algorithm.Through the comparison with the original enterprise vehicle routing arrangement,the validity and rationality of the proposed model and algorithm are verified.