Multiplicity of parents and crossovers, the stud and the neh heuristic for searching the optimal makespan in fssp
Different evolutionary approaches using genetic algorithms were proposed to solve the Flow Shop Scheduling Problem (FSSP). Variants point to the selection mechanism, genetic operators and the decision to include or not in the initial population an individual generated by some conventional heuristic...
Guardado en:
| Autores principales: | Esquivel, Susana Cecilia, Zuppa, Federico, Gallard, Raúl Hector |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2001
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23405 |
| Aporte de: |
Ejemplares similares
-
Multiple parents, multiple crossovers and incest prevention in evolutionary computation
por: Alfonso, Hugo, et al.
Publicado: (1999) -
Multirecombination and different representation in evolutionary algorithms for the flow shop scheduling problem
por: Bain, María Elena, et al.
Publicado: (2000) -
Multirecombining random and seed immigrants in evolutionary algorithms to face the shop scheduling problem
por: Vilanova, Gabriela, et al.
Publicado: (2002) -
Parameter control in multirecombinated evolutionary algorithms for the flow shop scheduling problem
por: Vilanova, Gabriela, et al.
Publicado: (2001) -
Combining incest prevention and multiplicity in evolutionary algorithms
por: Minetti, Gabriela F., et al.
Publicado: (2001)