烟花算法在联合补货问题中的应用研究

Application Research of Fireworks Algorithm in Joint Replenishment Problem

烟花算法作为一种新型群体智能优化算法,在众多领域得到成功应用。联合采购品种的不断扩大对算法性能提出了巨大挑战。针对联合补货问题设计了基于烟花算法的求解方案,并利用基础算例证明方案有效性。随机生成的大规模算例表明,烟花算法相较于混合差分进化算法,在求解大规模联合补货问题时可获得更优的近似最优解,具有更快的收敛速度和更高的稳定性,验证了烟花算法在混合整数规划方面的应用效果。

As a novel swarm intelligence optimization algorithm,the fireworks algorithm has been successfully applied in many fields since proposed.In order to deal with the challenge for algorithm performance raised by increasing variety of joint procurement,a solu⁃tion based on fireworks algorithm is designed for joint replenishment problem.The efficiency of the solution is verified by basic case.The large-scale random cases show the fireworks algorithm,compares with hybrid differential evolution algorithm,can obtain better approximately optimization solution,and has better convergence speed and stability for larger scale problem.These results verify the application performance of fireworks algorithm in mixed integer programming.