Parameter control in multirecombinated evolutionary algorithms for the flow shop scheduling problem

• Autores: Vilanova, Gabriela; Villagra, Andrea; Pandolfi, Daniel; San Pedro, María Eugenia de; Gallard, Raúl Hector
• Año de publicación: 2001
• Idioma: inglés
• Tipo de recurso: documento de conferencia
• Materia: Ciencias Informáticas; Algorithms; Scheduling; ARTIFICIAL INTELLIGENCE; Evolutionary algorithms; Multiple Crossovers; Multiple Parents; Parameter Control.
• Institución: Universidad Nacional de La Plata

Improvements in evolutionary algorithms (EAs) consider multirecombination, allowing multiple crossover operations on a pair of parents (MCPC, multiple crossovers per couple) or on a set of multiple parents (MCMP, multiple crossovers on multiple parents). Evolutionary algorithms have been successfully applied to solve scheduling problems. MCMP-STUD and MCMP-SRI are novel MCMP variants, which considers the inclusion of a stud-breeding individual in a pool of random immigrant parents In this paper the proposal is to generate the stud-breeding individual by means of a robust conventional heuristic, the CDS. In a multirecombined EA, setting of parameters n1 (number of crossovers) and n2 (number of parents) remained as an open question. In previous works; they were empirically determined, or a deterministic rule was applied. In this paper self adaptation of parameters n1 and n2 is implemented, the idea is to code the parameters within the chromosome and undergo genetic operations. Hence it is expected that better parameter values be more intensively propagated. The present paper discusses different multi-recombined methods and contrasts their performance when different parameter control methods are applied, to find the minimum makespan for selected instances of the FSSP.
Eje: Sistemas inteligentes
Red de Universidades con Carreras en Informática (RedUNCI)