A self-guided genetic algorithm for flowshop scheduling problems

摘要

This paper proposed self-guided genetic algorithm, which is one of the algorithms in the category of evolutionary algorithm based on probabilistic models (EAPM), to solve strong NP-hard flowshop scheduling problems with the minimization of makespan. Most EAPM research explicitly used the probabilistic model from the parental distribution, then generated solutions by sampling from the probabilistic model without using genetic operators. Although EAPM is promising in solving different kinds of problems, self-guided GA doesn't intend to generate solution by the probabilistic model directly because the time complexity is high when we solve combinatorial problems, particularly the sequencing ones. As a result, the probabilistic model serves as a fitness surrogate which estimates the fitness of the new solution beforehand in this research. So the probabilistic model is used to guide the evolutionary process of crossover and mutation. This research studied the flowshop scheduling problems and the corresponding experiment were conducted. From the results, it shows that the self-guided GA outperformed other algorithms significantly. In addition, self-guided GA works more efficiently than previous EAPM. As a result, self-guided GA is promising in solving the flowshop scheduling problems.