Design and analysis of asymptotic probabilistic genetic algorithm

MaRDI QIDQ4966375zbMATH OpenFDO

Authors

Publication date 18 March 2021

Full work available at URL http://mathnet.ru/eng/jsfu218

zbMATH Keywords

genetic algorithmmutationprobability distributionselection

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Recommendations

• An adaptive genetic algorithm for solving a class of combinatorial scheduling problems
• Genetic algorithms used to solve scheduling problems
• Genetic algorithms with groups sampling and directed mutation
• Genetic algorithms: state of the art, problems, and perspectives
• The parallel genetic algorithm as function optimizer

Cited in

(2)

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

This page was built for publication: Design and analysis of asymptotic probabilistic genetic algorithm

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