نتایج جستجو برای: elitist
تعداد نتایج: 863 فیلتر نتایج به سال:
Abstract In the present paper, fundamental frequency optimization of symmetrically laminated composite plates is studied using the combination of Elitist-Genetic algorithm (E-GA) and finite strip method (FSM). The design variables are the number of layers, the fiber orientation angles, edge conditions and plate length/width ratios. The classical laminated plate theory is used to calculate the n...
On-line political communities, such as the Norwegian site Demokratitorget (Democracy Square), are often designed according to a set of un-reflected assumptions about the political interests of their potential members. In political science, democracy is not taken as given in this way, but can be represented by different models which characterize different relationships between politicians and th...
This paper presents a multi-objective genetic algorithm (MOGA) with Pareto optimality and elitist tactics for the control system design of automated guided vehicle (AGV). The MOGA is used to identify AGV driving system model and optimize its servo control system sequentially. In system identification, the model identified by least square method is adopted as an evolution tutor who selects the i...
The runtime of evolutionary algorithms (EAs) depends critically on their parameter settings, which are often problem-specific. Automated schemes for parameter tuning have been developed to alleviate the high costs of manual parameter tuning. Experimental results indicate that self-adaptation, where parameter settings are encoded in the genomes of individuals, can be effective in continuous opti...
Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) O(mN3) computational complexity (where m is the number of objectives and N is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algo...
A hybrid sliding level Taguchi-based particle swarm optimization (HSLTPSO) algorithm is proposed for solving multi-objective flowshop scheduling problems (FSPs). The proposed HSLTPSO integrates particle swarm optimization, sliding level Taguchi-based crossover, and elitist preservation strategy. The novel contribution of the proposed HSLTPSO is the use of a PSO to explore the optimal feasible r...
This study presents an adaptive two-layer particle swarm optimization algorithm with elitist learning strategy (ATLPSO-ELS), which has better search capability than classical particle swarm optimization. In ATLPSO-ELS, we perform evolution on both the current swarm and the memory swarm, motivated by the tendency of the latter swarm to distribute around the problem’s optima. To achieve better co...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید