| Article ID: | iaor2012588 |
| Volume: | 18 |
| Issue: | 1 |
| Start Page Number: | 25 |
| End Page Number: | 51 |
| Publication Date: | Feb 2012 |
| Journal: | Journal of Heuristics |
| Authors: | Fink Andreas, Czogalla Jens |
| Keywords: | combinatorial optimization |
The fitness landscape of the no‐wait (continuous) flow‐shop scheduling problem is investigated by examining the ruggedness of the landscape and the correlation between the quality of a solution and its distance to an optimal solution. The results confirm the presence of a big valley structure as known from other combinatorial optimization problems. The suitability of the landscape for search with evolutionary computation and local search methods is discussed. The observations are validated by experiments with two evolutionary algorithms.