For optimization of real-world arch dams, it is unavoidable to consider two or more conflicting objectives. This paper employs two multi-objective differential evolution algorithms (MoDE) in combination of a parallel working MATLAB-APDL code to obtain a set of Pareto solutions for optimal shape of arch dams. Full dam-reservoir interaction subjected to seismic loading is considered. A benchmark ...

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...

We consider constraint satisfaction problems where solutions must be optimized according to multiple criteria. When the relative importance of different criteria cannot be quantified, there is no single optimal solution, but a possibly very large set of Pareto-optimal solutions. Computing this set completely is in general very costly and often infeasible in practical applications. We consider s...

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...

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...

We propose a strategy for approximating Pareto optimal sets based on the global analysis framework proposed by Smale [Global analysis and economics. I. Pareto optimum and a generalization of Morse theory, in Dynamical Systems, Academic Press, New York, 1973, pp. 531–544]. The method highlights and exploits the underlying manifold structure of the Pareto sets, approximating Pareto optima by mean...

A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version that pro...

In general, Multi-objective Evolutionary Algorithms do not guarantee find solutions in the Pareto-optimal set. We propose a new approach for solving decomposable deceptive multi-objective problems that can find all solutions of the Pareto-optimal set. Basically, the proposed approach starts by decomposing the problem into subproblems and, then, combining the found solutions. The resultant appro...

1 Abstract Pareto optimal designs are the best designs that can be produced for a given problem formulation for a given set of criteria when the criteria are not combined in any way. If the goal is to improve the performance in those criteria then it is possible to manipulate the problem formulation to achieve an improvement. The approach adopted is to encode the formulation in a genetic algori...

A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version that pro...