نتایج جستجو برای: NSGA-ІІ
تعداد نتایج: 2358 فیلتر نتایج به سال:
BACKGROUND AND AIMS The aim of present study was to investigate pulp-dentin complex reactions following direct pulp capping (DPC) with calcium hydroxide [Ca(OH)2] and simvastatin as pulp-capping materials in the primary human molars. MATERIALS AND METHODS 120 primary molar teeth which had to be extracted for orthodontic reasons were randomly allocated into four groups. Group Ι as a control, u...
در این پژوهش، ابتدا لیگاندهای فرمامیدین جدید متقارن n,n- بیس(4-کلروفنیل) فرمامیدین با نام اختصاری (b-cpf) و n,n- بیس(3و5-دی کلروفنیل) فرمامیدین با نام اختصاری (b-dcpf) سنتز شدند و به وسیله اسپکتروسکوپی 1hnmr ،13cnmr ، ftir و آنالیز chn شناسایی شدند. سپس قابلیت کمپلکسشوندگی لیگاندهای فوق با یون های جیوه(іі)، کادمیم(іі) و روی(іі) در حلال های متانول و استونیتریل به روش اسپکتروفتومتری مورد بررسی قر...
The performance of an Evolutionary Algorithm (EA) can be greatly influenced by its parameters. The optimal parameter settings are also not necessarily the same across different problems. Finding the optimal set of parameters is therefore a difficult and often time-consuming task. This paper presents results of parameter tuning experiments on the NSGA-II and NSGA-III algorithms using the ZDT tes...
NSGA methodology discussed in Section 3.1 suffers from three weaknesses: computational complexity, non-elitist approach and the need to specify a sharing parameter. An improved version of NSGA known as NSGA-II, which resolved the above problems and uses elitism to create a diverse Pareto-optimal front, has been subsequently presented (Deb et al 2002). The main features of NSGA-II are low comput...
NSGA-II and its contemporary EMO algorithms were found to be vulnerable in solving many-objective optimization problems having four or more objectives. It is not surprising that EMO researchers have been concentrating in developing efficient algorithms for manyobjective optimization problems. Recently, authors suggested an extension of NSGA-II (NSGA-III) which is based on the supply of a set of...
A multiobjective optimization problem which focuses on parallel machines scheduling is considered. This problem consists of scheduling n independent jobs onm identical parallel machines with release dates, due dates, and sequence-dependent setup times. The preemption of jobs is forbidden. The aim is to minimize two different objectives: makespan and total tardiness. The contribution of this pap...
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-...
This paper proposes a multi-objective memetic algorithm based on NSGA-II and Simulated Annealing (SA), NSGA-II-SA, for calibration of microscopic vehicular traffic flow simulation models. The NSGA-II algorithm performs a scan in the search space and obtains the Pareto front which is optimized locally with SA. The best solution of the obtained front is selected. Two CORSIM models were calibrated...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید