نتایج جستجو برای: non dominated sorting

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

Journal: :Bulletin of Electrical Engineering and Informatics 2016

2011
Hadi Nobahari Mahdi Nikusokhan Patrick Siarry

This paper proposes an extension of the Gravitational Search Algorithm (GSA) to multiobjective optimization problems. The new algorithm, called Non-dominated Sorting GSA (NSGSA), utilizes the non-dominated sorting concept to update the gravitational acceleration of the particles. An external archive is also used to store the Pareto optimal solutions and to provide some elitism. It also guides t...

2009
Michael Mazurek Slawomir Wesolkowski

....... The fast and elitist non-dominated sorting genetic algorithm (NSGA-II) contains a mechanism to sort individuals in a multi-objective optimization problem into non-dominated fronts, based on their performance in each optimization variable. When dealing with a bi-objective problem it is possible to carry-out the non-dominated sorting more efficiently, using the new sorting method presente...

Journal: :Fundam. Inform. 2008
Ashish Ghosh Mrinal Kanti Das

In this paper a new concept of ranking among the solutions of the same front, along with elite preservation mechanism and ensuring diversity through the nearest neighbor method is proposed for multi-objective genetic algorithms. This algorithm is applied on a set of benchmark multi-objective test problems and the results are compared with that of NSGA-II (a similar algorithm). The proposed algo...

Trip distribution deals with estimation of trips distributed among origins and destinations and is one of the important stages in transportation planning. Since in the real world, trip distribution models often have more than one objective, multi-objective models are developed to cope with a set of conflict goals in this area. In a proposed method of adapted non-dominated sorting algorithm (ANS...

2011
Michael Mazurek Slawomir Wesolkowski Paul Comeau

....... An important problem in the realm of evolutionary multi-objective optimization (MOO) is that of finding all non-dominated fronts (NDFs). We specifically address the computational efficiency of the non-dominated sorting algorithm for finding the non-dominated fronts for the non-dominated sorting genetic algorithm II (NSGA-II) algorithm. We introduce the Limiting Index Sort (LIS) algorith...

Journal: :international journal of supply and operations management 0
ali akbar hasani industrial engineering and management department, shahrood university of technology, shahrood, iran

in this paper, a comprehensive model is proposed to design a network for multi-period, multi-echelon, and multi-product inventory controlled the supply chain. various marketing strategies and guerrilla marketing approaches are considered in the design process under the static competition condition. the goal of the proposed model is to efficiently respond to the customers’ demands in the presenc...

Journal: :IJHPSA 2008
José Luis Risco-Martín Oscar Garnica Juan Lanchares José Ignacio Hidalgo David Atienza

In this paper, we propose a dynamic, non-dominated sorting, multiobjective particle-swarm-based optimizer, named Hierarchical Non-dominated Sorting Particle Swarm Optimizer (H-NSPSO), for memory usage optimization in embedded systems. It significantly reduces the computational complexity of others MultiObjective Particle Swarm Optimization (MOPSO) algorithms. Concretely, it first uses a fast no...

Journal: :international journal of advanced design and manufacturing technology 0
ali reza babaei malek ashtar unversity of technology mohammad reza setayandeh

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

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

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

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