Hybrid particle swarm optimizers in the single machine scheduling problem: an experimental study | ||
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - San Luis | |
| dc.conicet.organizacion | Universidad Nacional de San Luis. Facultad de Ciencias Físico Matemáticas y Naturales. Departamento de Informática. Laboratorio Investigación y Desarrollo en Inteligencia Computacional | |
| dc.conicet.organizacion | Universidad Nacional de San Luis. Facultad de Ciencias Físico Matemáticas y Naturales. Departamento de Informática. Laboratorio Investigación y Desarrollo en Inteligencia Computacional | |
| dc.conicet.organizacion | Instituto Politécnico Nacional | |
| dc.conicet.paginas | 628 | es |
| dc.contributor.author | Cagnina, Leticia Cecilia | |
| dc.contributor.author | Esquivel, Susana Cecilia | |
| dc.contributor.author | Coello Coello, Carlos | |
| dc.contributor.other | Dahal, Keshav P. | |
| dc.contributor.other | Chen Tan, Kay | |
| dc.contributor.other | Cowling, Peter I. | |
| dc.date.issued | 2007 | es |
| dc.description.abstract | Although Particle Swarm Optimizers (PSO) have been successfully used in a wide variety of continuous optimization problems, their use has not been as widespread in discrete optimization problems, particularly when adopting non-binary encodings. In this chapter, we discuss three PSO variants (which are applied on a specific scheduling problem: the Single Machine Total Weighted Tardiness): a Hybrid PSO (HPSO), a Hybrid PSO with a simple neighborhood topology (HPSOneigh) and a new version that adds problem-specific knowledge to HPSOneigh (HPSOkn). The last approach is used to guide the blind search that PSO usually does and reduces its computational cost (measured in terms of the objective function evaluations performed). It is also shown that HPSOkn obtains good results with a lower computational cost, when comparing it against the other PSO versions analyzed, and with respect to a classical PSO approach and to a multirecombined evolutionary algorithm (MCMP-SRI-IN), which contains specialized operators to tackle single machine total weighted tardiness problems. | es |
| dc.description.fil | Fil: Cagnina, Leticia Cecilia. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - San Luis; Argentina. Universidad Nacional de San Luis. Facultad de Ciencias Físico Matemáticas y Naturales. Departamento de Informática. Laboratorio Investigación y Desarrollo en Inteligencia Computacional; Argentina | |
| dc.description.fil | Fil: Esquivel, Susana Cecilia. Universidad Nacional de San Luis. Facultad de Ciencias Físico Matemáticas y Naturales. Departamento de Informática. Laboratorio Investigación y Desarrollo en Inteligencia Computacional; Argentina | |
| dc.description.fil | Fil: Coello Coello, Carlos. Instituto Politécnico Nacional; México | |
| dc.format | application/pdf | es |
| dc.identifier.citation | Cagnina, Leticia Cecilia; Esquivel, Susana Cecilia; Coello Coello, Carlos; Hybrid particle swarm optimizers in the single machine scheduling problem: an experimental study; Springer Verlag Berlín; 2007; 143-164 | es |
| dc.identifier.eissn | 1860-9503 | es |
| dc.identifier.institucional | CONICET | |
| dc.identifier.isbn | 978-3-540-48582-7 | es |
| dc.identifier.issn | 1860-949X | es |
| dc.identifier.repo | CONICET Digital | |
| dc.identifier.uri | http://hdl.handle.net/11336/159403 | |
| dc.journal.ciudad | Berlín | es |
| dc.journal.pagination | 143-164 | es |
| dc.journal.pais | Alemania | es |
| dc.language.iso | eng | es |
| dc.publisher | Springer Verlag Berlín | es |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/url/https://link.springer.com/chapter/10.1007/978-3-540-48584-1_6 | |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/doi/https://doi.org/10.1007/978-3-540-48584-1_6 | |
| dc.rights | info:eu-repo/semantics/restrictedAccess | * |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | * |
| dc.source | https://www.springer.com/series/7092 | es |
| dc.source.titulo | Evolutionary scheduling | es |
| dc.subject | PARTICLE SWARM OPTIMIZATION | es |
| dc.subject | SINGLE MACHINE SCHEDULING | es |
| dc.subject | HYBRIDIZING | es |
| dc.subject.classification | Ciencias de la Computación | es |
| dc.subject.classification | Ciencias de la Computación e Información | es |
| dc.subject.classification | CIENCIAS NATURALES Y EXACTAS | es |
| dc.title | Hybrid particle swarm optimizers in the single machine scheduling problem: an experimental study | es |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type | info:eu-repo/semantics/bookPart | |
| dc.type | info:ar-repo/semantics/parte de libro | |
Archivos
Bloque original
Cargando...
- Nombre:
- CONICET_Digital_Nro.13a2d5c8-ddf6-40f3-9b16-f102fbb076c7_A.pdf
- Tamaño:
- 7.07 MB
- Formato:
- Adobe Portable Document Format