Because of the specific time and distance constraints, emergency management departments usually build multiple depots (resource centers) to serve the widely dispersed customers (disaster areas), to more effectively fulfill customer demand, and deal with the changing road conditions in real time. Therefore, research on multi-depot dynamic emergency dispatch can be of significant value to effective disaster operations. In this paper, a multi-objective multi-depot and multi-type dynamic vehicle routing problem model is established that minimizes total distance and priority errors and considers secondary disasters, damaged roads, the limited vehicle number at the various depots, and the different vehicle capacities. To solve this model, a hybrid ant colony optimization based on the circumcenter of the polygon formed by depots is proposed. Real landslides disaster data from Hubei province and two kinds of benchmark instances test the performance of the proposed algorithm. After detailed experimental comparisons, the competitive performance of the proposed algorithm is verified.

由于时间和距离的限制，应急管理部门通常会建立多个仓库（资源中心），以服务分散的客户（灾区），更有效地满足客户需求，并实时处理不断变化的路况。因此，多仓库动态应急调度的研究对于有效的防灾工作具有重要的参考价值。本文建立了一个多目标，多站点，多类型的动态车辆路径问题模型，该模型使总距离和优先级误差最小，并考虑了次生灾害，道路损坏，各个站点的有限车辆数量以及不同车辆能力。为了解决该模型，提出了基于仓库形成的多边形的外接心的混合蚁群算法。来自湖北省的真实滑坡灾害数据和两种基准实例测试了该算法的性能。经过详细的实验比较，验证了该算法的竞争性能。