A genetic approach using direct representation of solution for parallel task scheduling problem
- Autores: Susana Cecilia Esquivel, Claudia Ruth Gatica, Raúl Hector Gallard
- Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 1, Nº. 3, 2000 (Ejemplar dedicado a: Third Issue; 18 p.)
- Idioma: inglés
- Enlaces
-
Resumen
Evolutionary computation (EC) has been recently recognized as a research field, which studies a new type of algorithms: Evolutionary Algorithms (EAs). These algorithms process populations of solutions as opposed to most traditional approaches which improve a single solution. All these algorithms share common features: reproduction, random variation, competition and selection of individuals. During our research it was evident that some components of EAs should be re-examined. Hence, specific topics such as multiple crossovers per couple and its enhancements, multiplicity of parents and crossovers and their application to single and multiple criteria optimization problems, adaptability, and parallel genetic algorithms, were proposed and investigated carefully. This paper show the most relevant and recent enhancements on recombination for a genetic-algorithm-based EA and migration control strategies for parallel genetic algorithms. Details of implementation and results are discussed.
