On the Normal Boundary Intersection Method for Generation of Efficient Front

Authors:
Pradyumn Kumar Shukla
Affiliations:
Institute of Numerical Mathematics, Department of Mathematics, Dresden University of Technology Dresden PIN 01069, Germany
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Year:
2007

Citing 3
Cited 3

Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems

SIAM Journal on Optimization
Multicriteria Optimization

Multicriteria Optimization

In search of equitable solutions using multi-objective evolutionary algorithms

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Towards a deeper understanding of trade-offs using multi-objective evolutionary algorithms

EvoApplications'12 Proceedings of the 2012t European conference on Applications of Evolutionary Computation
A new method to obtain fuzzy Pareto set of fuzzy multi-criteria optimization problems

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with the problem of finding a representative sample of Pareto-optimal points in multi-objective optimization. The Normal Boundary Intersection algorithm is a scalarization scheme for generating a set of evenly spaced Efficient solutions. A drawback of this algorithm is that Pareto-optimality of solutions is not guaranteed. The contributions of this paper are two-fold. First, it presents alternate formulation of this algorithms, such that (weak) Pareto-optimality of solutions is guaranteed. This improvement makes these algorithm theoretically equivalent to other classical algorithms (like weighted-sum or 驴-constraint methods), without losing its ability to generate a set of evenly spaced Efficient solutions. Second, an algorithm is presented so as to know beforehand about certain sub-problems whose solutions are not Pareto-optimal and thus not wasting computational effort to solve them. The relationship of the new algorithm with weighted-sum and goal programming method is also presented.