Multi-Objective Optimization Using Evolutionary AlgorithmsWiley, 05.07.2001 - 497 Seiten Evolutionary algorithms are relatively new, but very powerful techniques used to find solutions to many real-world search and optimization problems. Many of these problems have multiple objectives, which leads to the need to obtain a set of optimal solutions, known as effective solutions. It has been found that using evolutionary algorithms is a highly effective way of finding multiple effective solutions in a single simulation run.
The integrated presentation of theory, algorithms and examples will benefit those working and researching in the areas of optimization, optimal design and evolutionary computing. This text provides an excellent introduction to the use of evolutionary algorithms in multi-objective optimization, allowing use as a graduate course text or for self-study. |
Im Buch
Ergebnisse 1-3 von 46
Seite 198
... O 11 60 20 8 ოქ 40 6o Figure 110 The ... share 2 / ( N - 1 ) . Table 17 lists these normalized niching parameter values for a few cases by finding Oshare from the above equation . It is intuitive that as the population size increases , the ...
... O 11 60 20 8 ოქ 40 6o Figure 110 The ... share 2 / ( N - 1 ) . Table 17 lists these normalized niching parameter values for a few cases by finding Oshare from the above equation . It is intuitive that as the population size increases , the ...
Seite 206
... sharing function implementation . The first task requires at most O ( MN2 ) complexity ( refer to Section 2.4 above ) . The sharing function implementation requires every solution in a front to be compared with every other solution in ...
... sharing function implementation . The first task requires at most O ( MN2 ) complexity ( refer to Section 2.4 above ) . The sharing function implementation requires every solution in a front to be compared with every other solution in ...
Seite 212
Kalyanmoy Deb. = = Using a share 0.5 , we observe that only one solution c2 is within the Oshare distance from solution ... O ( N2 ) . If the size of tdom is of the same order as N , the overall complexity is O ( MN2 ) . 5.10.3 Advantages ...
Kalyanmoy Deb. = = Using a share 0.5 , we observe that only one solution c2 is within the Oshare distance from solution ... O ( N2 ) . If the size of tdom is of the same order as N , the overall complexity is O ( MN2 ) . 5.10.3 Advantages ...
Inhalt
Prologue | 1 |
ParetoOptimality | 32 |
Classical Methods | 48 |
Urheberrecht | |
16 weitere Abschnitte werden nicht angezeigt.
Andere Ausgaben - Alle anzeigen
Multi-Objective Optimization using Evolutionary Algorithms Kalyanmoy Deb Eingeschränkte Leseprobe - 2001 |
MULTI-OBJECTIVE OPTIMIZATION USING EVOLUTIONARY ALGORITHMS Kalyanmoy Deb Keine Leseprobe verfügbar - 2010 |
Multi-Objective Optimization Using Evolutionary Algorithms Kalyanmoy Deb Keine Leseprobe verfügbar - 2009 |
Häufige Begriffe und Wortgruppen
best non-dominated better calculated choose chosen constraint violation convergence convex corresponding created crossover operator decision variable space discussed distance distribution diversity dominated solutions elite elitist equation Euclidean distance evaluated evolution strategy evolutionary algorithms Evolutionary Computation f₁ feasible solution fitness values genetic algorithm genetic operations goal programming goal programming problem hypercube infeasible solutions local search mating pool maximum metric Minimize minimum MOEA multi-objective optimization problem mutation operator niche count non-dominated front non-dominated set nonconvex NPGA NSGA NSGA-II number of solutions objective function values objective space obtained non-dominated solutions obtained solutions offspring population optimal solutions optimum Oshare parameter parent solutions Pareto Pareto-optimal region Pareto-optimal set Pareto-optimal solutions performed population members procedure random real-parameter schema search space selection operator set of solutions shown in Figure shows simulation solving SPEA Step strategy string subpopulation suggested technique test problems tournament selection trade-off solutions true Pareto-optimal front w₁ WBGA weight vector
Verweise auf dieses Buch
Data Mining and Knowledge Discovery with Evolutionary Algorithms Alex A. Freitas Eingeschränkte Leseprobe - 2002 |