نتایج جستجو برای: nsga ii evolutionary algorithm

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

Journal: :Int. J. Computational Intelligence Systems 2016
Juan Carlos Leyva López Jesús Jaime Solano Noriega Jorge Luis García-Alcaraz Diego Alonso Gastélum Chavira

We present a multi-objective evolutionary algorithm to exploit a medium-sized fuzzy outranking relation to derive a partial order of classes of alternatives (we call it RP-NSGA-II). To measure the performance of RP-NSGA-II, we present an empirical study over a set of simulated multi-criteria ranking problems. The result of this study shows that RP-NSGA-II can effectively exploit a medium-sized ...

2018
Nosheen Qamar Nadeem Akhtar Irfan Younas

The Evolutionary Computation has grown much in last few years. Inspired by biological evolution, this field is used to solve NP-hard optimization problems to come up with best solution. TSP is most popular and complex problem used to evaluate different algorithms. In this paper, we have conducted a comparative analysis between NSGA-II, NSGA-III, SPEA-2, MOEA/D and VEGA to find out which algorit...

Journal: :نشریه دانشکده فنی 0
محمد سعادت سرشت فرهاد صمدزادگان

nowadays, the subject of vision metrology network design is local enhancement of the existing network. in the other words, it has changed from first to third order design concept. to improve the network, locally, some new camera stations should be added to the network in drawback areas. the accuracy of weak points is enhanced by the new images, if the related vision constraints are satisfied si...

Journal: :Applied Mathematics and Computation 2013
Rasul Enayatifar Moslem Yousefi Abdul Hanan Abdullah Amer Nordin Darus

A novel multi-objective evolutionary algorithm (MOEA) is developed based on Imperialist Competitive Algorithm (ICA), a newly introduced evolutionary algorithm (EA). Fast non-dominated sorting and the Sigma method are employed for ranking the solutions. The algorithm is tested on six well-known test functions each of them incorporate a particular feature that may cause difficulty to MOEAs. The n...

2009
Deepak Sharma Kalyanmoy Deb N. N. Kishore

The present work focuses on evolving the multiple light-in-weight topologies of compliant mechanism tracing user defined path. Therefore in this paper, the bi-objective set is formulated first on the optimization frame-work in which the helper objective of maximum diversity is introduced with the primary objective of minimum weight of elastic structures. Thereafter, the evolutionary algorithm (...

2014
Haitham Seada Kalyanmoy Deb

Evolutionary algorithms (EAs) have been systematically developed to solve mono-objective, multi-objective and many-objective optimization problems, in this order, over the past few decades. Despite some efforts in unifying different types of mono-objective evolutionary and non-evolutionary algorithms, there does not exist many studies to unify all three types of optimization problems together. ...

Journal: :international journal of supply and operations management 0
masoud rabbani college of engineering, university of tehran, tehran, iran safoura famil alamdar university of tehran, tehran, iran parisa famil alamdar amir kabir university, tehran, iran

in this study, a two-objective mixed-integer linear programming model (milp) for multi-product re-entrant flow shop scheduling problem has been designed. as a result, two objectives are considered. one of them is maximization of the production rate and the other is the minimization of processing time. the system has m stations and can process several products in a moment. the re-entrant flow sho...

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

Journal: :CLEI Electron. J. 2014
Grégoire Danoy Julien Schleich Pascal Bouvry Bernabé Dorronsoro

Cooperative coevolutionary evolutionary algorithms differ from standard evolutionary algorithms architecture in that the population is split into subpopulations, each of them optimising only a subvector of the global solution vector. All subpopulations cooperate by broadcasting their local partial solutions such that each subpopulation can evaluate complete solutions. Cooperative coevolution ha...

2000
Kalyanmoy Deb Amrit Pratap Subrajyoti Moitra

In this paper, we apply an elitist multi-objective genetic algorithm for solving mechanical component design problems with multiple objectives. Although there exists a number of classical techniques, evolutionary algorithms (EAs) have an edge over the classical methods in that they can find multiple Pareto-optimal solutions in one single simulation run. The proposed algorithm (we call NSGA-II) ...

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

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