Nadir Point Estimation Using Evolutionary Approaches: Better Accuracy and Computational Speed Through Focused Search

Estimation of the nadir objective vector representing worst objective function values in the set of Pareto-optimal solutions is an important task, particularly for multi-objective optimization problems having more than two conflicting objectives. Along with the ideal point, nadir point can be used to normalize the objectives so that multi-objective optimization algorithms can be used more reliably. The knowledge of the nadir point is also a pre-requisite to many multiple criteria decision making methodologies. Moreover, nadir point is useful for an aid in interactive methodologies and visualization softwares catered for multi-objective optimization. However, the computation of an exact nadir point for more than two objectives is not an easy matter, simply because the nadir point demands the knowledge of extreme Pareto-optimal solutions. In the past few years, researchers have proposed several nadir point estimation procedures using evolutionary optimization methodologies. In this paper, we review the past studies and reveal an interesting chronicle of events in this direction. To make the estimation procedure computationally faster and more accurate, the methodologies were refined one after the other by mainly focusing on finding smaller and still sufficient subset of Pareto-optimal solutions to facilitate estimating the nadir point. Simulation results on a number of numerical test problems demonstrate better efficacy of the approach which aims to find only the extreme Pareto-optimal points compared to other two approaches.

[1]  R. Benayoun,et al.  Linear programming with multiple objective functions: Step method (stem) , 1971, Math. Program..

[2]  H. P. Benson,et al.  Existence of efficient solutions for vector maximization problems , 1978 .

[3]  Andrzej P. Wierzbicki,et al.  The Use of Reference Objectives in Multiobjective Optimization , 1979 .

[4]  Simon French,et al.  Multiple Criteria Decision Making: Theory and Application , 1981 .

[5]  M. Dessouky,et al.  Estimates of the minimum nondominated criterion values in multiple-criteria decision-making , 1986 .

[6]  Ralph E. Steuer,et al.  Computational experience concerning payoff tables and minimum criterion values over the efficient set , 1988 .

[7]  Ralph E. Steuer,et al.  A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming , 1997, Oper. Res..

[8]  John Buchanan,et al.  A naïve approach for solving MCDM problems: the GUESS method , 1997 .

[9]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[10]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[11]  Matthias Ehrgott,et al.  Computation of ideal and Nadir values and implications for their use in MCDM methods , 2003, Eur. J. Oper. Res..

[12]  A. P. Wierzbicki,et al.  Application of multiple criteria evolutionary algorithms to vector optimisation, decision support and reference point approaches , 2003 .

[13]  Kaisa Miettinen,et al.  Synchronous approach in interactive multiobjective optimization , 2006, Eur. J. Oper. Res..

[14]  Kalyanmoy Deb,et al.  Towards estimating nadir objective vector using evolutionary approaches , 2006, GECCO.

[15]  Kathrin Klamroth,et al.  Integrating Approximation and Interactive Decision Making in Multicriteria Optimization , 2008, Oper. Res..

[16]  K. Deb,et al.  An estimation of nadir objective vector using a: hybrid evolutionary-cum-local-search procedure , 2009 .

[17]  Kalyanmoy Deb,et al.  Solving Bilevel Multi-Objective Optimization Problems Using Evolutionary Algorithms , 2009, EMO.

[18]  R. K. Ursem Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[19]  Kathrin Klamroth,et al.  Pareto navigator for interactive nonlinear multiobjective optimization , 2010, OR Spectr..