主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

中国管理科学 ›› 2025, Vol. 33 ›› Issue (8): 209-217.doi: 10.16381/j.cnki.issn1003-207x.2023.0781

• • 上一篇    

基于缺货延时双重损失的应急物资配送路径选择研究

苏兵1,2,3, 陈相文1, 张萌1(), 姬浩1,2,3, 孙璐璐1, 徐阳1, 郭清娥1, Lin Guohui4   

  1. 1.西安工业大学经济管理学院,陕西 西安 710021
    2.陕西省兵工科技创新发展软科学研究基地,陕西 西安 710021
    3.陕西高校军民融合科技创新研究中心,陕西 西安 710021
    4.阿尔伯塔大学计算机科学系,加拿大 埃德蒙顿 T6G 2E8
  • 收稿日期:2023-05-10 修回日期:2024-01-13 出版日期:2025-08-25 发布日期:2025-09-10
  • 通讯作者: 张萌 E-mail:zm890629@sina.com
  • 基金资助:
    国家社会科学基金项目(20XGL023);国家自然科学基金项目(72301205);陕西省教育厅重点科研计划项目(23JY037)

Research on Route Selection for Emergency Supply Distribution Based on Dual Losses of Shortage and Delay

Bing Su1,2,3, Xiangwen Chen1, Meng Zhang1(), Hao Ji1,2,3, Lulu Sun1, Yang Xu1, Qing’e Guo1, Guohui Lin4   

  1. 1.School of Economics and Management,Xi’an Technological University,Xi’an 710021,China
    2.Soft Science Base for Ordnance Industry Innovation & Development in Shaanxi Province,Xi’an 710021,China
    3.Civil-Military Integration Science and Technology Innovation Research Center of Shaanxi’s Colleges and Universities,Xi’an 710021,China
    4.Department of Computing Science,University of Alberta,Edmonton T6G 2E8,Alberta,Canada
  • Received:2023-05-10 Revised:2024-01-13 Online:2025-08-25 Published:2025-09-10
  • Contact: Meng Zhang E-mail:zm890629@sina.com

摘要:

针对带时间窗的紧缺应急物资配送路径选择问题,综合考虑每个需求点的需求量和配送时间要求,提出需求点最大缺货延时双重损失定义,并以单个需求点最大缺货延时双重损失费用最小为目标,建立应急物资配送路径选择模型。对于配送车辆充足的情形,设计时间复杂性为O(n3)的精确算法A*进行求解,其中n为需求点数;对于配送车辆不足的情形,设计时间复杂性为O(Ln2)的近似算法GA*进行求解,其中Ln分别为车辆数和需求点数,并分析算法GA*的近似比。最后结合实例进行分析,验证模型及算法的有效性。

关键词: 应急物资紧缺, 配送时间窗, 路径选择问题, 缺货延时双重损失, 近似算法

Abstract:

Efficient emergency supply distribution after sudden disasters stands as a critical factor in mitigating overall losses. The arrangement of emergency supply distribution encounters two challenges. First, it is difficult to mobilize sufficient emergency supply in a short time after the disaster, resulting in unmet needs of victims and subsequent losses. Second, there exists a pressing demand for timely supply arrivals, and any delays in emergency supply distribution cause further losses. Ensuing equitable access to disaster-stricken individuals necessitates vigilant monitoring of shortages of supply and impediments of distribution at each demand point. It is of great significance to formulate the routing strategy for scarce emergency supply distribution with time windows to reduce dual losses of storage and delay at each demand point as much as possible.In this paper, the problem of determining the optimal routes for emergency supply distribution is studied with the objective of minimizing the maximum dual losses of shortage and delay of each demand point. The premise acknowledges that the emergency supply is scarce and the available vehicles at the distribution center are potentially inadequate. The definition of shortage loss is given based on the shortage ratio, and the definition of delay loss is given based on piecewise penalty function.Further comprehensive consideration of supply shortage and distribution delay of each demand point servers as the foundation of developing a route selection model for emergency supply distribution. The objective of this proposed model is to minimize the maximum dual losses of shortage and delay of each demand point, aiming to avoid critical shortage at any single demand point and ensure adherence to stringent distribution time windows.An in-depth analysis of scenarios regarding supply shortage and distribution delay at each demand point is conducted. It delineates solutions in two distinct cases: sufficient vehicles and insufficient vehicles. In the case with sufficient vehicles, all amounts of supply in the distribution center can be sent to demand points. The routes for emergency supply distribution is initially determined based on the shortest paths from the distribution center to each demand point. Then, the quantities of supply distributed to each demand point is determined by equating the shortage ratio at each demand point, and an algorithm A* is developed accordingly. In the case with insufficient vehicles, it is not possible to send all amounts of supply in the distribution center, and an approximate algorithm GA* is developed to solve the problem in this case.By analyzing the performances of the proposed algorithms, the results demonstrate that algorithm A* is an exact algorithm in the case with sufficient vehicles. Its time complexity is O(n3), where n represents the number of demand points. The results also evaluate the time complexity of the approximate algorithm GA* in the case with insufficient vehicles. Its time complexity is O(Ln2), where L denotes the number of vehicles and n represents the number of demand points. Additionally, the approximate ratio of algorithm GA* and the upper and lower bounds of the approximate ratio are also proved.A case study is conducted focusing on the rescue in Luding County, Sichuan Province in September 2022 with a magnitude 6.8 earthquake. The dataset utilized for analysis is based on actual road conditions and related reports from CHINANEWS.COM. The algorithms developed in this paper are used to solve the route selection model for emergency supply distribution with the objective of minimizing the maximum dual losses of shortage and delay of each single demand point. The routing strategy is obtained, and an approximation ratio of 1.32 is yielded when comparing the maximum dual losses of shortage and delay at each single demand point to the result of the optimal solution.By investigating the route selection for emergency supply distribution based on dual losses of shortage and delay, the model developed in this paper aims to prevent the simultaneous occurrence of maximum shortage and delay at a single demand point, thereby enhancing the effectiveness of emergency supply distribution after sudden disasters. The proposed algorithms also provide reference for similar research problems. Future research endeavor will likely focus on building a model that closely mirrors real-world scenarios or refining the algorithm to achieve improved efficacy.

Key words: scarcer emergency supply, distribution time windows, route selection problem, dual losses of shortage and delay, approximation algorithm

中图分类号: