Efficiency speed‐up strategies for evolutionary computation: an adaptive implementation

DOI10.1108/02644400210423963MaRDI QIDQ4780667zbMATH OpenOpenAlexFDO

Authors Kwong-Sak Leung, Jianyong Sun, Zongben Xu

Publication date 22 April 2003

Published in Engineering Computations (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1108/02644400210423963

zbMATH Keywords

algorithmsinverse problemimage compressionfractal encodingevolution programmingsafe adaptive genetic algorithmssplicing composable encoding scheme

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Learning and adaptive systems in artificial intelligence (68T05) Nonlinear programming (90C30)

Recommendations

• Efficiency speed-up strategies for evolutionary computation: fundamentals and fast-GAs.
• New adaptive genetic algorithm
• A self-adaptive genetic algorithm based on real-coded
• Speeding up fractal image compression by genetic algorithms
• scientific article; zbMATH DE number 2007892

Cites work

• scientific article; zbMATH DE number 4201672 (Why is no real title available?)
• Iterated function systems and the global construction of fractals

Cited in

(6)

• New adaptive genetic algorithm
• Efficiency speed-up strategies for evolutionary computation: fundamentals and fast-GAs.
• Do additional optima speed up evolutionary algorithms?
• Evolution strategies with exclusion-based selection operators and a Fourier series auxiliary function
• Accelerating adaptive trade-off model using shrinking space technique for constrained evolutionary optimization
• A novel splicing/decomposable binary encoding and its operators for genetic and evolutionary algorithms

This page was built for publication: Efficiency speed‐up strategies for evolutionary computation: an adaptive implementation

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