Abstract
Diversity problems are usually studied from a single-objective point of view. However, two or more diversity functions could present opposite or divergent behavior, which requires a multi-objective point of view. To illustrate this kind of problems, this chapter presents the study of the bi-objective diversity problem (BODP), which considers the MaxSum and the MaxMin as objective functions to simultaneously maximize. Six different multi-objective algorithms have been described, analyzing their results on six performance metrics using a subset of instances from the MDPLIB 2.0 library.
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Nature
Date
Description
Diversity problems are usually studied from a single-objective point of view. However, two or more diversity functions could present opposite or divergent behavior, which requires a multi-objective point of view. To illustrate this kind of problems, this chapter presents the study of the bi-objective diversity problem (BODP), which considers the MaxSum and the MaxMin as objective functions to simultaneously maximize. Six different multi-objective algorithms have been described, analyzing their results on six performance metrics using a subset of instances from the MDPLIB 2.0 library.



