This paper investigates fast Pareto genetic algorithm based on fast fitness identification and external population updating scheme (FPGA) for searching Pareto-optimal set, which is based on a new approach of fast fitness identification algorithm for individual and a clustering on the basis of external population updating scheme to maintain population diversity and even distribution of Pareto so...

abstract in this paper, a fuzzy pid with new structure is proposed to solve the load frequency control in interconnected power systems. in this study, a new structure and effective of the fuzzy pid-type load frequency control (lfc) is proposed to solve the load frequency control in interconnected power systems. the main objective is to eliminate the deviations in the frequency of different area...

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

This paper presents a method to predict the relative objective weighting scheme necessary to cause arbitrary members of a Pareto solution set to become optimal. First, a polynomial description of the Pareto set is constructed utilizing simulation and high performance computing. Then, using geometric relationships between the member of the Pareto set in question, the location of the utopia point...

Self-optimization enables technical systems to adapt their behavior to varying environmental conditions and changing system settings. Objective functions serve as evaluation criteria for the system behavior. In this paper we propose a hierarchical control approach of an objective-based Pareto controller. We separate the processes of optimization and control. First, we use multiobjective optimiz...

Abstract Mathematical models of linear discrete-time set-valued Pareto-Nash-Stackelberg control processes are examined as extension of mono-valued Pareto-Nash-Stackelberg control models proposed by V. Ungureanu in [10]. A straightforward principle is applied to solve Pareto-Nash-Stackelberg control problems. Models and results are presented in natural order by beginning with the simplest case a...

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

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 this paper, a new evolutionary technique for detecting continuous Pareto optimal sets is proposed. The technique is designed for functions of one real variable but it can be extended for several variables functions. In this approach an individual (a solution) is either a closed interval or a point. Each solution in the final population corresponds to a decision region of Pareto optimal set. ...

In the multi objective optimization, in the case when generated set of Pareto optimal solutions is large, occurs the problem to select of the best solution from this set. In this paper is suggested a method to order of Pareto set. Ordering the Pareto optimal set carried out in conformity with the introduced distance function between each solution and selected reference point, where the referenc...