MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

 

Download:
Download as a PDF
by Eckart Zitzler
ftp://ftp.tik.ee.ethz.ch/pub/people/zitzler/Zitz2003a.pdf
Add To MetaCart

Abstract:

This paper gives an introduction into evolutionary computation, in particular in the light of multiobjective optimization, and demonstrates how evolutionary algorithms can be used to tackle a highly demanding application in telecommunications, namely the design of a network processor. 1 Introductory Example To illustrate the basic principles of multiobjective optimization and evolutionary algorithms, consider the following example: given is a set of items together with a profit and a weight associated with each item; the goal is to determine a subset of items such that the overall profit, i.e., the sum of the profits of the selected items, is maximum, while the overall weight, i.e., the sum of the weights of the selected items, is minimal. This problem is generally denoted as knapsack problem. Now assume that four items are available: a camera (weight = 750, profit=5), a thermos flask (weight = 1500, profit=8), a pocket knife (weight = 300, profit=7), and a book (weight = 1000, profit=3). The set of all possible selections contains 16

Citations

4828 Genetic Algorithms – Goldberg - 1989
938 Density Estimation for Statistics and Data Analysis – Silverman - 1986
462 Multi-objective optimization using evolutionary algorithms – Deb - 2001
348 No free lunch theorems for optimization – Wolpert, Macready - 1997
323 Genetic algorithms for multi-objective optimization: Formulation, discussion and generalization – Fonseca, Fleming - 1993
246 Multiple objective optimization with vector evaluated genetic algorithms – Schaffer - 1985
238 Evolutionary Algorithms for Solving Multi-Objective Problems – Coello, Veldhuizen, et al. - 2002
235 1993�. Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms – Srinivas�, Deb
208 A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II – Pratab, Deb, et al. - 2000
205 A niched Pareto genetic algorithm for multiobjective optimization: Evolutionary Computation – Horn, J, et al. - 1994
163 SPEA2: Improving the strength pareto evolutionary algorithm – Zitzler, Laumanns, et al. - 2002
136 Evolutionary computation: comments on the history and current state – Back, Hammel, et al. - 1997
112 Multiobjective optimization and multiple constraint handling with evolutionary algorithms - part I: A unified formulation – Fonseca, Fleming - 1995
87 The Pareto Archived Evolution Strategy: A new baseline algorithm for Pareto multiobjective optimisation – Knowles, Corne - 1999
79 A variant of evolution strategies for vector optimization – Kursawe - 1991
73 Genetic search strategies in multicriterion optimal design – Hajela, Lin - 1992
71 A multi-objective genetic local search algorithm and its application to flowshop scheduling – Ishibuchi, Murata - 1998
27 Convergence properties of some multi-objective evolutionary algorithms – Rudolph, Agapie - 2000
13 Archiving with guaranteed convergence and diversity in multi-objective optimization – Laumanns, Thiele, et al. - 2002