Cellular memetic algorithms

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 funct...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Alba Torres, Enrique, Dorronsoro, Bernabé, Alfonso, Hugo
Formato:	Articulo
Lenguaje:	Inglés
Publicado:	2005
Materias:	Ciencias Informáticas SAT problem Algorithms cellular evolutionary algorithms; memetic algorithms; SAT problem
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/9602 http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Dec05-15.pdf
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Cellular memetic algorithms evaluated on SAT
por: Alba Torres, Enrique, et al.
Publicado: (2005)

A runnable functional formal memetic algorithm framework
por: Krasnogor, Natalio, et al.
Publicado: (1998)

A parallel spatial quantum search algorithm applied to the 3-SAT problem
por: Hernández Barreto, Miguel A., et al.
Publicado: (2011)

A self-adaptive recombination method in evolutionary algorithms for solving epistatic problems
por: Stark, Natalia, et al.
Publicado: (2011)

Biclustering in data mining using a memetic multi-objective evolutionary algorithm
por: Gallo, Cristian Andrés, et al.
Publicado: (2008)

Hybrid evolutionary algorithms to solve scheduling problems
por: Minetti, Gabriela F., et al.
Publicado: (2002)

Studs and immigrants in multirecombined evolutionary algorithm to face weighted tardiness scheduling problems
por: Pandolfi, Daniel, et al.
Publicado: (2001)

Evolutionary algorithms to solve the school timetabling problem
por: Fernandez, Natalia, et al.
Publicado: (2002)

An efficient evolutionary algorithm for the deadline problem in project management
por: Galnare, Matías, et al.
Publicado: (2012)

Adding problem-specific knowledge in evolutionary algorithms to solve W-T scheduling problems
por: San Pedro, María Eugenia de, et al.
Publicado: (2002)

Solving the two dimensional cutting problem using evolutionary algorithms with penalty functions
por: Beraudo, Vanina, et al.
Publicado: (2005)

Evolutionary algorithm for state encoding
por: Skliarova, Iouliia, et al.
Publicado: (2006)

Solving the single machine scheduling problem with sequence-dependent set-up times as a TSP via evolutionary algorithms
por: Minetti, Gabriela F., et al.
Publicado: (2001)

Facing the job shop scheduling problem wih hybrid evolutionary algorithms
por: Salto, Carolina, et al.
Publicado: (2001)

A parallel search algorithm for the SAT
por: Gil Costa, Graciela Verónica, et al.
Publicado: (2005)

Evolutionary algorithms whit studs and random immigrants to solve E/T scheduling problems
por: San Pedro, María Eugenia de, et al.
Publicado: (2001)

Inserting problem-specific knowledge in multirecombined evolutionary algorithms
por: Pandolfi, Daniel, et al.
Publicado: (2002)

Solving unrestricted parallel machine scheduling problems via evolutionary algorithms
por: Gatica, Claudia Ruth, et al.
Publicado: (2003)

Multirecombining random and seed immigrants in evolutionary algorithms to face the shop scheduling problem
por: Vilanova, Gabriela, et al.
Publicado: (2002)

Algoritmos evolutivos : Estudio de escalabilidad sobre el problema COUNTSAT
por: Alfonso, Hugo, et al.
Publicado: (2004)

Incest prevention and multicore combinated evolutionary algorithms for the job shop scheduling problem
por: Salto, Carolina, et al.
Publicado: (2001)

Algoritmos evolutivos : Estudio de escalabilidad sobre el problema 3-SAT
por: Alfonso, Hugo
Publicado: (2004)

Enhancing evolutionary algorithms through recombination and parallelism
por: Gallard, Raúl Hector, et al.
Publicado: (2001)

Adaptability of multirecombinated evolutionary algorithms to changing common due dates
por: Pandolfi, Daniel, et al.
Publicado: (2001)

A study of genotype and phenotype distributions in hybrid evolutionary algorithms to solve the flow shop scheduling problem
por: Minetti, Gabriela F., et al.
Publicado: (2002)

An immune artificial algorithm for dynamic optimization problems: a case of study
por: Aragón, Victoria S., et al.
Publicado: (2009)

Algorithms for the on-line travelling salesman
por: Ausiello, G., et al.

Algorithms for the on-line travelling salesman
Publicado: (2001)

A comparison of fitness scallng methods in evolutionary algorithms
por: Bertone, E., et al.
Publicado: (1999)

Hybrid evolutionary algorithms for the TSP
por: Minetti, Gabriela F., et al.
Publicado: (2001)

Algorithms to solve the dynamic weighted tardiness problem
por: Lasso, Marta Graciela, et al.
Publicado: (2002)

A randomized algorithm for solving the satisfiability problem
por: Cecchi, Laura
Publicado: (1997)

Multi-PBil: an estimation distribution algorithm applied to multimodal optimization problems
por: Barbosa Filho, Rubens
Publicado: (2006)

El problema de la dispersión máxima en un entorno multi-objetivo
por: Machuca Cabral, Mauricio, et al.
Publicado: (2017)

Studying the parallel task scheduling problem with conventional and evolutionary algorithms
por: Gatica, Claudia Ruth, et al.
Publicado: (2001)

The unsplittable stable marriage problem
por: Dean, Brian C., et al.
Publicado: (2006)

Coupling REPMAC with FDA to solve highly imbalanced classification problems
por: Ahumada, Hernán César, et al.
Publicado: (2008)

Algoritmos específicos distribuidos : Análisis de la frecuencia de migración
por: Alfonso, Hugo, et al.
Publicado: (2006)

Hybridizing multi-inver-over evolutionary algorithms with tabu search for the symmetric TSP
por: Bermúdez, Carlos, et al.
Publicado: (2001)

Incorporating tabu search for local search into evolutionary algorithms to solve the job shop scheduling problem
por: Fernandez, Natalia, et al.
Publicado: (2001)