نتایج جستجو برای: dynamic genetic algorithm
تعداد نتایج: 1650697 فیلتر نتایج به سال:
In this paper, two algorithms have been developed for allocation and size determination of Active Power Filters (APF) in power systems. In the first algorithm, the objective is to minimize harmonic voltage distortion. The objective in the second algorithm is to minimize the new APF injection currents while satisfying harmonic standards. Genetic algorithm is proposed for these two optimization p...
resource limitation in zero time may cause to some profitable projects not to be selected in project selection problem, thus simultaneous project portfolio selection and scheduling problem has received significant attention. in this study, budget, investment costs and earnings are considered to be stochastic. the objectives are maximizing net present values of selected projects and minimizing v...
wireless sensor networks (wsns) consist of a large number of sensor nodes which are capable of sensing different environmental phenomena and sending the collected data to the base station or sink. since sensor nodes are made of cheap components and are deployed in remote and uncontrolled environments, they are prone to failure; thus, maintaining a network with its proper functions even when und...
in this study, a hybrid algorithm is presented to tackle multi-variables robust design problem. the proposed algorithm comprises neural networks (nns) and co-evolution genetic algorithm (cga) in which neural networks are as a function approximation tool used to estimate a map between process variables. furthermore, in order to make a robust optimization of response variables, co-evolution algor...
This paper derives a population sizing relationship for genetic programming (GP). Following the population-sizing derivation for genetic algorithms in Goldberg, Deb, and Clark (1992), it considers building block decision making as a key facet. The analysis yields a GP-unique relationship because it has to account for bloat and for the fact that GP solutions often use subsolutions multiple times...
So far, various optimization methods have been proposed, and swarm intelligence algorithms have gathered a lot of attention by academia. However, most of the recent optimization problems in the real world have a dynamic nature. Thus, an optimization algorithm is required to solve the problems in dynamic environments well. In this paper, a novel collective optimization algorithm, namely the Clus...
In this paper, we propose five data fusion schemes for the Internet of Things (IoT) scenario,which are Relief and Perceptron (Re-P), Relief and Genetic Algorithm Particle Swarm Optimization (Re-GAPSO), Genetic Algorithm and Artificial Neural Network (GA-ANN), Rough and Perceptron (Ro-P)and Rough and GAPSO (Ro-GAPSO). All the schemes consist of four stages, including preprocessingthe data set ba...
Addressing dynamic optimization problems has been a challenging task for the genetic algorithm community. Over the years, several approaches have been developed into genetic algorithms to enhance their performance in dynamic environments. One major approach is to maintain the diversity of the population, e.g., via random immigrants. This paper proposes an elitism-based immigrants scheme for gen...
Comparison of Steady State and Generational Genetic Algorithms for Use in Nonstationary Environments
The objective of this study is a comparison of two models of the genetic algorithm, the generational and incremental/steady state genetic algorithms, for use in nonstationary/dynamic environments. It is experimentally shown that choice of a suitable version of the genetic algorithm can improve its performance in such environments. This can extend ability of the genetic algorithm to track enviro...
چکیده ندارد.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید