震后初期Single-Hub应急物资筹集模型

发布时间：2018-03-01 09:54

本文关键词： 应急物资筹集网络优化混合轴辐式结构逐次枚举法　出处：《系统管理学报》2017年03期 　论文类型：期刊论文

【摘要】：在震灾应急决策中,为解决无限制需求期、筹集时间为模糊区间数、枢纽节点无容量限制时的单枢纽应急物资筹集网络的优化问题,通过构建多目标数学规划模型,并设计逐次枚举的启发式算法。根据应急物资满足程度和筹集时间最短要求,采用混合复合路径连接方式,以保证应急物资筹集网络的效率和效益。在算法设计上,将应急物资筹集的双目标规划模型转换为全直送模式和纯Hub模式的单目标线性规划求解,并将所有节点弧逐次迭代,寻找全局最优弧集;根据最优节线连接方式,确定混合轴辐式应急物资筹集网络结构,并对应急物资筹集方案选优;最后,案例验证表明,基于逐次枚举的启发式算法相比模拟退火算法(SA),在运算难度、迭代次数以及最优筹集时间上都有明显的优势,能够运用于震灾应急物资筹集决策中。
[Abstract]:In the earthquake emergency decision, in order to solve the unconstrained demand, raise time as fuzzy interval number, single emergency supplies hub hub node without capacity constraints when raising network optimization, by constructing multi objective mathematical programming model and heuristic algorithm design. According to the successive enumeration of emergency supplies and raise the satisfaction degree of the shortest time requirements the hybrid composite, path connection, to ensure the efficiency and effectiveness of emergency material collection network. In the algorithm design, the emergency supplies raised two objective programming model is converted into a single objective linear programming solution sent straight pattern and pure Hub mode, and all nodes arc successive iteration, search the global best arc set; according to the optimal pitch line connection, determine the mix of emergency supplies raising network structure, and to raise emergency supplies selection scheme; finally, the case shows that, based on successive pieces Compared with simulated annealing algorithm (SA), the heuristic algorithm has obvious advantages in operation difficulty, iteration times and optimal raise time, and it can be applied to earthquake emergency material collection decision.

【作者单位】：西南科技大学经济管理学院;哈尔滨工业大学建筑学院;
【基金】：国家自然科学基金资助项目(71372091) 教育部人文社会科学研究基金青年项目(16YTC630040)
【分类号】：F251

【相似文献】