Disaster relief routing under uncertainty: A robust optimization approach
研究了在旅行时间和需求不确定的情况下，如何规划救灾物资配送路径。对比了容量受限和允许拆分配送两种模型，发现拆分配送能更好应对不确定性，实现快速公平的物资送达。
This article addresses the Capacitated Vehicle Routing Problem (CVRP) and the Split Delivery Vehicle Routing Problem (SDVRP) with uncertain travel times and demands when planning vehicle routes for delivering critical supplies to a population in need after a disaster. A robust optimization approach is used for CVRP and SDVRP considering the five objective functions: minimization of the total number of vehicles deployed (minV), the total travel time/travel cost (minT), the summation of arrival times (minS), the summation of demand-weighted arrival times (minD), and the latest arrival time (minL), out of which we claim that minS, minD, and minL are critical for deliveries to be fast and fair for relief efforts whereas minV and minT are common cost-based objective functions in the traditional VRP. A new two-stage heuristic method that combines the extended insertion algorithm and tabu search is proposed to solve the VRP models for large-scale problems. The solutions of CVRP and SDVRP are compared for different examples using five different metrics in which we show that the latter is not only capable of accommodating the demand greater than the vehicle capacity but also is quite effective to mitigate demand and travel time uncertainty, and thereby outperforms CVRP in the disaster relief routing perspective.