This paper proposes a decomposition based tabu search algorithm for solving multi-cover routing problem in the case of rapid need assessment. Rapid needs assessment aims to evaluate impact of a disaster at different sites to determine the needs of different community groups. Since the assessment process during a disaster is time critical, the focus in this paper is given to developing a solution approach, which aims to find high quality solutions in short period of time. The proposed algorithm focuses on a three-stage decomposition, where stages involve site selection, team assignment and routing of teams. Performance of the proposed algorithm is evaluated with respect to benchmark algorithms under different instances. The results indicate that the proposed algorithm can achieve high-quality solutions expeditiously, providing better results, on the average, when compared to the best-known solution approaches in the literature.

本文提出了一种基于分解的禁忌搜索算法，用于解决快速需求评估情况下的多覆盖路由问题。快速需求评估旨在评估灾害对不同地点的影响，以确定不同社区群体的需求。由于灾难期间的评估过程对时间至关重要，因此本文的重点是开发一种解决方法，旨在在短时间内找到高质量的解决方案。所提出的算法侧重于三阶段分解，其中阶段涉及站点选择、团队分配和团队路由。所提出算法的性能相对于不同实例下的基准算法进行了评估。结果表明，所提出的算法可以快速获得高质量的解决方案，提供更好的结果，