From theory to practice: an evolutionary algorithm for the antenna placement problem

We give a short introduction to the results of our theoretical analysis of evolutionary algorithms. These results are used to design an algorithm for a large real-world problem: the placement of antennas for mobile radio networks. Our model for the antenna placement problem (APP) addresses cover, traffic demand, interference, different parameterized antenna types, and the geometrical structure of cells. The resulting optimization problem is constrained and multi-objective. The evolutionary algorithm derived from our theoretical analysis is capable of dealing with more than 700 candidate sites in the working area. The results show that the APP is tractable. The automatically generated designs enable experts to focus their efforts on the difficult parts of a network design problem.

[1]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[2]  Thomas Haug,et al.  The GSM System for Mobile Communications , 1992 .

[3]  Jürgen Plehn.  Applied frequency assignment , 1994, Proceedings of IEEE Vehicular Technology Conference (VTC).

[4]  Glenn D. White,et al.  The Audio Dictionary , 1987 .

[5]  Heinz Mühlenbein,et al.  The Equation for Response to Selection and Its Use for Prediction , 1997, Evolutionary Computation.

[6]  Peter J. Fleming,et al.  On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers , 1996, PPSN.

[7]  Alexandre Caminada,et al.  Genetic Algorithms as Prototyping Tools for Multi-Agent Systems: Application to the Antenna Parameter Setting Problem , 1998, IATA.

[8]  John H. Holland,et al.  When will a Genetic Algorithm Outperform Hill Climbing , 1993, NIPS.

[9]  Heinz Mühlenbein,et al.  The Frequency Assignment Problem: A Look at the Performance of Evolutionary Search , 1997, Artificial Evolution.

[10]  T. Mahnig,et al.  Evolutionary algorithms: from recombination to search distributions , 2001 .

[11]  Heinz Mühlenbein,et al.  How Genetic Algorithms Really Work: Mutation and Hillclimbing , 1992, PPSN.

[12]  Peter J. Fleming,et al.  An Overview of Evolutionary Algorithms in Multiobjective Optimization , 1995, Evolutionary Computation.

[13]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[14]  Arnold O. Allen,et al.  Probability, statistics and queueing theory - with computer science applications (2. ed.) , 1981, Int. CMG Conference.

[15]  Heinz Mühlenbein,et al.  The Breeder Genetic Algorithm for Frequency Assignment , 1998, PPSN.

[16]  Heinz Mühlenbein,et al.  Evolution in Time and Space - The Parallel Genetic Algorithm , 1990, FOGA.

[17]  Heinz Mühlenbein,et al.  FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions , 1999, Evolutionary Computation.

[18]  John C. Butler,et al.  Simulation techniques for the sensitivity analysis of multi-criteria decision models , 1997 .

[19]  Hans-Paul Schwefel,et al.  Evolution and Optimum Seeking: The Sixth Generation , 1993 .

[20]  Heinz Mühlenbein,et al.  Schemata, Distributions and Graphical Models in Evolutionary Optimization , 1999, J. Heuristics.

[21]  Arnold O. Allen.  Probability, Statistics, and Queueing Theory , 1978 .

[22]  Heinz Mühlenbein,et al.  The Science of Breeding and Its Application to the Breeder Genetic Algorithm (BGA) , 1993, Evolutionary Computation.

[23]  Stephan Eidenbenz,et al.  Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result , 1998, ESA.