HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

How to keep good schemata using cross-over operators for permutation problems

Lamia Djerid 1 Marie-Claude Portmann 1
1 MACSI - Industrial system modeling, analysis and operation
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The schemata theory proposed by Holland in 1975 for the genetic algorithm approach is based on a binary representation of the problem solutions. When the description of the solutions needs some more complex representations (called generally symbolic representations) and when the one-point classical cross-over operator must be replaced by some more complicated operator, then the environment of the schemata theory disappears and other conditions must be taken into account in order to ensure the efficiency of the genetic algorithms. In a previous paper, we have already proposed some performance indicators which try to extend the basic schemata theory for permutation problems and we have experimented the quality of a list of cross-over operators using these indicators. In the present paper, we show how an analytical approach may be developed in order to avoid the experimental approach for some permutation cross-over operators and some indicators.
Document type :
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 8:40:35 AM
Last modification on : Friday, February 4, 2022 - 3:31:17 AM


  • HAL Id : inria-00098942, version 1



Lamia Djerid, Marie-Claude Portmann. How to keep good schemata using cross-over operators for permutation problems. [Intern report] 99-R-336 || djerid99b, 1999, 15 p. ⟨inria-00098942⟩



Record views