灾后应急配送中心选址问题的降阶回溯算法  

Reduced Order Backtracking Algorithm for Post-Disaster Emergency Distribution Center Location Problem

作　　者：胡开元 宁爱兵[1] 尹远翔 陈至伟 张惠珍[1] HU Kaiyuan;NING Aibing;YIN Yuanxiang;CHEN Zhiwei;ZHANG Huizhen(Business School,University of Shanghai for Science and Technology,Shanghai 200093,China)

机构地区：[1]上海理工大学管理学院,上海200093

出　　处：《物流科技》2024年第16期1-5,共5页Logistics Sci-Tech

基　　金：国家自然科学基金(71401106);上海市“管理科学与工程”高原学科建设项目。

摘　　要：近年来自然灾害频发,提高灾后应急物资的配送效率一直以来都是性命攸关的大事,因此文章基于灾后应急配送中心选址问题的精确算法进行研究。首先,建立该问题的数学模型并对该问题中的数学性质进行研究和证明;其次,在这些数学性质的基础上,设计上下界子算法和降阶子算法,这些子算法能够有效减少解空间,提高算法的效率,使该算法能够更有效地处理规模更大的问题;再次,提出降阶回溯子算法,通过剪枝和局部降阶进一步缩小问题的搜索规模,并能得到最优解;最后,通过分析和解决一个案例来更清楚地说明算法的原理和操作步骤。In recent years,natural disasters occur frequently,so improving the eff iciency of post-disaster emergency materials distribution has always been a vital event.This paper studies the location problem of post-disaster emergency distribution center based on the accurate algorithm.Firstly,the mathematical model of this problem is established and the mathematical properties of this problem are studied and proved.Secondly,on the basis of these mathematical properties,upper and lower bound sub-algorithms and reduced order sub-algorithms are designed,which can effectively reduce the solution space and improve the efficiency of the algorithm,so that the algorithm can deal with the larger problem more effectively.Thirdly,a reduced-order backtracking subalgorithm is proposed,which further reduces the search scale of the problem and can get the optimal solution through pruning and local reduction.Finally,the principle and operation steps of the algorithm are explained more clearly by analyzing and solving a case.

关 键 词：应急配送中心选址问题 上下界算法 降阶回溯算法 

分 类 号：F259[经济管理—国民经济] TP301.6[自动化与计算机技术—计算机系统结构]