Cellular memetic algorithms evaluated on SAT

In this work, we study the behavior of several cellular memetic algorithms (cMAs) when solving the satisfiability problem (SAT). The proposed cMAs are the result of including hybridization techniques in dif- ferent structural ways into a canonical cellular genetic algorithm (cGA). Specifically, we...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Alba Torres, Enrique, Dorronsoro, Bernabé, Alfonso, Hugo
Formato:	Objeto de conferencia
Lenguaje:	Inglés
Publicado:	2005
Materias:	Ciencias Informáticas evolutionary algorithms (EAs) cellular memetic algorithms (cMAs) satisfiability problem (SAT)
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/22955
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

id	I19-R120-10915-22955
record_format	dspace
institution	Universidad Nacional de La Plata
institution_str	I-19
repository_str	R-120
collection	SEDICI (UNLP)
language	Inglés
topic	Ciencias Informáticas evolutionary algorithms (EAs) cellular memetic algorithms (cMAs) satisfiability problem (SAT)
spellingShingle	Ciencias Informáticas evolutionary algorithms (EAs) cellular memetic algorithms (cMAs) satisfiability problem (SAT) Alba Torres, Enrique Dorronsoro, Bernabé Alfonso, Hugo Cellular memetic algorithms evaluated on SAT
topic_facet	Ciencias Informáticas evolutionary algorithms (EAs) cellular memetic algorithms (cMAs) satisfiability problem (SAT)
description	In this work, we study the behavior of several cellular memetic algorithms (cMAs) when solving the satisfiability problem (SAT). The proposed cMAs are the result of including hybridization techniques in dif- ferent structural ways into a canonical cellular genetic algorithm (cGA). Specifically, we hybridize our cGA with problem dependent recombination and mutation operators, as well as with three local search methods. Furthermore, two different policies for applying the local search methods are proposed. An adaptive fitness function (SAW), specifically designed for SAT, has been used for the evaluation of the individuals. Our conclusion is that the performance of the cGA is largely improved by these hybrid extensions. The accuracy and effciency of the resulting cMAs are even better than those of the best existing heuristics for SAT in many cases.
format	Objeto de conferencia Objeto de conferencia
author	Alba Torres, Enrique Dorronsoro, Bernabé Alfonso, Hugo
author_facet	Alba Torres, Enrique Dorronsoro, Bernabé Alfonso, Hugo
author_sort	Alba Torres, Enrique
title	Cellular memetic algorithms evaluated on SAT
title_short	Cellular memetic algorithms evaluated on SAT
title_full	Cellular memetic algorithms evaluated on SAT
title_fullStr	Cellular memetic algorithms evaluated on SAT
title_full_unstemmed	Cellular memetic algorithms evaluated on SAT
title_sort	cellular memetic algorithms evaluated on sat
publishDate	2005
url	http://sedici.unlp.edu.ar/handle/10915/22955
work_keys_str_mv	AT albatorresenrique cellularmemeticalgorithmsevaluatedonsat AT dorronsorobernabe cellularmemeticalgorithmsevaluatedonsat AT alfonsohugo cellularmemeticalgorithmsevaluatedonsat
bdutipo_str	Repositorios
_version_	1764820467936395267

Cellular memetic algorithms evaluated on SAT

Ejemplares similares