基于改进蝙蝠算法的柔性流水车间排产优化问题研.

In order to solve the flexible flow shop scheduling problem,this paper proposed the SEBA . The existing BA can not solve the discrete problem because it is easily trapped in local extremum and has low accuracy of the optimization results. SEBA adopt 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 have 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. [ABSTRACT FROM AUTHOR]