Extending particle swarm optimisers with self-organized criticality
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
An overview of evolutionary algorithms in multiobjective optimization
Evolutionary Computation
Integrating user preferences with particle swarms for multi-objective optimization
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Consideration of Partial User Preferences in Evolutionary Multiobjective Optimization
Multiobjective Optimization
Interactive Multiobjective Evolutionary Algorithms
Multiobjective Optimization
EMOPSO: a multi-objective particle swarm optimizer with emphasis on efficiency
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
About selecting the personal best in multi-objective particle swarm optimization
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
A MOPSO algorithm based exclusively on pareto dominance concepts
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Improving PSO-Based multi-objective optimization using crowding, mutation and ∈-dominance
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Self-organized invasive parallel optimization
Proceedings of the 3rd workshop on Biologically inspired algorithms for distributed systems
Hi-index | 0.00 |
The integration of experts' preferences is an important aspect in multi-objective optimization. Usually, one out of a set of Pareto optimal solutions has to be chosen based on expert knowledge. A combination of multi-objective particle swarm optimization (MOPSO) with the desirability concept is introduced to efficiently focus on desired and relevant regions of the true Pareto front of the optimization problem which facilitates the solution selection process. Desirability functions of the objectives are optimized, and the desirability index is used for selecting the global best particle in each iteration. The resulting MOPSO variant DF-MOPSO in most cases exclusively generates solutions in the desired area of the Pareto front. Approximations of the whole Pareto front result in cases of misspecified desired regions.