Research on the Optimization of Relief Supplies Distribution Routing Based on Multiple Models
The vehicle routing problem of relief supplies distribution, a typical NP-hard problem, is a hot topic in transportation research. Aiming at a two-echelon supply chain made up of a set of depots and stricken-points, the paper studies the problem how to decide delivery objects and the optimal delivery scheme; This paper decomposes the distribution VRP of relief supplies into an assignment problem and a problem similar to Traveling Salesman Problem, applies the theory of Thiessen Tessellation in spatial analysis to solve the assignment problem. For the sake of the problem of relief supplies distribution with uncertain time, a concept of risk exceeding time has been brought forth, and a multi-layer planning model with the least risk exceeding time has been established, too. At last, an example for this algorithm is given to prove the applicability of the model.
R. L. Tian et al., "Research on the Optimization of Relief Supplies Distribution Routing Based on Multiple Models", Advanced Materials Research, Vols. 228-229, pp. 883-888, 2011