Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion
Computers and Operations Research
A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem
Expert Systems with Applications: An International Journal
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Minimizing makespan on an m-machine re-entrant flowshop
Computers and Operations Research
| Hi-index | 0.00 |
This paper proposes a self-adaptive hybrid population-based incremental learning algorithm (SHPBIL) for the m-machine reentrant permutation flow-shop scheduling problem (MRPFSSP) with makespan criterion. At the initial phase of SHPBIL, the information entropy (IE) of the initial population and an Interchange-based search are utilized to guarantee a good distribution of the initial population in the solution space, and a training strategy is designed to help the probability matrix to accumulate information from the initial population. In SHPBIL's global exploration, the IE of the probability matrix at each generation is used to evaluate the evolutionary degree, and then the learning rate is adaptively adjusted according to the current value of IE, which is helpful in guiding the search to more promising regions. Moreover, a mutation mechanism for the probability model is developed to drive the search to quite different regions. In addition, to enhance the local exploitation ability of SHPBIL, a local search based on critical path is presented to execute the search in some narrow and promising search regions. Simulation experiments and comparisons demonstrate the effectiveness of the proposed SHPBIL.