期刊文献+

考虑设施深度的过道布置问题及改进烟花算法求解方法 被引量:13

Improved fireworks algorithm for the corridor allocation problem with facility depth
原文传递
导出
摘要 针对过道布置问题中忽略设施深度及物流交互点置于过道边线的问题,结合实际布局活动对过道布置问题进行拓展,构建考虑设施深度的过道布置问题的混合整数规划模型,并提出一种改进烟花算法.该算法采用2-opt邻域构造方法对爆炸操作进行离散化处理;设置搜索深度并执行两点变异操作,实现变邻域搜索;通过贪婪选择方法更新种群以记忆精英解.为改进算法,引入混沌映射初始化烟花种群和设置阈值以加速算法寻优.通过对比数学规划方法与所提出算法的求解结果,验证了模型的有效性和所提出算法的求解优势.最后,通过不同算法的对比实验表明,改进烟花算法在寻优精度、收敛效率和稳定性方面均有明显优势. In view of the shortcomings in the existing research on the corridor allocation problem(CAP),in which the facility depth is always ignored and the logistics interaction points are always placed on the side line of the corridor,the CAP is extended according to the actual layout activities.A mixed integer programming model is constructed and an improved fireworks algorithm is proposed.In the improved algorithm,the explosion operation is discretized through a neighborhood construction method.The search depth and the two point mutation operation are set up to realize the variable neighborhood search.The greedy selection method is applied to update the population to memorize the elite solution.Furthermore,chaos mapping is introduced to initialize the fireworks population,and the threshold is set under the premise of high quality solution to accelerate optimization.Through comparing the results of mathematical programming with the proposed algorithm,the validity of the proposed model and the advantages of the presented algorithm are verified.Finally,the comparison experiments of different algorithms show that the improved fireworks algorithm has obvious advantages in optimization accuracy,convergence efficiency and stability.
作者 刘思璐 张则强 管超 龚举华 LIU Si-lu;ZHANG Ze-qiang;GUAN Chao;GONG Ju-hua(School of Mechanical Engineering,Southwest Jiaotong University,Chengdu 610031,China;Technology and Equipment of Rail Transit Operation and Maintenance Key Laboratory of Sichuan Province,Chengdu 610031,China)
出处 《控制与决策》 EI CSCD 北大核心 2020年第1期45-54,共10页 Control and Decision
基金 国家自然科学基金项目(51205328,51675450) 教育部人文社会科学研究青年基金项目(18YJC630255) 四川省科技计划项目(2019YFG0285).
关键词 过道布置问题 烟花算法 MIP数学模型 设施布局 corridor allocation problem fireworks algorithm mixed integer programming model facility layout
作者简介 通讯作者:张则强,E-mail:zzq 22@163.com.
  • 相关文献

参考文献7

二级参考文献46

  • 1张利彪,周春光,马铭,刘小华.基于粒子群算法求解多目标优化问题[J].计算机研究与发展,2004,41(7):1286-1291. 被引量:229
  • 2金哲,宋执环,杨将新.可重构制造系统工艺路线与系统布局设计研究[J].计算机集成制造系统,2007,13(1):7-12. 被引量:14
  • 3Chen L, Aihara K. Global search ability of chaotic neural networks [J]. IEEE Trans on Circuits Systems, 1999, 46 (8) : 974-993.
  • 4Feng J, Ying W Y. Pattern search algorithm an its application research in three-dimensional component layout [J]. J of Wuhan University of Technology,2003,27(2) :280-284.
  • 5武志军,宁汝新,王爱民.可重构制造系统布局规划方案的灰色模糊综合评价方法[J].中国机械工程,2007,18(19):2313-2318. 被引量:23
  • 6Kennedy J, Ebethart R. Particle swarm optimization[J]. Swarm Intelligence, 2007, 1(1): 33-57.
  • 7Karaboga D, Bastuk B. A powerful and efficient algorithm for numerical function optimization: Artificial bee colony(ABC) algorithm[J]. J of Global Optimization, 2007, 39(3): 459-471.
  • 8Dorigo M, Maniezzo V. Ant system: Optimization by a colony of cooperating agents[J]. Systems, Man, and Cybernetics, 1996, 26(1): 29-41.
  • 9Tan Y, Zhu Y. Fireworks algorithm for optimization[J]. Lecture Notes in Computer Science, 2010: 21(7): 355-364.
  • 10Bureerat S. Hybrid population-based incremental learning using real codes[C]. Learning and Intelligent Optimization. Rome: Spinger-Verlag, 2011: 379-391.

共引文献299

同被引文献94

引证文献13

二级引证文献23

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部