Practical Algorithm For The Network Of Systems In Logistics And Distribution

In recent years, logistics distribution, taken as "the third profit resource", is now flourishing in our country. How to increase distribution efficiency and reduce its cost has become a very important research topic. Optimizing logistics distribution is primarily to arrange the vehicle routes, satisfy the need of each customer's order and make the total logistics cost least. The exact and rational planning of vehicle routing will reduce the rate of empty driving, lower the cost of distribution, heighten economic benefits, and as a result, achieve logistics scientific style.On the base of the achievement of predecessor, single-type single-distribution center problem and multiple depot multi-distribution center problem are classified to discrete type vehicle routing problem, the smallest cost problem in undirected network is classified to continuous type vehicle routing problem. Several results are obtained as follows:In chapter 3, for single-type single-logistics center problem, using Floyd algorithm and Saving Method, this paper gives an algorithm of the shortest route on condition that the number of vehicles least on the general network.In chapter 4, for multiple depot multi-logistics center problem, this paper gives an algorithm of the problem as follows: under condition of carrying capacity of the vehicles limited, firstly the vehicles load goods from original depot to the neighbor distribution center at the same time, and then deliver them separately according to user's demand, finally completes the distribution duty return to the neighbor depot.In chapter 5, this paper discusses the smallest cost problem in undirected network, which has the upper limit of the flow, and gives its relevant algorithm.In the study of three chapters, this paper sets up mathematics models and gives algorithms of the three problems, and tests algorithm's feasibility, at last gives examples separately.