A reference point-based evolutionary algorithm for approximating regions of interest in multiobjective problems

• E. Filatovas ^[1] ; O. Kurasova ^[1] ; J.L. Redondo ^[2] ; J. Fernández ^[3]
  1. [1] Vilnius University

     Vilnius University

     Lituania

     
  2. [2] Universidad de Almería

     Universidad de Almería

     Almería, España

     
  3. [3] Universidad de Murcia

     Universidad de Murcia

     Murcia, España

     

  Mostrar afiliaciones +
• Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 28, Nº. 2, 2020, págs. 402-423
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • Most evolutionary multiobjective optimization algorithms are designed to approximate the entire Pareto front. During the last decade, a series of preference-based evolutionary algorithms have been developed, where a part of the Pareto front is approximated by incorporating the preferences of a Decision Maker. However, only a few such algorithms are able to obtain well-distributed solutions covering the complete “region of interest” that is determined by a reference point. In this paper, a preference-based evolutionary algorithm for approximating the region of interest is proposed. It is based on the state-of-the-art genetic algorithm NSGA-II and the CHIM approach introduced in the NBI method which is used to obtain uniformly distributed solutions in the region of interest. The efficiency of the proposed algorithm has been experimentally evaluated and compared to other state-of-the-art multiobjective preference-based evolutionary algorithms by solving a set of multiobjective optimization benchmark problems. It has been shown that the incorporation of the Decision Maker’s preferences and the CHIM approach into the NSGA-II algorithm allows approximating the whole region of interest accurately while maintaining a good distribution of the obtained solutions.