From Theory to Practice: An Evolutionary Algorithm for the Antenna Placement Problem

  • Jörg Zimmermann
  • Robin Höns
  • Heinz Mühlenbein
Part of the Natural Computing Series book series (NCS)


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.


Directive Antenna Traffic Demand Optimization Phase Candidate Site Frequency Assignment Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Allan, A. O. (1978) Probability, Statistics, and Queueing Theory. Academic Press, New YorkGoogle Scholar
  2. 2.
    Crisan, C., Mühlenbein, H. (1998) The breeder genetic algorithm for frequency assignment. Lecture Notes in Computer Science, 1498, 897–906CrossRefGoogle Scholar
  3. 3.
    Crisan, C., Mühlenbein, H. (1998) The frequency assignment problem: A look at the performance of evolutionary search. Lecture Notes in Computer Science, 1363, 263–273CrossRefGoogle Scholar
  4. 4.
    Eidenbenz, S., Stamm, C., Widmayer, P. (1998) Positioning guards at fixed height above a terrain — an optimum inapproximability result. Lecture Notes in Computer Science, 1461, 187–198MathSciNetCrossRefGoogle Scholar
  5. 5.
    Fonseca, C. M., Flemmings, P. (1995) An overview of evolutionary algorithms in multi-objectives optimization. Evolutionary Computation, 3, 1–16CrossRefGoogle Scholar
  6. 6.
    Fonseca, C. M., Flemmings, P. (1996) On the performance assessment and comparison of stochastic multi-objective optimizers. Lecture Notes in Computer Science, 1141 Google Scholar
  7. 7.
    Goldberg, D. E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MAzbMATHGoogle Scholar
  8. 8.
    John, B., Jianmin, J., James, D. (1997) Simulation techniques for sensitivity analysis of multi-criteria models. European Journal of Operational Research, 103, 531–546zbMATHCrossRefGoogle Scholar
  9. 9.
    Lissajoux, T. et al. (1998) Genetic algorithms as prototyping tools for multi-agent systems: Application to the antenna parameter setting problem. Lecture Notes in Computer Science, 1437, 17–28CrossRefGoogle Scholar
  10. 10.
    Mitchell, M. et al. (1994) When will a genetic algorithm outperform hill climbing? Advances in Neural Information Processing Systems, 6, 51–58Google Scholar
  11. 11.
    Mouly, M., Pautet, M. B. (1992) The GSM System for Mobile Communications. Cell& Sys, PalaiseauGoogle Scholar
  12. 12.
    Mühlenbein, H. (1991) Evolution in time and space — the parallel genetic algorithm. In G. Rawlins, editor, Foundations of Genetic Algorithms, 316–337, Morgan-Kaufman, San MateoGoogle Scholar
  13. 13.
    Mühlenbein, H. (1992) How genetic algorithms really work: mutation and hill-climbing. In R. Männer and B. Manderick, editors, Parallel Problem Solving from Nature, 15–26, North-Holland, AmsterdamGoogle Scholar
  14. 14.
    Mühlenbein, H. (1997) The equation for the response to selection and its use for prediction. Evolutionary Computation, 5, 303–346CrossRefGoogle Scholar
  15. 15.
    Mühlenbein, H., Mahnig, T. (1999) FDA — a scalable evolutionary algorithm for the optimization of additively decomposed functions. Evolutionary Computation, 7 Google Scholar
  16. 16.
    Mühlenbein, H., Mahnig, T. (2000) Evolutionary algorithms: from recombination to distributions. to be published in Lecture Notes in Computer ScienceGoogle Scholar
  17. 17.
    Mühlenbein, H. et al. (1999) Schemata, distributions and graphical models in evolutionary optimization. Journal of Heuristics, 5, 215–247zbMATHCrossRefGoogle Scholar
  18. 18.
    Mühlenbein, H., Schlierkamp-Voosen, D. (1994) The science of breeding and its application to the breeder genetic algorithm. Evolutionary Computation, 1, 335–360CrossRefGoogle Scholar
  19. 19.
    Plehn, J. (1994) Applied frequency assignment. In Proceedings of the 1994 IEEE 44th Vehicular Technology Conference, StockholmGoogle Scholar
  20. 20.
    Renaud, D., Caminada, A. (1997) Evolutionary methods and operators for the frequency assignment problem. Speed Up, 11, 27–32Google Scholar
  21. 21.
    Reininger, P., Caminada, A. (1998) Model for GSM radio network optimization. In 2nd ACM International Conference on Discrete Algorithms and Methods for Mobility, DallasGoogle Scholar
  22. 22.
    Schwefel, H. P. (1995) Evolution and Optimum Seeking. Wiley-Inter-science, ChichesterGoogle Scholar
  23. 23.
    White, G. D. (1991) The Audio Dictionary. 2nd edition, University of Washington PressGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Jörg Zimmermann
    • 1
  • Robin Höns
    • 1
  • Heinz Mühlenbein
    • 1
  1. 1.RWCP Theoretical Foundation LabGMD - Center for Information TechnologySankt AugustinGermany

Personalised recommendations