One of the most common approaches for multiobjective optimization is to generate a solution set that well approximates the whole Pareto-optimal frontier to facilitate the later decision-making process. However, how to evaluate and compare the quality of different solution sets remains challenging. Existing measures typically require additional problem knowledge and information, such as a refere...

In this paper we present a new genetic algorithm (GA) using pareto partitioning method and apply this GA to solving the design problem of the robust PID controller with two degrees of freedom based on the partial model matching approach. This design problem is formulated as two objective minimax optimization problem. Therefore we need to generate a pareto optimal set that is properly distribute...

Evolutionary algorithms EA have proved to be well suited for optimization prob lems with multiple objectives Due to their inherent parallelism they are able to capture a number of solutions concurrently in a single run In this report we propose a new evolutionary approach to multicriteria optimization the Strength Pareto Evolutionary Algorithm SPEA It combines various features of previous multi...

In this paper, lift and drag coefficients were numerically investigated using NUMECA software in a set of 4-digit NACA airfoils. Two metamodels based on the evolved group method of data handling (GMDH) type neural networks were then obtained for modeling both lift coefficient (CL) and drag coefficient (CD) with respect to the geometrical design parameters. After using such obtained polynomial n...

In this paper we propose the multi-objective contextual bandit problem with similarity information. This problem extends the classical contextual bandit problem with similarity information by introducing multiple and possibly conflicting objectives. Since the best arm in each objective can be different given the context, learning the best arm based on a single objective can jeopardize the rewar...

Proposal in this paper is a method of interpolating the pareto optimal solution in Multiobjective Genetic Algorithms. In this method, some vacancies are maked up by resuming computation of Multiobjective Genetic Algorithms. A beginning field is set up by variables of both sides of the vacancy. Then, computation of Multiobjective Genetic Algorithms is started from the beginning field again. Visu...

A new algorithm is proposed to solve constrained multi-objective problems in this paper. The constraints of the MOPs are taken account of in determining Pareto dominance. As a result, the feasibility of solutions is not an issue. At the same time, it takes advantage of both the orthogonal design method to search evenly, and the statistical optimal method to speed up the computation. The output ...

A problem that sometimes occurs in multiobjective optimization is the existence of a large set of Pareto-optimal solutions. Hence the decision making based on selecting a unique preferred solution becomes difficult. Considering models with rational B-efficiency relieves some of the burden from the decision maker by shrinking the solution set. This paper focuses on solving multiobjective optimiz...

Many water resources systems are characterized by multiple objectives. For multiobjective optimization, typically there can be no single optimal solution which can simultaneously satisfy all the goals, but rather a set of technologically efficient noninferior or Pareto optimal solutions exists. Generating those Pareto optimal solutions is a challenging task and often difficulties arise in using...

A Multi-objective optimization procedure has been developed to determine some kinetic parameters of free radical polymerization of vinyl acetate based on genetic algorithm. For this purpose, mathematical modeling of free radical polymerization of vinyl acetate is carried out first and then selected kinetic parameters are optimized by minimizing objective functions defined from comparing exp...