Clustering aided approach for decision making in computationally expensive multiobjective optimization

• Typically, industrial optimization problems need to be solved in an efficient, multiobjective and global manner, because they are often computationally expensive (as function values are typically based on simulations), they may contain multiple conflicting objectives, and they may have several local optima. Solving such problems may be challenging and time consuming when the aim is to find the most preferred Pareto optimal solution. In this study, we propose a method where we use an advanced clustering technique to reveal essential characteristics of the approximation of the Pareto optimal set, which has been generated beforehand. Thus, the decision maker (DM) is involved only after the most time consuming computation is finished. After the initiation phase, a moderate number of cluster prototypes projected to the Pareto optimal set is presented to the DM to be studied. This allows him/her to rapidly gain an overall understanding of the main characteristics of the problem without placing too much cognitive load on the DM. Furthermore, we also suggest some ways of applying our approach to different types of problems and demonstrate it with an example related to internal combustion engine design.

Subject headings

NATURVETENSKAP  -- Data- och informationsvetenskap (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences (hsv//eng)

Keyword

multiple objective optimization

multicriteria optimization

Pareto optimality

efficient methods

learning-oriented methods

Publication and Content Type

ref (subject category)

art (subject category)