A fast genetic algorithm operator for solving complex optimization problems

DOI10.13413/J.CNKI.JDXBLXB.2020305MaRDI QIDQ5017047zbMATH OpenFDO

Authors Ying Pei, Shan Su, Jiasheng Fu, Xiaosong Han

Publication date 17 December 2021

Full work available at URL https://doi.org/10.13413/J.CNKI.JDXBLXB.2020305

zbMATH Keywords

aggregation operatorcomplex problemsfast convergencegenetic algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A fast genetic algorithm and its convergence
• scientific article; zbMATH DE number 7403911
• A novel genetic algorithm for global optimization
• A novel genetic algorithm for solving constrained optimization problems
• scientific article; zbMATH DE number 5671191

Cited in

(6)

• Genetic algorithms and very fast simulated reannealing: A comparison
• On genetic operators for unconstrained optimization problems
• scientific article; zbMATH DE number 7403911 (Why is no real title available?)
• A fast genetic algorithm and its convergence
• scientific article; zbMATH DE number 6177874 (Why is no real title available?)
• Fast annealing genetic algorithm for multi-objective optimization problems

This page was built for publication: A fast genetic algorithm operator for solving complex optimization problems

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