Research On Vehicle Scheduling Problem Of Logistic Distribution

The optimization of logistics vehicle routing problem is one of the key links to reducethe logistics services cost and strengthen logistics services quality. Selecting the right vehicleroutes can effectively reduce the rate of empty vehicle driving and transportation cost, raise aneconomic performance. It also contributes to resolve the city transportation hustle, the lack ofenergy, the air pollution, etc, which perplex people deeply.This thesis takes the Yunfa logistic company as a research object. According to theactual background of the company, there are mainly two problems to be studied. The first oneis setting up a model of the VSP, the other one is carrying out the VSP model. For the firstproblem, this thesis classifies the current VSP problem, analyzes the present conditions andexistent problems of this company in logistics distribution VSP and constructs the VSPmathematic model; According to the second problem, this thesis compares the merits andshortcomings of the methods which used to solve the VSP problem, this thesis on geneticalgorithm principles, advantages and disadvantages, solving methods were alsointroduced.selects nature number to design genetic algorithm, adopts Visual Basic to carryout VSP, and carries on a test to this software function. The test results reflect that thissoftware has a perfect function.This thesis also studies the result after taking the optimization about the Yunfa logisticcompany VSP. According to the result of the software realization, comparing with the actualvehicle path., the conclusion is that the vehicle routes have obvious superiority after thevehicle routes are computed by software. In this thesis, a reasonable method which is used toreduce the company logistics cost in VSP is provided.