Variable solution structure can be helpful in evolutionary optimization
From MaRDI portal
Publication:5046487
DOI10.1007/s11432-015-5382-yzbMath1497.94050OpenAlexW2254149083MaRDI QIDQ5046487
Zhi-Hua Zhou, Yang Yu, Chao Qian
Publication date: 28 October 2022
Published in: Science China Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11432-015-5382-y
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analysis on recombination in multi-objective evolutionary optimization
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Minimum spanning trees made easier via multi-objective optimization
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- On the analysis of the \((1+1)\) evolutionary algorithm
- Multiplicative drift analysis
- Unordered rule discovery using ant colony optimization
- A new approach to estimating the expected first hitting time of evolutionary algorithms
- Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
- Single- and multi-objective genetic programming
- Drift analysis and average time complexity of evolutionary algorithms
This page was built for publication: Variable solution structure can be helpful in evolutionary optimization