Cellular memetic algorithms

Autores
Alba Torres, Enrique; Dorronsoro, Bernabé; Alfonso, Hugo
Año de publicación
2005
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
This work is focussed on the development and analysis of a new class of algorithms, called cellular memetic algorithms (cMAs), which will be evaluated here on the satisfiability problem (SAT). For describing a cMA, we study the effects of adding specific knowledge of the problem to the fitness function, the crossover and mutation operators, and to the local search step in a canonical cellular genetic algorithm (cGA). Hence, the proposed cMAs are the result of including these hybridization techniques in different structural ways into a canonical cGA. We conclude that the performance of the cGA is largely improved by these hybrid extensions. The accuracy and efficiency of the resulting cMAs are even better than those of the best existing heuristics for SAT in many cases.
Facultad de Informática
Materia
Ciencias Informáticas
SAT problem
Algorithms
cellular evolutionary algorithms; memetic algorithms; SAT problem
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc/3.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/9602
Acceder
id SEDICI_f6c97c84d7df61e3da3653130db48105
oai_identifier_str oai:sedici.unlp.edu.ar:10915/9602
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Cellular memetic algorithmsAlba Torres, EnriqueDorronsoro, BernabéAlfonso, HugoCiencias InformáticasSAT problemAlgorithmscellular evolutionary algorithms; memetic algorithms; SAT problemThis work is focussed on the development and analysis of a new class of algorithms, called cellular memetic algorithms (cMAs), which will be evaluated here on the satisfiability problem (SAT). For describing a cMA, we study the effects of adding specific knowledge of the problem to the fitness function, the crossover and mutation operators, and to the local search step in a canonical cellular genetic algorithm (cGA). Hence, the proposed cMAs are the result of including these hybridization techniques in different structural ways into a canonical cGA. We conclude that the performance of the cGA is largely improved by these hybrid extensions. The accuracy and efficiency of the resulting cMAs are even better than those of the best existing heuristics for SAT in many cases.Facultad de Informática2005-12info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf257-263http://sedici.unlp.edu.ar/handle/10915/9602enginfo:eu-repo/semantics/altIdentifier/url/http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Dec05-15.pdfinfo:eu-repo/semantics/altIdentifier/issn/1666-6038info: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-09-03T10:23:35Zoai:sedici.unlp.edu.ar:10915/9602Institucionalhttp://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:23:35.395SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Cellular memetic algorithms
title Cellular memetic algorithms
spellingShingle Cellular memetic algorithms
Alba Torres, Enrique
Ciencias Informáticas
SAT problem
Algorithms
cellular evolutionary algorithms; memetic algorithms; SAT problem
title_short Cellular memetic algorithms
title_full Cellular memetic algorithms
title_fullStr Cellular memetic algorithms
title_full_unstemmed Cellular memetic algorithms
title_sort Cellular memetic algorithms
dc.creator.none.fl_str_mv Alba Torres, Enrique
Dorronsoro, Bernabé
Alfonso, Hugo
author Alba Torres, Enrique
author_facet Alba Torres, Enrique
Dorronsoro, Bernabé
Alfonso, Hugo
author_role author
author2 Dorronsoro, Bernabé
Alfonso, Hugo
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
SAT problem
Algorithms
cellular evolutionary algorithms; memetic algorithms; SAT problem
topic Ciencias Informáticas
SAT problem
Algorithms
cellular evolutionary algorithms; memetic algorithms; SAT problem
dc.description.none.fl_txt_mv This work is focussed on the development and analysis of a new class of algorithms, called cellular memetic algorithms (cMAs), which will be evaluated here on the satisfiability problem (SAT). For describing a cMA, we study the effects of adding specific knowledge of the problem to the fitness function, the crossover and mutation operators, and to the local search step in a canonical cellular genetic algorithm (cGA). Hence, the proposed cMAs are the result of including these hybridization techniques in different structural ways into a canonical cGA. We conclude that the performance of the cGA is largely improved by these hybrid extensions. The accuracy and efficiency of the resulting cMAs are even better than those of the best existing heuristics for SAT in many cases.
Facultad de Informática
description This work is focussed on the development and analysis of a new class of algorithms, called cellular memetic algorithms (cMAs), which will be evaluated here on the satisfiability problem (SAT). For describing a cMA, we study the effects of adding specific knowledge of the problem to the fitness function, the crossover and mutation operators, and to the local search step in a canonical cellular genetic algorithm (cGA). Hence, the proposed cMAs are the result of including these hybridization techniques in different structural ways into a canonical cGA. We conclude that the performance of the cGA is largely improved by these hybrid extensions. The accuracy and efficiency of the resulting cMAs are even better than those of the best existing heuristics for SAT in many cases.
publishDate 2005
dc.date.none.fl_str_mv 2005-12
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/9602
url http://sedici.unlp.edu.ar/handle/10915/9602
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/JCST-Dec05-15.pdf
info:eu-repo/semantics/altIdentifier/issn/1666-6038
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
257-263
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_ 1842260060916416512
score 13.13397

Publicaciones similares