نتایج جستجو برای: non dominated sort genetic algorithm

تعداد نتایج: 2544225  

2004
Kuntinee Maneeratana Kittipong Boonlong Nachol Chaiyaratana

This paper presents the integration between a co-operative co-evolutionary genetic algorithm (CCGA) and four evolutionary multiobjective optimisation algorithms (EMOAs): a multi-objective genetic algorithm (MOGA), a niched Pareto genetic algorithm (NPGA), a nondominated sorting genetic algorithm (NSGA) and a controlled elitist nondominated sorting genetic algorithm (CNSGA). The resulting algori...

Abstract In this paper, multi-objective optimization (MOO) of Al2O3-water nanofluid flow in microchannel heat sinks (MCHS) with triangular ribs is performed using Computational Fluid Dynamics (CFD) techniques and Non-dominated Sorting Genetic Algorithms (NSGA II). At first, nanofluid flow is solved numerically in various MCHS with triangular ribs using CFD techniques. Finally, the CFD data will...

Despite a large number of advantages, Torque Ripple (TR) is the most important drawback of Switched Reluctance Motor (SRM). In the presented study, TR was reduced by optimizing the gate pulse angle of the SRM phase which played a leading role in the generated torque profile. For the Optimization, one of the strategies of Genetic Algorithm (GA) which was named Non-dominated Sorting Genetic Algor...

A. Adib , I. Ahmadianfar, M. Taghian,

This paper presents a Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) for the optimal operation of a complex multipurpose and multi-reservoir system. Firstly, MOEA/D decomposes a multi-objective optimization problem into a number of scalar optimization sub-problems and optimizes them simultaneously. It uses information of its several neighboring sub-problems for optimizin...

2012
Chih-Hao Lin Pei-Ling Lin

Multi-objective optimization (MO) is a highly demanding research topic because many realworld optimization problems consist of contradictory criteria or objectives. Considering these competing objectives concurrently, a multi-objective optimization problem (MOP) can be formulated as finding the best possible solutions that satisfy these objectives under different tradeoff situations. A family o...

A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...

2013
Vahid Hajipour

This article proposes a novel Pareto-based multiobjective meta-heuristic algorithm named non-dominated ranking genetic algorithm (NRGA) to solve multi-facility location-allocation problem. In NRGA, a fitness value representing rank is assigned to each individual of the population. Moreover, two features ranked based roulette wheel selection including select the fronts and choose solutions from ...

Mohammadreza Shahriari

The time–cost tradeoff problem is one of the most important and applicable problems in project scheduling area. There are many factors that force the mangers to crash the time. This factor could be early utilization, early commissioning and operation, improving the project cash flow, avoiding unfavorable weather conditions, compensating the delays, and so on. Since there is a need to allocate e...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

Journal: :Evolutionary computation 2008
Hongbing Fang Qian Wang Yi-Cheng Tu Mark F. Horstemeyer

We present a new non-dominated sorting algorithm to generate the non-dominated fronts in multi-objective optimization with evolutionary algorithms, particularly the NSGA-II. The non-dominated sorting algorithm used by NSGA-II has a time complexity of O(MN(2)) in generating non-dominated fronts in one generation (iteration) for a population size N and M objective functions. Since generating non-...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید