On the Neutrality of Flowshop Scheduling Fitness Landscapes
Solving efficiently complex problems using metaheuristics, and in particular local search algorithms, requires incorporating knowledge about the problem to solve. In this paper, the permutation flowshop problem is studied. It is well known that in such problems, several solutions may have the same fitness value. As this neutrality property is an important issue, it should be taken into account during the design of search methods. Then, in the context of the permutation flowshop, a deep landscape analysis focused on the neutrality property is driven and propositions on the way to use this neutrality in order to guide the search efficiently are given.
KeywordsSchedule Problem Local Search Local Optimum Local Search Algorithm Fitness Landscape
Unable to display preview. Download preview PDF.
- 1.Stützle, T.: Applying iterated local search to the permutation flow shop problem. Technical Report AIDA-98-04, FG Intellektik, TU Darmstadt (1998)Google Scholar
- 9.Wright, S.: The roles of mutation, inbreeding, crossbreeding and selection in evolution. In: Jones, D. (ed.) Proceedings of the Sixth International Congress on Genetics, vol. 1 (1932)Google Scholar
- 15.Altenberg, L.: The evolution of evolvability in genetic programming. In: Kinnear Jr., K.E. (ed.) Advances in Genetic Programming, pp. 47–74. MIT Press, Cambridge (1994)Google Scholar
- 16.Verel, S., Collard, P., Clergue, M.: Measuring the Evolvability Landscape to study Neutrality. In: Keijzer, M., et al. (eds.) Poster at Genetic and Evolutionary Computation – GECCO 2006, pp. 613–614. ACM Press, Seattle (2006)Google Scholar
- 17.Verel, S., Collard, P., Clergue, M.: Scuba Search: when selection meets innovation. In: Evolutionary Computation, CEC 2004, pp. 924–931. IEEE Press, Portland (2004)Google Scholar
- 18.Marmion, M.E., Dhaenens, C., Jourdan, L., Liefooghe, A., Verel, S.: NILS: a neutrality-based iterated local search and its application to flowshop scheduling. In: 11th European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP11). LNCS, Springer, Heidelberg (2011)Google Scholar