Adaptive Weighted Sum Method for Bi-objective Optimization

This paper presents a new method that effectively determines a Pareto front for biobjective optimization with potential application to multiple objectives. A traditional method for multiobjective optimization is the weighted sum method, which seeks Pareto optimal solutions one by one by systematically changing the weights among the objective functions. Previous research has shown that this method often produces poorly distributed solutions of a Pareto front, and that it does not find Pareto optimal solutions in non-convex regions. The proposed adaptive weighted sum method focuses on unexplored regions by changing the weights adaptively rather than by using a priori weight selections and by specifying additional inequality constraints. It is demonstrated that the adaptive weighted sum method produces well-distributed solutions, finds Pareto optimal solutions in non-convex regions, and neglects non-Pareto optimal solutions. This last point can be a potential liability of Normal Boundary Intersection, an otherwise successful multiobjective method, which is mainly caused by its reliance on equality constraints. The promise of the algorithm is demonstrated with two numerical examples and a simple structural optimization problem.

[1]  JiGuan G. Lin.  Multiple-objective problems: Pareto-optimal solutions by method of proper equality constraints , 1976 .

[2]  Daniel P. Giesy,et al.  Multicriteria Optimization Methods for Design of Aircraft Control Systems , 1988 .

[3]  Keith A. Seffen,et al.  A SIMULATED ANNEALING ALGORITHM FOR MULTIOBJECTIVE OPTIMIZATION , 2000 .

[4]  Marc Despontin,et al.  Multiple Criteria Optimization: Theory, Computation, and Application, Ralph E. Steuer (Ed.). Wiley, Palo Alto, CA (1986) , 1987 .

[5]  John E. Dennis,et al.  Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..

[6]  Vilfredo Pareto,et al.  Manuale di economia politica , 1965 .

[7]  I. Y. Kim,et al.  Adaptive weighted-sum method for bi-objective optimization: Pareto front generation , 2005 .

[8]  J. Dennis,et al.  A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems , 1997 .

[9]  A. Messac,et al.  The normalized normal constraint method for generating the Pareto frontier , 2003 .

[10]  Peter J. Fleming,et al.  An Overview of Evolutionary Algorithms in Multiobjective Optimization , 1995, Evolutionary Computation.

[11]  Lotfi A. Zadeh,et al.  Optimality and non-scalar-valued performance criteria , 1963 .

[12]  Hajime Kita,et al.  Multi-objective optimization by genetic algorithms: a review , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[13]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[14]  A. Messac,et al.  Generating Well-Distributed Sets of Pareto Points for Engineering Design Using Physical Programming , 2002 .

[15]  Juhani Koski,et al.  Multicriteria Truss Optimization , 1988 .

[16]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[17]  Keith A. Seffen,et al.  Design by multiobjective optimisation using simulated annealing , 1999 .

[18]  W. Stadler.  A survey of multicriteria optimization or the vector maximum problem, part I: 1776–1960 , 1979 .

[19]  Karen Willcox,et al.  16.888 / ESD.77 Multidisciplinary System Design Optimization, Spring 2004 , 2004 .

[20]  A. Messac,et al.  Concept Selection Using s-Pareto Frontiers , 2003 .

[21]  J. Koski.  Defectiveness of weighting method in multicriterion optimization of structures , 1985 .

[22]  A. Messac,et al.  Normal Constraint Method with Guarantee of Even Representation of Complete Pareto Frontier , 2004 .

[23]  Stephen A. Marglin.  Public Investment Criteria , 1967 .

[24]  J. Dennis,et al.  NORMAL-BOUNDARY INTERSECTION: AN ALTERNATE METHOD FOR GENERATING PARETO OPTIMAL POINTS IN MULTICRITERIA OPTIMIZATION PROBLEMS , 1996 .