A Covering Tour Approach for Disaster Relief Locating and Routing with Fuzzy Demand
A Covering Tour Approach for Disaster Relief Locating and Routing with Fuzzy Demand
复制标题
DOI：
10.1007/s13177-019-00185-2
复制
发表时间：
2020-01-01
影响因子：
2.1
通讯作者：
Malmir, Behnam
中科院分区：
文献类型：
--
作者：
Goli, Alireza;Malmir, Behnam
优化资源在个人之间的分配和配置是在危机时刻采取的最重要措施之一。时间作为一个至关重要的因素，对救援活动获救人数的增加有重大影响。本文提出了一种受灾地区救援车辆调度调度模型。它使用覆盖巡视方法来缩短响应时间。此外，由于在发生灾害时确定必需品的确切需求量是非常困难的，在某些情况下甚至是不可能的，在该模型中，需求参数被认为是一个模糊参数。在此基础上，设计了一种基于可信度理论的优化方法，并提出了一种随机模拟的和声搜索算法。最后，通过比较CPLEX求解器和GRASH算法，分析了和声搜索算法的效率。结果表明，该算法在较短的运行时间内取得了较好的效果。
Optimizing the distribution and allocation of resources among individuals is one of the most important measures to be taken at the time of crisis. Time, as a vital factor, has a significant impact on the increase in the number of people rescued by relief activities. This paper presents an allocation and routing model for relief vehicles in the areas affected by a disaster. It uses a covering tour approach to reduce response time. Moreover, because determining the exact amount of demand for essential goods in the event of a disaster is very difficult and even impossible in some cases, the demand parameter is considered as a fuzzy parameter in this model. Accordingly, an optimization method is designed based on credibility theory, and a harmony search algorithm with random simulation is developed. Finally, the efficiency of the harmony search algorithm is analyzed by comparing the CPLEX solver and GRASP algorithm. The results show that the proposed algorithm performs well over a short operating time.