计算机应用研究2017，Vol.34Issue(7)：1935-1938,4.DOI:10.3969/j.issn.1001-3695.2017.07.003
基于改进蝙蝠算法的柔性流水车间排产优化问题研究
Study for flexible flow shop scheduling problem based on advanced bat algorithm
摘要
Abstract
In order to solve the flexible flow shop scheduling problem,this paper proposed the SEBA.The existing BA could not solve the discrete problem because it was easily trapped in local extremum and had low accuracy of the optimization results.SEBA adopted the ROV coding method,which made the algorithm suitable for solving discrete FFSP problems.This paper designed the set of the elite individuals based on hamming distance,which had higher fitness and lower similarities.It could also take turns to lead the population evolution,enhance the vitality of population evolution and avoid optimization process trap in local extremum.It designed an adaptive position update method to improve the accuracy of algorithm.Finally,it measured the SEBA by the datas from different scale scheduling benchmark problems with comparison of several algorithms.Simulation results show that SEBA is efficient for solving FFSP.关键词
柔性流水车间问题/蝙蝠算法/精英个体集/汉明距离Key words
flexible flow shop scheduling problem(FFSP)/bat algorithm/elite individual set/Hamming distance分类
信息技术与安全科学引用本文复制引用
韩忠华,朱伯秋,史海波,林硕..基于改进蝙蝠算法的柔性流水车间排产优化问题研究[J].计算机应用研究,2017,34(7):1935-1938,4.基金项目
国家自然科学基金资助项目(61503259) （61503259）
辽宁省社会科学规划基金资助项目(L15BGL017) （L15BGL017）
校涵育项目(XKHY2-61) （XKHY2-61）
