A hierarchical model for optimally configuring logistics delivery networks

This paper presents a hierarchical model of logistics delivery networks by using some principles in graph theory. Based on the proposed hierarchical model, an optimal solution for dynamically configuring the resources of logistics delivery networks is devised through setting the appropriate value for the weight of edges in the model, which aims at minimizing the total traffic cost of a delivery network. The solution then employs an amended Dijkstra routing algorithm to determine a traffic path in the hierarchical model for a logistics delivery demand. The effects of this solution were compared with the other two traditional delivery solutions from the aspects of traffic costs and the network blocking ratio, which shows the proposed solution achieved a satisfying performance.