Abstract
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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call