116 search results - page 6 / 24 » Approximating the Pareto Front of Multi-criteria Optimizatio... |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Multiobjective optimization problems with many local Pareto fronts is a big challenge to evolutionary algorithms. In this paper, two operators, biased initialization and biased cr...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
ASIAMS
2008
IEEE
14 years 1 months ago
2008
IEEE
The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possibl...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This paper proposes a method to use reference points as preferences to guide a particle swarm algorithm to search towards preferred regions of the Pareto front. A decision maker c...