نتایج جستجو برای: الگوریتم nsgaii
تعداد نتایج: 22503 فیلتر نتایج به سال:
Coordinating traffic signals can provide great savings to motorists in terms of reduced delays and number of vehicular stops. In order to maximize benefits, engineers need to use a mechanism by which the most optimal timing plans are activated when the traffic patterns change. Common ways of accomplishing this need is by using Time of Day (TOD) plan scheduling, or Traffic Responsive Plan Select...
We would like to thank Jasper Vrugt for his comment on our recent paper Tang et al. (2006) in which we compare the Strength Pareto Evolutionary Algorithm 2 (SPEA2), the Multi-objective Shuffled Complex Evolution Metropolis algorithm (MOSCEM-UA), and the Epsilon Dominance Nondominated Sorted Genetic Algorithm II (ε-NSGAII) using a statistical metrics-based approach. To frame our response, we wil...
Cooperative coevolutionary evolutionary algorithms differ from standard evolutionary algorithms’ architecture in that the population is split into subpopulations, each of them optimising only a sub-vector of the global solution vector. All subpopulations cooperate by broadcasting their local partial solutions such that each subpopulation can evaluate complete solutions. Cooperative coevolution ...
Generally, the main focus of grid-linked photovoltaic systems is to scale up penetration level ensure full electricity consumption coverage. However, due stochasticity and nondispatchable nature its generation, significant adverse impacts such as power overloading, voltage, harmonics, current, frequency instabilities on utility grid arise. These vary in severity a function degree system. Thus, ...
The increasing complexity of circuit design needs to be managed with appropriate optimization algorithms and accurate statistical description of design models in order to reach the design specifics, guaranteeing ’’zero defects’’. In the Design for Yield open problems are the design of effective optimization algorithms and statistical analysis for yield design, which require time consuming techn...
Deception problems are among the hardest problems to solve using ordinary genetic algorithms. Designed to simulate a high degree of epistasis, these deception problems imitate extremely difficult real world problems. [1]. Studies show that Bayesian optimization and explicit building block manipulation algorithms, like the fast messy genetic algorithm (fmGA), can help in solving these problems. ...
Transportation on demand does not stop facilitating our daily life. In fact, for 40 years the research has contributed to the resolution of the Dial a Ride Problem to improve the service offered to customers. In this research, we contributed to the resolution of a Stochastic Dial a Ride Problem while consider four problems that may inhibit the proper functioning of service Transport on Demand ,...
The main methodologies and recent patents on test wrapper design have been reviewed in this paper. The design of three-dimension test wrapper for IP module in System on Chip is a NP Hard problem. As the test time of an IP module is determined by the longest wrapper scan chain and each TSV has area costs and is a potential source of defects, it is necessary to shorten the longest wrapper chain a...
از مهمترین موضوعات برای موفقیت سازمانها، مسئلۀ انتخاب مناسب پرتفوی پروژهها است. در پژوهشهای قبلی انتخاب سبد پروژهها با تمرکز روی میزان کارایی پروژهها انجام و کمتر به نقش ریسک توجه شده است؛ بنابراین در این مقاله مدلی چندهدفه برای انتخاب پرتفوی بهینۀ پروژهها با رویکرد ترکیبی کارایی- ریسک و با استفاده از تکنیکهای DEA، RPN، MOMP و NSGAII ارائه شده است که در آن نهتنها پارامتر ریسک شاخص اصلی...
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید