A method for solving large-scale flowshop problems by reducing search space of genetic algorithms
説明
It is important to force search algorithms in promising regions of the solution space when solving large-scale problems. Genetic algorithms with search space reduction are proposed to solve flowshop problems. Additional precedence constraints generated by heuristic rules are introduced to reduce the search space of the genetic algorithm. An improved crossover operator which preserves the constraints is proposed and compared with other standard crossover operators. The computation results show that the algorithm has a significant improvement as compared with the standard genetic algorithms.
収録刊行物
-
- SMC 2000 Conference Proceedings. 2000 IEEE International Conference on Systems, Man and Cybernetics. 'Cybernetics Evolving to Systems, Humans, Organizations, and their Complex Interactions' (Cat. No.00CH37166)
-
SMC 2000 Conference Proceedings. 2000 IEEE International Conference on Systems, Man and Cybernetics. 'Cybernetics Evolving to Systems, Humans, Organizations, and their Complex Interactions' (Cat. No.00CH37166) 3 1776-1781, 2002-11-08
IEEE