A fast Pareto genetic algorithm approach for solving expensive multiobjective optimization problems
From MaRDI portal
Publication:953285
DOI10.1007/s10732-007-9037-zzbMath1211.90207OpenAlexW2077345861MaRDI QIDQ953285
Hamidreza Eskandari, Christopher D. Geiger
Publication date: 17 November 2008
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-007-9037-z
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Increasing selective pressure towards the best compromise in evolutionary multiobjective optimization: the extended NOSGA method ⋮ Analyzing the performance of a two-tail-measures-utility multi-objective portfolio optimization model ⋮ A data mining approach to evolutionary optimisation of noisy multi-objective problems ⋮ Evolutionary multiobjective optimization in noisy problem environments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tackling real-coded genetic algorithms: operators and tools for behavioural analysis
- Global multiobjective optimization using evolutionary algorithms
- Multi-objective tabu search using a multinomial probability mass function
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Applications of Multi-Objective Evolutionary Algorithms
This page was built for publication: A fast Pareto genetic algorithm approach for solving expensive multiobjective optimization problems