Optimization Online


Dynamic Weighted Aggregation for Evolutionary Multiobjective Optimization

Yaochu Jin (yaochu.jin***at***honda-ri.de)

Abstract: Weighted sum based approaches to multiobjective optimization is computationally very efficient. However,they have two main weakness: 1) Only one Pareto solution can be obtained in one run 2) The solutions in the concave part of the Pareto front cannot be obtained. This paper proposes a new theory on multiobjective optimization using weighted aggregation approach. Based on this theory, a method called evolutionary dynamic weighted aggregation (EDWA) is developed. The method is able to obtain the Pareto set in one run, no matter whether the Pareto is convex or concave. Therefore, the paper has overcome the two main weaknesses of weighted aggregation approaches. The proposed method has shown to be very efficient and effective on several MOO test functions.

Keywords: Multiobjective optimization, weighted aggregation, evolutionary algorithms, convex and concave Pareto fronts

Category 1: Other Topics (Multi-Criteria Optimization )

Category 2: Applications -- Science and Engineering (Multidisciplinary Design Optimization )

Citation: To be published in "Genetic and Evolutionary Computation Conference", San Francisco, July 2001

Download: [Compressed Postscript][PDF]

Entry Submitted: 03/12/2001
Entry Accepted: 03/12/2001
Entry Last Modified: 03/29/2006

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society