Finding Representations with Hypervolume Scalarizations - Luis Paquete (Coimbra University)

Abstract

 

In this talk, we discuss the use of hypervolume as a scalarization
method for multiobjective combinatorial optimization problems.  In
particular, we describe a generic solution approach that determines the
nondominated set of a biobjective optimization problem by solving a
sequence of hypervolume scalarizations with appropriate choices of the
reference point.  Moreover, this solution technique also provides a
compact representation of the nondominated set that is a
(1-1/e)-approximation to the optimal representation in terms of the
hypervolume in an a priori manner. We evaluate these concepts on a
particular variant of the biobjective knapsack problem.