A quadrant shrinking heuristic for solving the dynamic multi-objective disaster response personnel routing and scheduling problem
针对灾害救援中人员路径与调度的动态多目标问题，提出一种象限收缩启发式算法，兼顾效率、公平和运输风险，并用2018年印尼龙目岛地震数据验证了其快速生成完整帕累托前沿的能力。
In the aftermath of natural disasters there is a need to provide disaster relief services. These services are offered by diverse disaster relief personnel teams that are specialized in the provision of the required services, e.g., teams that set up temporary shelters, teams that are providing medical services. These services are provided during a rolling horizon and the demand and supply characteristics of the disaster relief system evolve dynamically over time. In this paper we are presenting a dynamic variant of the multi-objective disaster relief personnel routing and scheduling (DDRPRS) problem, which considers efficiency, fairness and transportation risk objectives. We introduce a Quadrant Shrinking Method (QSM) based heuristic algorithm to approximate the Pareto Optimal Solutions of the DDRPRS problem under consideration. The proposed algorithm considers the performance of the solutions over the entire planning horizon and their robustness over time in terms of their efficiency, fairness and transportation risk. We apply the proposed heuristic for routing and scheduling personnel involved in evacuation and medical operations using data from the 2018 Lombok Earthquake in Indonesia. Our heuristic implementation covers both the dynamic and static variants of the disaster relief personnel routing and scheduling problem. Computational results show that the proposed heuristic can generate in a short time sufficiently large number of Pareto Optimal Solutions which cover the entire Pareto frontier as indicated by the diverging behaviours of the Pareto Optimal Solutions and the associated hypervolume metrics.