A novel min–max robust model for post-disaster relief kit assembly and distribution

A novel min–max robust model for post-disaster relief kit assembly and distribution

Shuanglin Li
2023-01-16 / 0 评论 / 416 阅读 / 正在检测是否收录...

该论文是针对灾后应急物资配送过程中的模块化装配问题,建立两阶段多目标鲁棒优化模型,并采用$\epsilon$-约束算法对模型进行求解,最后用云南地震相关数据对模型和算法进行验证,并通过敏感性分析得到相应管理启示。文章发表在《Expert Systems with Applications》。


In disaster response phase, different types of emergency relief materials are prepared simultaneously. Assorting and packing a proportion of relief items into relief kits will benefit in improving relief distribution agility and efficiency. This study focuses on the relief kit assembly and distribution problem, which includes two stages. The first stage solves the facility location and relief kit assembly problem with the minimum operation cost. The second stage optimizes the relief kit distribution plan with the minimum distribution cost and maximum demand satisfaction, in which an epsilon-constraint method is adopted to transfer the bi-objective model into a single one with the minimum total cost. Then, a min–max robust model is developed to cope with the uncertain demand and travel time. Computational experiments are provided to validate the effectiveness of the min–max robust model compared with deterministic model and two-stage stochastic model. A realistic case study based on earthquakes in Yunnan Province is provided to illustrate the applicability of the proposed min–max robust model. Some managerial insights are obtained by sensitivity analyses as follows. Assembling relief kits in the distribution centers is more effective than that in the demand points. Specifically, the average cost and 95% percentile of the former are 19.45% and 20.52% lower than those of the latter respectively. The vehicle loading capacity has a greater influence on the optimal solution than that of the available working time. Decision makers can balance the total cost and uncertainty budget by adjusting the conservatism level under expected demand satisfaction.


本文共 107 个字数,平均阅读时长 ≈ 1分钟




评论 (0)