An analysis on selection methods and multirecombination in evolutionary search when solving the job shop scheduling problem
Evolutionary algorithms (EAs) can be used as optimisation mechanisms. Based on the model of natural evolution, they work on populations of individuals instead of on single solutions. In this way, the search is performed in a parallel manner. During the last decades, there has been an increasing inte...
Guardado en:
| Autores principales: | Stark, Natalia, Salto, Carolina, Alfonso, Hugo, Gallard, Raúl Hector |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2002
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23008 |
| Aporte de: |
Ejemplares similares
-
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) -
A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
por: Minetti, Gabriela F., et al.
Publicado: (2000) -
Incorporating tabu search for local search into evolutionary algorithms to solve the job shop scheduling problem
por: Fernandez, Natalia, et al.
Publicado: (2001)