Research And Realization Of Methods On Logistics Delivery Vehicle Scheduling

Recent years, logistics, taken as "third profit resource", has been developed rapidly. Lots of physical distribution centers were established to improve the efficiency of goods flow by large factories and commercial firms.Considerable sum of transportation corporations, storage enterprises and shipping companies are taking on business of third party logistics. The distribution business is now flourishing, how to decrease distribution cost is concerned.Logistics distribution is a stage that it is connected with consumer directly. The cost of distribution are very high in all kinds of logistics cost. The rationality of vehicle scheduling will influence on speed, cost and profit of logistics greatly. The delivery vehicles are divided into Vehicle Routing Problem and Vehicle Scheduling Problem according to their space and time characters.VSP\VRP is a typical strong NP-hard problem, high effective exact algorithm is impossible to it. Heuristic Algorithm can resolve large-scale problem, but cannot ensure the quality of the resolution. Recently, genetic algorithm has been explored and improved in Vehicle Routing Problem and Vehicle Scheduling Problem; 80% experiments are testified with its validity.This paper analyzed lots of restrictions in VSP\VRP with single depot, non full load, and based on TSP, mathematics models are established with time restrictions, genetic algorithm is applied. Because of some changes in code, copy, intersect, variance, effective results are obtained. With the development of electronic commerce, GIS is applied in kinds of aspects, but less in VSP. This paper got the shortest way between any two nodes in the electronic map using Dijkstra algorithm, also the shortest way is shown in it. That made the way clearly, the progress intuitionist, which is the significance of the research.