A Smart-Distributed Pareto Front Using the ev-MOGA Evolutionary Algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Well-Distributed Pareto Front by Using the e-MOGA Evolutionary Algorithm

In the field of multiobjective optimization, important efforts have been made in recent years to generate global Pareto fronts uniformly distributed. A new multiobjective evolutionary algorithm, called ↗−MOGA, has been designed to converge towards ΘP , a reduced but well distributed representation of the Pareto set ΘP . The algorithm achieves good convergence and distribution of the Pareto fron...

متن کامل

Investigating Pareto Front Extreme Policies Using Semi-distributed Simulation Model for Great Karun River Basin

This study aims to investigate the different management policies of multi-reservoir systems and their impact on the demand supply and hydropower generation in Great Karun River basin. For this purpose, the semi-distributed simulation-optimization  model of the Great Karun River basin is developed. Also, the multi-objective particle swarm optimization algorithm is applied to optimize the develop...

متن کامل

A New Algorithm for Constructing the Pareto Front of Bi-objective Optimization Problems

Here, scalarization techniques for multi-objective optimization problems are addressed. A new scalarization approach, called unified Pascoletti-Serafini approach, is utilized and a new algorithm to construct the Pareto front of a given bi-objective optimization problem is formulated. It is shown that we can restrict the parameters of the scalarized problem. The computed efficient points provide...

متن کامل

Evolutionary Computation and Convergence to a Pareto Front

Research into solving multiobjective optimization problems (MOP) has as one of its an overall goals that of developing and defining foundations of an Evolutionary Computation (EC)-based MOP theory. In this paper, we introduce relevant MOP concepts, and the notion of Pareto optimality, in particular. Specific notation is defined and theorems are presented ensuring Paretobased Evolutionary Algori...

متن کامل

Multi-Pareto-Ranking Evolutionary Algorithm

This paper proposes a new multi-objective genetic algorithm, called GAME, to solve constrained optimization problems. GAME uses an elitist archive, but it ranks the population in several Pareto fronts. Then, three types of fitness assignment methods are defined: the fitness of individuals depends on the front they belong to. The crowding distance is also used to preserve diversity. Selection is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal on Artificial Intelligence Tools

سال: 2014

ISSN: 0218-2130,1793-6349

DOI: 10.1142/s021821301450002x