基于动态规划算法的资源应急分配优化模型

Optimization model of resource emergency allocation based on dynamic programming algorithm

针对电力突发事件的资源应急分配问题,文中提出了基于动态规划的阶段优化模型。该模型依据各需求点的初始时刻需求,以最小化资源超时到达造成的损失为优化目标,进行资源的应急优化分配。同时考虑后续时刻资源需求的动态变化,基于上一阶段的优化目标叠加下一时刻资源需求缺乏量的惩罚项,从而实现不同时刻需求点之间资源的转运调度。文中采用自适应惯性系数和飞行时间来提高算法的收敛速度,并将所提IPSO应用于两阶段动态规划模型的求解。以人力资源数据进行的仿真结果表明,文中算法迭代40次即可收敛,显著优于传统PSO。且与单阶段优化模型在后续时刻出现明显人力资源缺乏的情况不同,该模型能够满足各需求点的动态需求,进而对应急资源进行合理分配。

Aiming at the problem of emergency resource allocation for power emergencies,a stage optimization model based on dynamic programming is proposed in this paper.According to the initial demand of each demand point,the model optimizes the emergency allocation of resources with the objective of minimizing the loss caused by the overtime arrival of resources.Then,considering the dynamic changes of resource demand at subsequent times,the optimization objective is to superimpose the penalty term of lack of resource demand at the next time on the basis of the previous stage,so as to realize the transfer scheduling of resources between demand points at different times.Adaptive inertia coefficient and flight time are adopted to improve the convergence speed of the algorithm,and the proposed IPSO is applied to solve the two⁃stage dynamic programming model.The simulation results with human resource data show that the IPSO algorithm proposed in this paper converges in 40 iterations,which is significantly better than the traditional PSO.The two⁃stage dynamic programming model proposed in this paper can meet the dynamic needs of each demand point,while the single⁃stage optimization model shows obvious lack of human resources at each demand point at the subsequent time.