Upgrading evolutionary algorithms through multiplicity for multiobjective optimization in job shop scheduling problems
In previous works the ability of CPS-MCPC (an evolutionary, co-operative, population search method with multiple crossovers per couple) to build well delineated Pareto fronts in diverse multiobjective optimization problems (MOOPs) was demonstrated. To test the potential of the novel method when deal...
Guardado en:
| Autores principales: | Esquivel, Susana Cecilia, Ferrero, Sergio W., 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/23406 |
| Aporte de: |
Ejemplares similares
-
Multirecombinated evolutionary algorithms to solve multiobjective job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000) -
Multiobjective evolutionary algorithms for job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
Multiple crossovers on multiple parents for the multiobjective flow shop problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2002) -
An improved ant colony algorithm for the job shop scheduling problem
por: Leguizamón, Guillermo, et al.
Publicado: (2002) -
Contrasting two MCMP alternatives in evolutionary algorithms to solve the job shop scheduling problem
por: Stark, Natalia, et al.
Publicado: (2001)