A fast genetic algorithm and its convergence

MaRDI QIDQ3571396zbMATH OpenFDO

Authors Yongjie Ma, Yide Ma, Zhaoyuan Jiang, Qiguo Sun

Publication date 8 July 2010

zbMATH Keywords

constrained optimizationconvergencegenetic algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A novel genetic algorithm for global optimization
• Genetic algorithm and its convergence based on quasi-descent method
• Global annealing genetic algorithm and its convergence analysis
• A new genetic algorithm
• A fast genetic algorithm operator for solving complex optimization problems

Cited in

(12)

• Genetic algorithms and very fast simulated reannealing: A comparison
• Genetic algorithms: Bridging the convergence gap
• A novel genetic algorithm for global optimization
• A greedy genetic algorithm for unconstrained global optimization
• Accelerated genetic programming of polynomials
• A study on a new mutation operator that can find global optima
• scientific article; zbMATH DE number 2044653 (Why is no real title available?)
• scientific article; zbMATH DE number 2112348 (Why is no real title available?)
• A fast genetic algorithm operator for solving complex optimization problems
• Fast annealing genetic algorithm for multi-objective optimization problems
• Genetic algorithm and its convergence based on quasi-descent method
• scientific article; zbMATH DE number 6469919 (Why is no real title available?)

This page was built for publication: A fast genetic algorithm and its convergence

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