Transactions of the Institute of Systems, Control and Information Engineers
Online ISSN : 2185-811X
Print ISSN : 1342-5668
Proposal of Approximating Hypervolume by Scalarizing Functions for Evolutionary Many-Objective Optimization
Noritaka TsukamotoYuji SakaneYusuke NojimaHisao Ishibuchi
Author information

2009 Volume 22 Issue 11 Pages 385-395


Hypervolume is one of the most frequently-used and well-known performance measures to compare the performance of the obtained solution sets by evolutionary multiobjective optimization (EMO) algorithms. Hypervolume is used to evaluate both the convergence of solutions to the Pareto front and their diversity. The main difficulty in the use of the hypervolume is that the computation load for its calculation increases exponentially with the number of objectives. In this paper, we propose an idea of approximating the hypervolume of an obtained non-dominated solution set using a number of achievement scalarizing functions with uniformly distributed weight vectors. We use each scalarizing function to measure the distance from the reference point of the hypervolume to the attainment surface of the obtained non-dominated solution set along its own search direction. We examine the effect of the number of weight vectors on the approximation accuracy and the computation load. Through computational experiments, we show that the approximation accuracy is improved by increasing the number of weight vectors. We also show that our idea needs much less computational load than the existing hypervolume calculation for many-objective problems.

Information related to the author
© 2009 The Institute of Systems, Control and Information Engineers
Previous article Next article