Single- and multi-objective genetic programming
From MaRDI portal
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Recommendations
- scientific article; zbMATH DE number 1887344
- Using traceless genetic programming for solving multi-objective optimization problems
- A new genetic algorithm for multi-objective optimization
- A species-based genetic algorithm for multiobjective optimization problems
- Omni-optimizer: a generic evolutionary algorithm for single and multi-objective optimization
- scientific article; zbMATH DE number 4108183
- A comparison of genetic representations for multi-objective shortest path problems on multigraphs
- A Genetic Algorithm for the Multiple-Choice Integer Program
- Multi-objective single agent stochastic search in non-dominated sorting genetic algorithm
Cited in
(5)- Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming
- Variable solution structure can be helpful in evolutionary optimization
- Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
- The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time
- scientific article; zbMATH DE number 1700043 (Why is no real title available?)
This page was built for publication: Single- and multi-objective genetic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5276123)
