Modeling and analysis of genetic algorithm with tournament selection

DOI10.1007/10721187_6MaRDI QIDQ2722081zbMATH OpenFDO

Authors Anton Valentinovich Eremeev

Publication date 11 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/10721187_6

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Modelling genetic algorithm dynamics
• A genetic algorithm with tournament selection as a local search method
• The dynamical systems model of the simple genetic algorithm
• A solvable model of a hard optimisation problem
• scientific article; zbMATH DE number 1462668

Cited in

(14)

• Does comma selection help to cope with local optima?
• Comparing evolutionary algorithms to the (\(1+1\))-EA
• The dynamical systems model of the simple genetic algorithm
• Modelling genetic algorithm dynamics
• A solvable model of a hard optimisation problem
• scientific article; zbMATH DE number 6117307 (Why is no real title available?)
• scientific article; zbMATH DE number 711300 (Why is no real title available?)
• scientific article; zbMATH DE number 2013536 (Why is no real title available?)
• scientific article; zbMATH DE number 2172799 (Why is no real title available?)
• Experimental results in applying of fine grained tournament selection
• A genetic algorithm with tournament selection as a local search method
• Foundations of Genetic Algorithms
• Analysis and optimization of probabilities of beneficial mutation and crossover recombination in a Hamming space
• On the efficiency of nonelitist evolutionary algorithms in the case of sparsity of the level sets inconsistent with respect to the objective function

This page was built for publication: Modeling and analysis of genetic algorithm with tournament selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2722081)