Multiplicity of parents and crossovers, the stud and the neh heuristic for searching the optimal makespan in fssp
- Autores
- Esquivel, Susana Cecilia; Zuppa, Federico; Gallard, Raúl Hector
- Año de publicación
- 2001
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- 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 (Reeves). New trends to enhance evolutionary algorithms for solving the FSSP introduced multiple-crossovers-per couple (MCPC) and multiple-crossovers-on-multiple-parents (MCMP). MCMP-S, a multiple-crossovers-on-multiple-parents variant, selects the stud (breeding individual) among the multiple intervening parents and mates it, more than once, with every other parent in a multiple crossover operation. In previous works, two versions of MCMP-S were faced. In the first one (MCMP-SOP), the stud and every other parent were selected from the old population. In the second one (MCMP-SRI), the stud was selected from the old population, and the other parents (random immigrants) were generated randomly. This paper introduces MCMP-NEH. The idea is to use the NEH heuristic, where the stud mates individuals in the mating pool coming from two sources: random immigrants and NEH-based individuals. These NEH-individuals are produced from randomly chosen individuals of the population and used as the starting points of the NEH heuristic. Experiments were conducted to contrast this novel proposal with a conventional evolutionary algorithm, with the only objective of establishing the improvement degree despite computational effort. Implementation details and a comparison of results for a set of flow shop scheduling instances of distinct complexity, using every evolutionary approach, are shown.
Eje: Sistemas inteligentes
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
Scheduling
ARTIFICIAL INTELLIGENCE
Multiplicity of parents
crossovers - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/23405
Ver los metadatos del registro completo
id |
SEDICI_fa562592fb5497fce425ae7502cf980a |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/23405 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
Multiplicity of parents and crossovers, the stud and the neh heuristic for searching the optimal makespan in fsspEsquivel, Susana CeciliaZuppa, FedericoGallard, Raúl HectorCiencias InformáticasSchedulingARTIFICIAL INTELLIGENCEMultiplicity of parentscrossoversDifferent 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 (Reeves). New trends to enhance evolutionary algorithms for solving the FSSP introduced multiple-crossovers-per couple (MCPC) and multiple-crossovers-on-multiple-parents (MCMP). MCMP-S, a multiple-crossovers-on-multiple-parents variant, selects the stud (breeding individual) among the multiple intervening parents and mates it, more than once, with every other parent in a multiple crossover operation. In previous works, two versions of MCMP-S were faced. In the first one (MCMP-SOP), the stud and every other parent were selected from the old population. In the second one (MCMP-SRI), the stud was selected from the old population, and the other parents (random immigrants) were generated randomly. This paper introduces MCMP-NEH. The idea is to use the NEH heuristic, where the stud mates individuals in the mating pool coming from two sources: random immigrants and NEH-based individuals. These NEH-individuals are produced from randomly chosen individuals of the population and used as the starting points of the NEH heuristic. Experiments were conducted to contrast this novel proposal with a conventional evolutionary algorithm, with the only objective of establishing the improvement degree despite computational effort. Implementation details and a comparison of results for a set of flow shop scheduling instances of distinct complexity, using every evolutionary approach, are shown.Eje: Sistemas inteligentesRed de Universidades con Carreras en Informática (RedUNCI)2001-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/23405enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:28:16Zoai:sedici.unlp.edu.ar:10915/23405Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:28:17.028SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
Multiplicity of parents and crossovers, the stud and the neh heuristic for searching the optimal makespan in fssp |
title |
Multiplicity of parents and crossovers, the stud and the neh heuristic for searching the optimal makespan in fssp |
spellingShingle |
Multiplicity of parents and crossovers, the stud and the neh heuristic for searching the optimal makespan in fssp Esquivel, Susana Cecilia Ciencias Informáticas Scheduling ARTIFICIAL INTELLIGENCE Multiplicity of parents crossovers |
title_short |
Multiplicity of parents and crossovers, the stud and the neh heuristic for searching the optimal makespan in fssp |
title_full |
Multiplicity of parents and crossovers, the stud and the neh heuristic for searching the optimal makespan in fssp |
title_fullStr |
Multiplicity of parents and crossovers, the stud and the neh heuristic for searching the optimal makespan in fssp |
title_full_unstemmed |
Multiplicity of parents and crossovers, the stud and the neh heuristic for searching the optimal makespan in fssp |
title_sort |
Multiplicity of parents and crossovers, the stud and the neh heuristic for searching the optimal makespan in fssp |
dc.creator.none.fl_str_mv |
Esquivel, Susana Cecilia Zuppa, Federico Gallard, Raúl Hector |
author |
Esquivel, Susana Cecilia |
author_facet |
Esquivel, Susana Cecilia Zuppa, Federico Gallard, Raúl Hector |
author_role |
author |
author2 |
Zuppa, Federico Gallard, Raúl Hector |
author2_role |
author author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas Scheduling ARTIFICIAL INTELLIGENCE Multiplicity of parents crossovers |
topic |
Ciencias Informáticas Scheduling ARTIFICIAL INTELLIGENCE Multiplicity of parents crossovers |
dc.description.none.fl_txt_mv |
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 (Reeves). New trends to enhance evolutionary algorithms for solving the FSSP introduced multiple-crossovers-per couple (MCPC) and multiple-crossovers-on-multiple-parents (MCMP). MCMP-S, a multiple-crossovers-on-multiple-parents variant, selects the stud (breeding individual) among the multiple intervening parents and mates it, more than once, with every other parent in a multiple crossover operation. In previous works, two versions of MCMP-S were faced. In the first one (MCMP-SOP), the stud and every other parent were selected from the old population. In the second one (MCMP-SRI), the stud was selected from the old population, and the other parents (random immigrants) were generated randomly. This paper introduces MCMP-NEH. The idea is to use the NEH heuristic, where the stud mates individuals in the mating pool coming from two sources: random immigrants and NEH-based individuals. These NEH-individuals are produced from randomly chosen individuals of the population and used as the starting points of the NEH heuristic. Experiments were conducted to contrast this novel proposal with a conventional evolutionary algorithm, with the only objective of establishing the improvement degree despite computational effort. Implementation details and a comparison of results for a set of flow shop scheduling instances of distinct complexity, using every evolutionary approach, are shown. Eje: Sistemas inteligentes Red de Universidades con Carreras en Informática (RedUNCI) |
description |
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 (Reeves). New trends to enhance evolutionary algorithms for solving the FSSP introduced multiple-crossovers-per couple (MCPC) and multiple-crossovers-on-multiple-parents (MCMP). MCMP-S, a multiple-crossovers-on-multiple-parents variant, selects the stud (breeding individual) among the multiple intervening parents and mates it, more than once, with every other parent in a multiple crossover operation. In previous works, two versions of MCMP-S were faced. In the first one (MCMP-SOP), the stud and every other parent were selected from the old population. In the second one (MCMP-SRI), the stud was selected from the old population, and the other parents (random immigrants) were generated randomly. This paper introduces MCMP-NEH. The idea is to use the NEH heuristic, where the stud mates individuals in the mating pool coming from two sources: random immigrants and NEH-based individuals. These NEH-individuals are produced from randomly chosen individuals of the population and used as the starting points of the NEH heuristic. Experiments were conducted to contrast this novel proposal with a conventional evolutionary algorithm, with the only objective of establishing the improvement degree despite computational effort. Implementation details and a comparison of results for a set of flow shop scheduling instances of distinct complexity, using every evolutionary approach, are shown. |
publishDate |
2001 |
dc.date.none.fl_str_mv |
2001-10 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/23405 |
url |
http://sedici.unlp.edu.ar/handle/10915/23405 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1842260121120407552 |
score |
13.13397 |