多目标多约束应急物资调度优化的仿真研究

Research on Emergency Materials Dispatching Based on Chaotic Particle Swarm Optimization Algorithm

研究突发事件应急物资调度优化问题,应急物资具有多目标、多约束、动态性特性,传统粒子群算法存在"早熟"缺陷,无法获得最优调度方案,为解决上述问题,提出一种采用混沌粒子群优化算法的突发事件应急物资调度优化模型。首先建立应急物资调度优化数学模型,并确立目标函数,然后采用混沌粒子群算法对其进行求解,最后采用仿真测试算法的有效性和可行性。仿真结果表明,混沌粒子群算法克服了传统优化方法易陷入局部最优的缺陷,在保证应急时间最短的前提下,运输总成本最低本。

In order to improve the emergency materials dispatching efficiency and reduce the cost for dispatching, in view of multiple objectives, constraints and dynamic characteristics of emergency, emergency material dispatch problem, this paper proposed an emergency material dispatch optimization model based on chaos particle swarm opti- mization algorithm. Firstly, the mathematical model of emergency materials dispatching was established and the target function was decided, and then the chaos particle swarm optimization algorithm was used to solve the problem. Final- ly, the simulation tests were carried out to test the validity and feasibility of the algorithm. The simulation results show that the proposed algorithm has overcome the defects of traditional optimization method and obtained the lowest total cost of the transport in the emergency of the shortest time.