A study of performance of stochastic universal sampling versus proportional selection on genetic algorithms

Selection mechanisms favour reproduction of better individuals imposing a direction on the search process. According to this it is expected that the effective number of offspring of an individual in the next generation would always agree with the algorithmic sampling frequencies. This does not happe...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Minetti, Gabriela F., Salto, Carolina, Alfonso, Hugo, Gallard, Raúl Hector
Formato:	Objeto de conferencia
Lenguaje:	Inglés
Publicado:	1999
Materias:	Ciencias Informáticas stochastic universal sampling proportional selection genetic algorithms ARTIFICIAL INTELLIGENCE Algorithms
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/22220
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

The analysis of selected algorithms for the stochastic paradigm /
por: Jaoud�e, Abdo Abou
Publicado: (2019)

Multiple crossover per couple and fitness proportional couple selection in genetic algorithms
por: Esquivel, Susana Cecilia, et al.
Publicado: (1997)

Contrasting main selection methods in genetic algorithms
por: Alfonso, Hugo, et al.
Publicado: (1998)

A study of alternative selection mechanisms for multiple cossover per couple in genetic algorithms
por: Esquivel, Susana Cecilia, et al.
Publicado: (1998)

Improving evolutionary algorithms performance by extending incest prevention
por: Alfonso, Hugo, et al.
Publicado: (1998)

A new strategy for adapting the mutation probability in genetic algorithms
por: Stark, Natalia, et al.
Publicado: (2012)

Contrasting termination criteria for genetic algorithms
por: Bermúdez, Carlos, et al.
Publicado: (1999)

Perfomance evaluation of selection methods to solve the job shop scheduling problem
por: Stark, Natalia, et al.
Publicado: (2002)

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

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

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

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

Large deviations for the stationary measure of networks under proportional fair allocations
por: Jonckheere, M., et al.

Large deviations for the stationary measure of networks under proportional fair allocations
Publicado: (2014)

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)

Social networks and genetic algorithms to choose committees with independent members
por: Zamudio, Eduardo, et al.
Publicado: (2016)

New stochastic algorithms for scheduling ads in sponsored search
por: Feuerstein, E., et al.

New stochastic algorithms for scheduling ads in sponsored search
por: Heiber, Pablo Ariel
Publicado: (2007)

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

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

A simple genetic algorithm for a minimal overlapping scheduling problem
por: Olivera, Alfredo, et al.
Publicado: (2004)

MCPC: another approach to crossover in genetic algorithms
por: Esquivel, Susana Cecilia, et al.
Publicado: (1995)

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

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

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

DE-SVMRank: a differential evolution algorithm with a rank-based feature selection process for microarray data classification
por: Apolloni, Javier, et al.
Publicado: (2012)

Two new feature selection algorithms with rough sets theory
por: Caballero, Yailé, et al.
Publicado: (2006)

Alternative strategies for asynchronous migration-controlled schemes in parallel genetic algorithm
por: Ochoa, Claudio, et al.
Publicado: (1999)

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

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

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

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)

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

Proportionality in international law /
por: Newton, Michael A., 1962-, et al.
Publicado: (2014)

Self-adaptation of parameters for MCPC in genetic algorithms
por: Esquivel, Susana Cecilia, et al.
Publicado: (1998)

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

Parallel genetic algorithms for crystal structure prediction: Successes and failures in predicting bicalutamide polymorphs
por: Ferraro, M.B., et al.

Parallel genetic algorithms for crystal structure prediction: Successes and failures in predicting bicalutamide polymorphs
por: Ferraro, Marta Beatriz, et al.
Publicado: (2009)

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