Simultaneous planning for disaster road clearance and distribution of relief goods: a basic model and an exact solution method
Simultaneous planning for disaster road clearance and distribution of relief goods: a basic model and an exact solution method
复制标题
DOI：
10.1007/s00291-020-00589-7
复制
发表时间：
2020-04-27
期刊：
影响因子：
2.7
通讯作者：
Olschok, Denis
中科院分区：
文献类型：
--
作者：
Briskorn, Dirk;Kimms, Alf;Olschok, Denis
近年来，越来越多的灾害发生。此外，受灾害影响的人数增加了。因此，有效地开展救灾工作，以减轻灾民的痛苦是非常重要的。灾难发生后，迫切需要将救援物资分别运送到需求地点和受灾地区。由于道路被堵塞或被碎片损坏，一些需求地点可能无法到达，因此救援物资的运送受到阻碍。本文研究的基本问题是同时疏通道路使救援地点畅通，同时运送救援物资以满足救援需求。在需要的地点考虑严格的运送救济物资的最后期限。给出了一种形式化的问题表述，并分析了其计算复杂度。建立了混合整数规划模型，并提出了基于分支定界法的精确求解方法。对模型公式和分支定界算法的性能进行了计算研究。
In recent years, more and more disasters occurred. Additionally, the amount of people affected by disasters increased. Because of this, it is of great importance to perform the relief operations efficiently in order to alleviate the suffering of the disaster victims. Immediately after the occurrence of a disaster, there is an urgent need for delivering relief goods to demand locations and affected regions, respectively. Due to roads being blocked or damaged by debris, some demand locations may be out of reach and therefore the delivery of relief goods is hampered. This paper investigates the basic problem of simultaneously unblocking roads in order to make demand locations accessible and delivering relief goods in order to satisfy demand. Strict deadlines for the delivery of relief goods are considered at the demand locations. A formal problem statement is provided, and its computational complexity is analyzed. Additionally, a mixed integer programming model is developed and an exact solution method based on a branch and bound approach is proposed. A computational study investigating the performance of the model formulation and the branch and bound algorithm is conducted.