This paper presents a multiobjective optimization algorithm for solving tri-objective optimization problems with objectives of very different scales. As a version of the Multiobjective Evolutionary Algorithm based on Decomposition (MOEA/D), it adopts the Normal Boundary Intersection (NBI) based Tchebycheff approach to decompose a multiobjective optimization problem into a number of single objec...

We have already proposed a similarity-based mating scheme to recombine extreme and similar parents for evolutionary multiobjective optimization. In this paper, we examine the effect of the similarity-based mating scheme on the performance of evolutionary multiobjective optimization (EMO) algorithms. First we examine which is better between recombining similar or dissimilar parents. Next we exam...

Abstract. Multiobjective optimization problems depending on a probability measure correspond to many economic and financial activities. Evidently if the probability measure is completely known, then we can try to influence economic process employing methods of a multiobjective deterministic optimization theory. Since this assumption is fulfilled very seldom we have mostly to analyze the mathema...

We propose a method for constrained and unconstrained nonlinear multiobjective optimization problems that is based on an SQP-type approach. The proposed algorithm maintains a list of nondominated points that is improved both for spread along the Pareto front and optimality by solving single-objective constrained optimization problems. These single-objective problems are derived as SQP problems ...

This paper proposes a novel surrogate-model-based multiobjective evolutionary algorithm called Differential Evolution for Multiobjective Optimization Based on Gaussian Process Models (GP-DEMO). The algorithm is based on the newly defined relations for comparing solutions under uncertainty. These relations minimize the possibility of wrongly performed comparisons of solutions due to inaccurate s...

Though optimization problems in industrial electromagnetic design are often truly multiobjective, solving them by evolutionary Pareto Optimal Front approximation is often unpractical, due to the high computational cost of objective evaluations. In order to overcome this drawback, an extension of classical single-objective Generalized Response Surface (GRS) methods to Pareto-optimal front approx...

In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...

In this paper, we consider the multiobjective linear programs where coefficients in the objective function belong to uncertainty sets. We introduce the concept of robust efficient solutions to uncertain multiobjective linear programming problems. By using two scalarization methods, the weighted sum method and the ϵ-constraint method, we obtain that the robust efficient solutions for uncertain m...