An ant colony optimization algorithm for job shop scheduling problem
The nature has inspired several metaheuristics, outstanding among these is Ant Colony Optimization (ACO), which have proved to be very effective and efficient in problems of high complexity (NP-hard) in combinatorial optimization. This paper describes the implementation of an ACO model algorithm kno...
Guardado en:
| Autores principales: | Flórez, Edson, Gómez, Wilfredo, Bautista, Lola |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2013
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/76211 http://42jaiio.sadio.org.ar/proceedings/simposios/Trabajos/ASAI/07.pdf |
| Aporte de: |
Ejemplares similares
-
An improved ant colony algorithm for the job shop scheduling problem
por: Leguizamón, Guillermo, et al.
Publicado: (2002) -
Upgrading evolutionary algorithms through multiplicity for multiobjective optimization in job shop scheduling problems
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
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) -
Facing the job shop scheduling problem wih hybrid evolutionary algorithms
por: Salto, Carolina, et al.
Publicado: (2001)