A self-adaptive recombination method in evolutionary algorithms for solving epistatic problems

There are many different forms of recombination operators available in literature. However, it is difficult to determine a priori which one is the best suited for a given problem. This issue encourages us to propose an adaptive evolutionary algorithm to solve the NK landscape problem, which dynamica...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Stark, Natalia, Salto, Carolina
Formato:	Objeto de conferencia
Lenguaje:	Inglés
Publicado:	2011
Materias:	Ciencias Informáticas Algorithms recombination operator; evolutionary algorithm; epistatic problems
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/18571
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

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

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

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)

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

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

An analysis on selection methods and multirecombination in evolutionary search when solving the job shop scheduling problem
por: Stark, Natalia, et al.
Publicado: (2002)

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

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

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)

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

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

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

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

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

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

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

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

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)

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

A comparison of recombination operators for capacitate vehicle routing problem
por: Graglia, Patricia, et al.
Publicado: (2008)

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

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

A comparison of different recombination operators for the 2-dimensional strip packing problem
por: Salto, Carolina
Publicado: (2006)

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

A criteria to select genetic operators for solving CSP
por: Riff Rojas, María Cristina
Publicado: (2000)

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

A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
por: Minetti, Gabriela F., et al.
Publicado: (2000)

Solving Order Batching/Picking Problems with an Evolutionary Algorithm
por: Miguel, Fabio Maximiliano, et al.
Publicado: (2021)

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

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

Improving Artificial Bee Colony Algorithm with Evolutionary Operators
por: Minetti, Gabriela F., et al.
Publicado: (2017)

Multiobjective evolutionary algorithms for job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001)

Parameter control in multirecombinated evolutionary algorithms for the flow shop scheduling problem
por: Vilanova, Gabriela, et al.
Publicado: (2001)

Evolutionary algorithms to face computer systems management problems
por: Gallard, Raúl Hector, et al.
Publicado: (2000)

The optimal routing problem in multicomputer networks: an evolutionary approach
por: Hernández, José Luis, et al.
Publicado: (1998)

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

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

Multirecombination and different representation in evolutionary algorithms for the flow shop scheduling problem
por: Bain, María Elena, et al.
Publicado: (2000)

Evolutionary-statistical system for uncertainty reduction problems in wildfires
por: BIanchini, Germán, et al.
Publicado: (2012)