Finding all minimal elements of a finite partially ordered set by genetic algorithm with a prescribed probability

DOI10.3934/NACO.2011.1.389MaRDI QIDQ428481zbMATH OpenOpenAlexFDO

Authors Marcin Studniarski

Publication date 22 June 2012

Published in Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/naco.2011.1.389

zbMATH Keywords

Markov chaingenetic algorithmsstopping criteria

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Multi-objective and goal programming (90C29)

Recommendations

• Finite-time performance analysis for genetic algorithms
• Modeling genetic algorithms with Markov chains.
• Multistage Markov chain modeling of the genetic algorithm and convergence results
• A Markov chain that models genetic algorithms in noisy environments
• The unified method analyzing convergence of genetic algorithms

Cited in

(1)

• scientific article; zbMATH DE number 5061975 (Why is no real title available?)

This page was built for publication: Finding all minimal elements of a finite partially ordered set by genetic algorithm with a prescribed probability

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