Multi-Objective Optimization using Evolutionary AlgorithmsEvolutionary 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. |
Contents
Prologue | 1 |
MultiObjective Optimization | 13 |
Classical Methods | 49 |
Evolutionary Algorithms | 81 |
NonElitist MultiObjective Evolutionary Algorithms | 171 |
Elitist MultiObjective Evolutionary Algorithms | 239 |
Constrained MultiObjective Evolutionary Algorithms | 289 |
Salient Issues of MultiObjective Evolutionary Algorithms | 315 |
Applications of MultiObjective Evolutionary Algorithms | 447 |
Epilogue | 481 |
| 489 | |
| 509 | |
Other editions - View all
Common terms and phrases
assigned fitness best non-dominated better calculated choose chosen clusters constraint violation convergence convex corresponding created crossover operator decision variable space distribution diversity dominated solutions elitist equation Euclidean distance evaluated evolution strategy evolutionary algorithms external population f₁ f1 Figure feasible solution fitness assignment genetic algorithm genetic operations goal programming hypercube infeasible solutions local search mating pool maximum method metric Minimize f1(x minimum MOEA multi-objective optimization problem mutation operator mutation strength niche count non-dominated front non-dominated set non-dominated solutions nonconvex NPGA NSGA NSGA-II number of solutions objective function values objective space offspring population optimal solutions optimum Oshare parent solutions Pareto Pareto-optimal region Pareto-optimal set Pareto-optimal solutions performed population members procedure Pt+1 random real-parameter search space selection operator set of solutions sharing function shown in Figure shows simulation solving Step strategy string subpopulation suggested test problems tournament selection trade-off solutions true Pareto-optimal front w₁ WBGA weight vector
Popular passages
Page 508 - Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: Empirical results.
Page 489 - T 1996 Evolutionary Algorithms in Theory and Practice (New York: Oxford University Press...
Page 494 - Fogel, LJ., Angeline, PJ and Fogel, DB (1995). An Evolutionary Programming Approach to Self-Adaptation on Finite State Machines.
