Many practical optimization problems usually have several conflicting objectives. In those multi-objective optimization, no solution optimizing all objective functions simultaneously exists in general. Instead, Pareto optimal solutions, which are “efficient” in terms of all objective functions, are introduced. In general we have many Pareto optimal solutions. Therefore, we need to decide a fina...

Pareto local search (PLS) methods are local search algorithms for multiobjective combinatorial optimization problems based on the Pareto dominance criterion. PLS explores the Pareto neighbourhood of a set of non-dominated solutions until it reaches a local optimal Pareto front. In this paper, we discuss and analyse three different Pareto neighbourhood exploration strategies: best, first, and ne...

This paper proposes a Trust-Region Based Augmented Method (TRALM) to solve a combined Environmental and Economic Power Dispatch (EEPD) problem. The EEPD problem is a multi-objective problem with competing and non-commensurable objectives. The TRALM produces a set of non-dominated Pareto optimal solutions for the problem. Fuzzy set theory is employed to extract a compromise non-dominated sol...

A new game theoretical solution concept for open spectrum sharing in cognitive radio (CR) environments is highlighted – the Lorenz equilibrium (LE). Both Nash and Pareto solution concepts have limitations when applied to real world problems. Nash equilibrium (NE) rarely ensures maximal payoff and it is frequently Pareto inefficient. The Pareto set is usually a large set of solutions, often too ...

We consider a vector minimax Boolean programming problem. The problem consists in finding the set of Pareto optimal solutions. When the problem’s parameters vary then the optimal solution of the problem obtained for some initial parameters may appear non-optimal. We calculate the maximal perturbation of parameters which preseves the optimality of a given solution of the problem. The formula for...

We study a concept in multicriteria optimization called compromise solutions (introduced in 1973 by Yu [20]) and a generalized version of this, termed reference point solutions. Our main result shows the power of this concept: Approximating reference point solutions is polynomially equivalent to constructing an approximate Pareto set as in [16]. A reference point solution is the solution closes...

abstract: in this paper, optimization of boeing 747 wing has been accomplished for cruise condition (mach number=0.85, flight altitude=35000 ft), where an optimal wing shape is proposed. objective functions are minimization of wing weight and drag force that as well as confining design parameters, two functional constrains are applied. the first functional constrain is fuel tank volume in the a...

The coupling of performance functions due to common design variables and uncertainties in an engineering design process will result in difficulties in optimization design problems, such as poor collaboration among design objectives and poor resolution of design conflicts. To handle these problems, a fuzzy interactive multi-objective optimization model is developed based on Pareto solutions, whe...

A new game theoretical solution concept for open spectrum sharing in cognitive radio (CR) environments is presented – the Lorenz equilibrium (LE). Both Nash and Pareto solution concepts have limitations when applied to real world problems. Nash equilibrium (NE) rarely ensures maximal payoff and it is frequently Pareto inefficient. The Pareto set is usually a large set of solutions, often too ha...

Most of the engineering problems are modeled as evolutionary multiobjective optimization problems, but they always ask for only one best solution, not a set of Pareto optimal solutions. The decision maker’s subjective information plays an important role in choosing the best solution from several Pareto optimal solutions. Generally, the decision-making processing is implemented after Pareto opti...