Evolutionary Algorithms for Solving Multi-Objective Problems

Front Cover
Springer Science & Business Media, Aug 26, 2007 - Computers - 800 pages

Solving multi-objective problems is an evolving effort, and computer science and other related disciplines have given rise to many powerful deterministic and stochastic techniques for addressing these large-dimensional optimization problems. Evolutionary algorithms are one such generic stochastic approach that has proven to be successful and widely applicable in solving both single-objective and multi-objective problems.

This textbook is a second edition of Evolutionary Algorithms for Solving Multi-Objective Problems, significantly expanded and adapted for the classroom. The various features of multi-objective evolutionary algorithms are presented here in an innovative and student-friendly fashion, incorporating state-of-the-art research. The book disseminates the application of evolutionary algorithm techniques to a variety of practical problems, including test suites with associated performance based on a variety of appropriate metrics, as well as serial and parallel algorithm implementations.

From inside the book

Contents

Contents
1
Further Explorations
57
Further Explorations 123
122
MOEA Local Search and Coevolution
131
Further Explorations
171
Further Explorations
229
Further Explorations
277
MOEA Theory and Issues
283
Further Explorations 335
334
Further Explorations 437
436
Further Explorations
509
Further Explorations
541
Further Explorations
617
References
627
Index
761
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 10 - In words, this definition says that x* is Pareto optimal if there exists no feasible vector of decision variables x 6 T which would decrease some criterion without causing a simultaneous increase in at least one other criterion.
Page 39 - This optimum can be described as follows. Knowing the extremes of the objective functions which can be obtained by solving the optimization problems for each criterion separately, the desirable solution is the one which gives the smallest values of the relative increments of all the objective functions. The point x...
Page 5 - Multiobjective optimization (also called multicriteria optimization, multiperformance or vector optimization) can be defined as the problem of finding [13]: a vector of decision variables which satisfies constraints and optimizes a vector function whose elements represent the objective functions. These functions form a mathematical description of performance criteria which are usually in conflict with each other. Hence, the term "optimize" means finding such a solution which would give the values...
Page 91 - Average the fitness of individuals with the same rank, so that all of them will be sampled at the same rate. This procedure keeps the global population fitness constant while maintaining appropriate selective pressure, as defined by the function used.
Page 716 - In Proceedings of the 1998 IEEE International Conference on Systems, Man, and Cybernetics, La Jolla, California, IEEE, October 1998.
Page 283 - He who loves practice without theory is like the sailor who boards ship without a rudder and compass and never knows where he may cast