There are currently three different game strategies to solve multi-criteria design problems: 1) Cooperative Games (Pareto Front), 2) Competitive Games (Nash Game) and 3) Hierarchical Games (Stackelberg Game). Nowadays EAs and Pareto front concept are more and more in solving practical design problems in industry, but this process is time consuming. Here, deterministic optimization method and Pa...

This paper presents an adaptive weighted sum (AWS) method for multiobjective optimization problems. The method extends the previously developed biobjective AWS method to problems with more than two objective functions. In the first phase, the usual weighted sum method is performed to approximate the Pareto surface quickly, and a mesh of Pareto front patches is identified. Each Pareto front patc...

In the past few years, multi-objective optimization (MOO) algorithms have been extensively applied in several fields including engineering design problems. A major reason is the advancement of evolutionary multi-objective optimization (EMO) algorithms that are able to find a set of non-dominated points spread on the respective Pareto-optimal front in a single simulation. Besides just finding a ...

Many real-world optimization problems involve balancing multiple objectives. When there is no solution that is best with respect to all objectives, it is often desirable to compute the Pareto front. This paper proposes queued Pareto local search (QPLS), which improves on existing Pareto local search (PLS) methods by maintaining a queue of improvements preventing premature exclusion of dominated...

Land-use allocation is of great significance in urban development. This type of allocation is usually considered to be a complex multi-objective spatial optimization problem, whose optimized result is a set of Pareto-optimal solutions (Pareto front) reflecting different tradeoffs in several objectives. However, obtaining a Pareto front is a challenging task, and the Pareto front obtained by sta...

In the present paper, a bicriterial optimal control problem governed by an abstract evolution problem and bilateral control constraints is considered. To compute Pareto optimal points and the Pareto front numerically, the (Euclidean) reference point method is applied, where many scalar constrained optimization problems have to be solved. For this reason a reduced-order approach based on proper ...

Nowadays, with extending applications of bi-layer metallic sheets in different industrial sectors, accurate specification of each layer is very prominent to achieve desired properties. In order to predict behavior of sheets under different forming modes and determining rupture limit and necking, the concept of Forming Limit Diagram (FLD) is used. Optimization problem with objective functions an...

In this paper, evolutionary dynamic weighted aggregation methods are generalized to deal with three-objective optimization problems. Simulation results from two test problems show that the performance is quite satisfying. To take a closer look at the characteristics of the Pareto-optimal solutions in the parameter space, piecewise linear models are used to approximate the definition function in...

Abstract: In multi-objective optimization problems, the optimization target is to obtain a set of non-dominated solutions. Comparing solution sets is crucial in evaluating the performances of different optimization algorithms. The use of performance indicators is common in comparing those sets and, subsequently, optimization algorithms. A good solution set must be close to the Pareto-optimal fr...

Multiobjective optimization using the conventional weighted aggregation of the objectives method is known to have several drawbacks. In this paper, multiobjective optimization using the weighted aggregation method is approached with the help of evolutionary algorithms. It is shown through a number of test functions that a Pareto front can be achieved from one single run of evolutionary optimiza...