Research on Multi-Depot Vehicle Routing Problem in emergency logistics

In recent years, all kinds of disasters have happened frequently. Therefore how to properly distribute disaster relief supplies becomes more and more important. In this paper a mathematical model with time window and capacity limits is built for the Multi-Depot Vehicle Routing Problem (MDVRP). Then a solution strategy for this model is presented, which integrates table dispatching method and improved C-W algorithm. At last a case is given to test the effectiveness of the solution strategy. This study indicates that this solution strategy can reduce the distribution cost. Meanwhile the research result is easier to put into practice, because the premise of the mathematical model is very consistent with the reality.