نتایج جستجو برای: NSGA-II

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

2011
Horia Calborean Theo Ungerer Lucian Vintan Lucian Blaga

One way to cope with a huge design space formed by several parameters is using methods for Automatic Design Space Exploration (ADSE). Recently we developed a Framework for Automatic Design Space Explorations focused on micro-architectural optimizations. In this article we evaluate the influence of three different evolutionary algorithms on the performance of design space explorations. More prec...

Journal: :IEICE Transactions 2010
Ukrit Watchareeruetai Tetsuya Matsumoto Yoshinori Takeuchi Hiroaki Kudo Noboru Ohnishi

We propose a new multi-objective genetic programming (MOGP) for automatic construction of image feature extraction programs (FEPs). The proposed method was originated from a well known multiobjective evolutionary algorithm (MOEA), i.e., NSGA-II. The key differences are that redundancy-regulation mechanisms are applied in three main processes of the MOGP, i.e., population truncation, sampling, a...

2002
Shinya Watanabe Tomoyuki Hiroyasu Mitsunori Miki

In this paper, a new genetic algorithm for multi-objective optimization problems is introduced. That is called ”Neighborhood Cultivation GA (NCGA)”. In the recent studies such as SPEA2 or NSGA-II, it is demonstrated that some mechanisms are important; the mechanisms of placement in an archive of the excellent solutions, sharing without parameters, assign of fitness, selection and reflection the...

Journal: :Int. J. Machine Learning & Cybernetics 2015
Hu Zhang Shenmin Song Aimin Zhou X. Z. Gao

Multiobjective cellular genetic algorithms (MOcGAs) are variants of evolutionary computation algorithms by organizing the population into grid structures, which are usually 2D grids. This paper proposes a new MOcGA, namely cosine multiobjective cellular genetic algorithm (C-MCGA), for continuous multiobjective optimization. The CMCGA introduces two new components: a 3D grid structure and a cosi...

2015
Farzad Firouzi Jahantigh Behnam Malmir

Today’s logistic systems in companies depend on optimum solutions of Facility Location-Allocation (FLA) problems in order to minimize cost values the company is dealing with. Therefore, FLA plays an important role in nowadays business environment. In this paper, a Hybrid Genetic Algorithm (HGA) is proposed to solve FLA. The HGA is a combination of Genetic Algorithm and Tabu Search while NSGA II...

2009
Nikhil Padhye Chilukuri K. Mohan Pramod Varshney

When large sensor networks are applied to the task of target tracking, it is necessary to successively identify subsets of sensors that are most useful at each time instant. Such a task involves simultaneously maximizing target detection accuracy and minimizing querying cost, addressed in this paper by the application of multi-objective evolutionary algorithms (MOEAs). The objective of maximizi...

2013
Antonio J. Nebro Juan José Durillo Mirialys Machin Navas Carlos A. Coello Coello Bernabé Dorronsoro

Multi-objective evolutionary algorithms rely on the use of variation operators as their basic mechanism to carry out the evolutionary process. These operators are usually fixed and applied in the same way during algorithm execution, e.g., the mutation probability in genetic algorithms. This paper analyses whether a more dynamic approach combining different operators with variable application ra...

2015
Kazem Varesi Ahmad Radan Seyed H. Hosseini Mehran Sabahi

In this paper, a simple but efficient Non-dominated Sorting Genetic Algorithm (NSGA) II based technique is proposed for optimizing the Degree of Hybridization (DOH) in parallel passenger hybrid cars. The authors’ objective is to improve performance, maximize fuel economy and at the same time, minimize mass and emissions as much as possible, by optimal selection of DOH. The NSGA-II, which is a m...

Journal: :iranian journal of management studies 2015
mostafa zareei hossein ali hassan-pour

this paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. the net present value (npv) maximization and making span minimization are this study objectives. and since this problem is considered as complex optimization in np-hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...

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

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