基于粒子群算法的带有运输衔接的应急物资运输路径优化问题

A Transportation Routing Problem of Emergency Materials Based on Particle Swarm Optimization Algorithm

针对应急物流时间紧迫性及物资需求的特殊性,建立以灾区需求满意度最大和运输成本最小的应急物资运输路径优化调度模型。采用直升机运输与汽车运输分层处理的方式,设计粒子群优化算法进行物资运输和分配决策。数值算例验证了模型及粒子群算法的有效性与稳定性。

This paper provides a transportation routing problem of the emergency materials motivated by the time urgency and the demand particularity in the emergency logistics. The objective is to maximize the time satisfaction of the disaster area and minimize the transportation cost. A particle swarm optimization algorithm is proposed to determine the material transportation and distribu- tion by using hierarchical processing for helicopter transportation and vehicle transportation. Finally, a numerical example verifies the effectiveness and stability of the model and the particle swarm optimization algorithm.