Evaluation of nondominated solution sets for k-objective optimization problems: An exact method and approximations

Evaluation of nondominated solution sets for k-objective optimization problems: An exact method and approximations

0.00 Avg rating0 Votes
Article ID: iaor20084152
Country: Netherlands
Volume: 173
Issue: 2
Start Page Number: 565
End Page Number: 582
Publication Date: Sep 2006
Journal: European Journal of Operational Research
Authors: , , , ,
Keywords: heuristics
Abstract:

Integrated Preference Functional (IPF) is a set functional that, given a discrete set of points for a multiple objective optimization problem, assigns a numerical value to that point set. This value provides a quantitative measure for comparing different sets of points generated by solution procedures for difficult multiple objective optimization problems. We introduced the IPF for bi-criteria optimization problems in Carlyle et al. As indicated in that paper, the computational effort to obtain IPF is negligible for bi-criteria problems. For three or more objective function cases, however, the exact calculation of IPF is computationally demanding, since this requires k(⩾3) dimensional integration. In this paper, we suggest a theoretical framework for obtaining IPF for k(⩾3) objectives. The exact method includes solving two main sub-problems: (1) finding the optimality region of weights for all potentially optimal points, and (2) computing volumes of k dimensional convex polytopes. Several different algorithms for both sub-problems can be found in the literature. We use existing methods from computational geometry (i.e., triangulation and convex hull algorithms) to develop a reasonable exact method for obtaining IPF. We have also experimented with a Monte Carlo approximation method and compared the results to those with the exact IPF method.

Reviews

Required fields are marked *. Your email address will not be published.