反向人工蜂群算法求解混合流水车间调度问题.

Aiming at the hybrid flow shop scheduling problem with the objective of minimizing the makespan, this paper proposed an opposite artificial bee colony algorithm with opposition-based learning to solve the problem. First, according to the characteristics of hybrid flow shop scheduling problem, this paper established the corresponding mathematical model and simulation optimization model. Secondly, in order to avoid the problem of local optima in the process of optimization, this paper added the opposition-based learning strategy in the three stages of population initialization, employment bee and observation bee, used the reverse order strategy between two points and the element exchange strategy to speed up the optimization, then used the elitist preservation strategy to retain the optimal solution. Finally, the simulation experiment selected two examples and 21 benchmark problems of different scales, the results of simulation experiment verified that proposed algorithm is effective in solving such problems by comparison with the experimental of related algorithms. [ABSTRACT FROM AUTHOR]