Efficiency speed‐up strategies for evolutionary computation: an adaptive implementation
DOI10.1108/02644400210423963zbMATH Open1008.65041OpenAlexW2061690532MaRDI QIDQ4780667FDOQ4780667
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
Recommendations
algorithmsinverse problemimage compressionfractal encodingevolution programmingsafe adaptive genetic algorithmssplicing composable encoding scheme
Numerical mathematical programming methods (65K05) Learning and adaptive systems in artificial intelligence (68T05) Nonlinear programming (90C30)
Cites Work
Cited In (6)
- Efficiency speed-up strategies for evolutionary computation: fundamentals and fast-GAs.
- Do additional optima speed up evolutionary algorithms?
- New adaptive genetic algorithm
- Accelerating adaptive trade-off model using shrinking space technique for constrained evolutionary optimization
- Evolution strategies with exclusion-based selection operators and a Fourier series auxiliary function
- 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)