Applied Mathematics and Computation
The performance of cooperative processes
CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
An overview of evolutionary algorithms in multiobjective optimization
Evolutionary Computation
| Hi-index | 0.00 |
The majority of approaches for finding best compromise solutions to multiobjective optimization problems (MOP) make use of the Pareto optimality concept. However, in modeling real world problems, we often encounter MOP with large Pareto optimal alternatives to choose from. This paper introduces the concept of a-efficiency, which provides a notion that is stronger than Pareto optimality and allows setting up a preference ordering amongst various alternatives that are Pareto optimal. If the user still has to process quite a large number of alternatives, we propose to arrange them using an interactive approach based on a plurality voting procedure. This interactive procedure is based on a binary preference relation to rank the solutions set. However, for more flexibility this interactive procedure is extended exploiting fuzzy preference relation.