The Research Of Logistics Distribution Vehicle Routing Problem Based On Demand

In the recent years, with the development of the market economy, the logistics,known as “the third profit source”, plays an important role in our dailyeconomic activities. The distribution is contact with the consumers directly inthe logistics industry and the costs caused by the distribution become the core oflogistics costs. Therefore, the distribution route optimization schedulingproblem becomes the forefront of the logistics industry and also the logisticsvehicle scheduling problem becomes the research hotspot of the combinatorialoptimization and operations research. Only one vehicle can be used to meet thedelivery requirement for one customer in the traditional VRP. The paper releases theconstraint and focuses on SDVRP.By incorporating the time windows on the issue, weresearches the split delivery vehicle routing problem with time windows(SDVRPTW).Firstly, we realize the panorama of SDVRP and construct themathematical optimization model which seeks the shortest distance to meet the deliveryrequirements. Then a new bee colony optimization algorithm is proposed based onimproving the reaction threshold and the value of stimulate signal. The experimentalresult proves the feasibility of the algorithm, and also highlights the strong optimizationability of BCO compared with other typical algorithms. Finally, the paper researches thesplit delivery vehicle routing problem with time windows and constructs itsmathematical optimization model. The problem is also solved by BCO and we alsoverify the algorithm by a concrete instance. Algorithm researches on SDVRP andSDVRPTW are very little currently, the paper broadens their algorithm research areaand also expands the applications of BCO.