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

The Single-Hub Emergency Materials Collecting Model at the Initial Stage after Earthquake

在震灾应急决策中,为解决无限制需求期、筹集时间为模糊区间数、枢纽节点无容量限制时的单枢纽应急物资筹集网络的优化问题,通过构建多目标数学规划模型,并设计逐次枚举的启发式算法。根据应急物资满足程度和筹集时间最短要求,采用混合复合路径连接方式,以保证应急物资筹集网络的效率和效益。在算法设计上,将应急物资筹集的双目标规划模型转换为全直送模式和纯Hub模式的单目标线性规划求解,并将所有节点弧逐次迭代,寻找全局最优弧集;根据最优节线连接方式,确定混合轴辐式应急物资筹集网络结构,并对应急物资筹集方案选优;最后,案例验证表明,基于逐次枚举的启发式算法相比模拟退火算法(SA),在运算难度、迭代次数以及最优筹集时间上都有明显的优势,能够运用于震灾应急物资筹集决策中。

To solve the network optimization problem for single-hub emergency materials collecting with the unlimited demand period, collecting period with fuzzy interval numbers, and the unlimited incapacity of hub node, we establish a multi-objective mathematical programming model, and design a successive enumeration of heuristic algorithm. A hybrid composite path connection mode is used to ensure the efficiency and effectiveness of emergency material collecting network according to the emergency material meeting degree and the shortest collecting time. In algorithm design, we divide the dual goal program model into single objective linear programming of the straight style and pure hub style, where all the nodes of arc are successive iterated to find the global optimal arc sets. We then determine the network structure of mixing shaft emergency material according to the optimal pitch line connection. Using a case, we show that the heuristic algorithm of successive enumeration is obviously advantageous than the simulated annealing algorithm （SA） in operational difficult, iterations number and collecting time.