Self adaptation of parameters for MCPC in genetic algorithms
- Autores
- Esquivel, Susana Cecilia; Leiva, Héctor Ariel; Gallard, Raúl Hector
- Año de publicación
- 2000
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- As a new promising crossover method, multiple crossovers per couple (MCPC) deserves special attention in evolutionary computing field. Allowing multiple crossovers per couple on a selected pair of parents provided an extra benefit in processing time and similar quality of solutions when contrasted against the conventional single crossover per couple approach (SCPC). These results, were confirmed when optimising classic testing functions and harder (non-linear, non-separable) functions. Despite these benefits, due to a reinforcement of selective pressure, MCPC showed in some cases an undesirable premature convergence effect. In order to face this problem, the present paper attempts to control the number of crossovers, and offspring, allowed to the mating pair in a self-adaptive manner. Self-adaptation of parameters is a central feature of evolutionary strategies, another class of algorithms, which simultaneously apply evolutionary principles on the search space of object variables and on strategy parameters. In other words, parameter values are also submitted to the evolutionary process. This approach can be also applied to genetic algorithms. In the case of MCPC, the number of crossovers allowed to a selected couple is a key parameter and consequently self-adaptation is achieved by adding to the chromosome structure -labels- describing the number of crossover allowed to each individual. Labels, which are bit strings, also undergo crossover and mutation and consequently evolve together with the individual. During the stages of the evolution process, it is expected that the algorithm will return the number of crossovers for which the current population exhibits a better behaviour.
Facultad de Informática - Materia
-
Ciencias Informáticas
genetic algorithms; self-adaptation; crossover; function optimisation
Algoritmos evolutivos
Optimización
Informática - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc/3.0/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/9385
Ver los metadatos del registro completo
id |
SEDICI_0ce1fc40608435975ab9d7f2591ac3f9 |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/9385 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
Self adaptation of parameters for MCPC in genetic algorithmsEsquivel, Susana CeciliaLeiva, Héctor ArielGallard, Raúl HectorCiencias Informáticasgenetic algorithms; self-adaptation; crossover; function optimisationAlgoritmos evolutivosOptimizaciónInformáticaAs a new promising crossover method, multiple crossovers per couple (MCPC) deserves special attention in evolutionary computing field. Allowing multiple crossovers per couple on a selected pair of parents provided an extra benefit in processing time and similar quality of solutions when contrasted against the conventional single crossover per couple approach (SCPC). These results, were confirmed when optimising classic testing functions and harder (non-linear, non-separable) functions. Despite these benefits, due to a reinforcement of selective pressure, MCPC showed in some cases an undesirable premature convergence effect. In order to face this problem, the present paper attempts to control the number of crossovers, and offspring, allowed to the mating pair in a self-adaptive manner. Self-adaptation of parameters is a central feature of evolutionary strategies, another class of algorithms, which simultaneously apply evolutionary principles on the search space of object variables and on strategy parameters. In other words, parameter values are also submitted to the evolutionary process. This approach can be also applied to genetic algorithms. In the case of MCPC, the number of crossovers allowed to a selected couple is a key parameter and consequently self-adaptation is achieved by adding to the chromosome structure -labels- describing the number of crossover allowed to each individual. Labels, which are bit strings, also undergo crossover and mutation and consequently evolve together with the individual. During the stages of the evolution process, it is expected that the algorithm will return the number of crossovers for which the current population exhibits a better behaviour.Facultad de Informática2000info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/9385enginfo:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/2015/papers_02/self.pdfinfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc/3.0/Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-15T10:43:16Zoai:sedici.unlp.edu.ar:10915/9385Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 10:43:16.854SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
Self adaptation of parameters for MCPC in genetic algorithms |
title |
Self adaptation of parameters for MCPC in genetic algorithms |
spellingShingle |
Self adaptation of parameters for MCPC in genetic algorithms Esquivel, Susana Cecilia Ciencias Informáticas genetic algorithms; self-adaptation; crossover; function optimisation Algoritmos evolutivos Optimización Informática |
title_short |
Self adaptation of parameters for MCPC in genetic algorithms |
title_full |
Self adaptation of parameters for MCPC in genetic algorithms |
title_fullStr |
Self adaptation of parameters for MCPC in genetic algorithms |
title_full_unstemmed |
Self adaptation of parameters for MCPC in genetic algorithms |
title_sort |
Self adaptation of parameters for MCPC in genetic algorithms |
dc.creator.none.fl_str_mv |
Esquivel, Susana Cecilia Leiva, Héctor Ariel Gallard, Raúl Hector |
author |
Esquivel, Susana Cecilia |
author_facet |
Esquivel, Susana Cecilia Leiva, Héctor Ariel Gallard, Raúl Hector |
author_role |
author |
author2 |
Leiva, Héctor Ariel Gallard, Raúl Hector |
author2_role |
author author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas genetic algorithms; self-adaptation; crossover; function optimisation Algoritmos evolutivos Optimización Informática |
topic |
Ciencias Informáticas genetic algorithms; self-adaptation; crossover; function optimisation Algoritmos evolutivos Optimización Informática |
dc.description.none.fl_txt_mv |
As a new promising crossover method, multiple crossovers per couple (MCPC) deserves special attention in evolutionary computing field. Allowing multiple crossovers per couple on a selected pair of parents provided an extra benefit in processing time and similar quality of solutions when contrasted against the conventional single crossover per couple approach (SCPC). These results, were confirmed when optimising classic testing functions and harder (non-linear, non-separable) functions. Despite these benefits, due to a reinforcement of selective pressure, MCPC showed in some cases an undesirable premature convergence effect. In order to face this problem, the present paper attempts to control the number of crossovers, and offspring, allowed to the mating pair in a self-adaptive manner. Self-adaptation of parameters is a central feature of evolutionary strategies, another class of algorithms, which simultaneously apply evolutionary principles on the search space of object variables and on strategy parameters. In other words, parameter values are also submitted to the evolutionary process. This approach can be also applied to genetic algorithms. In the case of MCPC, the number of crossovers allowed to a selected couple is a key parameter and consequently self-adaptation is achieved by adding to the chromosome structure -labels- describing the number of crossover allowed to each individual. Labels, which are bit strings, also undergo crossover and mutation and consequently evolve together with the individual. During the stages of the evolution process, it is expected that the algorithm will return the number of crossovers for which the current population exhibits a better behaviour. Facultad de Informática |
description |
As a new promising crossover method, multiple crossovers per couple (MCPC) deserves special attention in evolutionary computing field. Allowing multiple crossovers per couple on a selected pair of parents provided an extra benefit in processing time and similar quality of solutions when contrasted against the conventional single crossover per couple approach (SCPC). These results, were confirmed when optimising classic testing functions and harder (non-linear, non-separable) functions. Despite these benefits, due to a reinforcement of selective pressure, MCPC showed in some cases an undesirable premature convergence effect. In order to face this problem, the present paper attempts to control the number of crossovers, and offspring, allowed to the mating pair in a self-adaptive manner. Self-adaptation of parameters is a central feature of evolutionary strategies, another class of algorithms, which simultaneously apply evolutionary principles on the search space of object variables and on strategy parameters. In other words, parameter values are also submitted to the evolutionary process. This approach can be also applied to genetic algorithms. In the case of MCPC, the number of crossovers allowed to a selected couple is a key parameter and consequently self-adaptation is achieved by adding to the chromosome structure -labels- describing the number of crossover allowed to each individual. Labels, which are bit strings, also undergo crossover and mutation and consequently evolve together with the individual. During the stages of the evolution process, it is expected that the algorithm will return the number of crossovers for which the current population exhibits a better behaviour. |
publishDate |
2000 |
dc.date.none.fl_str_mv |
2000 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion Articulo http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/9385 |
url |
http://sedici.unlp.edu.ar/handle/10915/9385 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/2015/papers_02/self.pdf |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc/3.0/ Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc/3.0/ Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) |
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_ |
1846063846932873216 |
score |
13.22299 |