Affiliations: [1] Institute of Informatics and Mathematics, Vilnius University, Akademijos 4, LT-08663 Vilnius, Lithuania
| [2] Department of Mathematical Information Technology, University of Jyvaskyla, P.O. Box 35, FI-40014 University of Jyvaskyla, Finland. E-mails: [email protected], [email protected], [email protected]
Correspondence:
[*]
Corresponding author.
Abstract: Classical evolutionary multi-objective optimization algorithms aim at finding an approximation of the entire set of Pareto optimal solutions. By considering the preferences of a decision maker within evolutionary multi-objective optimization algorithms, it is possible to focus the search only on those parts of the Pareto front that satisfy his/her preferences. In this paper, an extended preference-based evolutionary algorithm has been proposed for solving multi-objective optimization problems. Here, concepts from an interactive synchronous NIMBUS method are borrowed and combined with the R-NSGA-II algorithm. The proposed synchronous R-NSGA-II algorithm uses preference information provided by the decision maker to find only desirable solutions satisfying his/her preferences on the Pareto front. Several scalarizing functions are used simultaneously so the several sets of solutions are obtained from the same preference information. In this paper, the experimental-comparative investigation of the proposed synchronous R-NSGA-II and original R-NSGA-II has been carried out. The results obtained are promising.
