Skip to main content
SpringerLink
Log in
Book cover

Workshops on Applications of Evolutionary Computation

EvoWorkshops 2003: Applications of Evolutionary Computing pp 199–210Cite as

Constrained Coverage Optimisation for Mobile Cellular Networks

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2611))

Abstract

This paper explores the use of evolutionary algorithms to optimise cellular coverage so as to balance the trafic load over the whole mobile cellular network. A transformation of the problem space is used to remove the principal power constraint. A problem with the intuitive transformation is shown and a revised transformation with much better performance is presented. This highlights a problem with transformationbased methods in evolutionary algorithms. While the aim of transformation is to speed convergence, a bad transformation can be counterproductive. A criterion that is necessary for successful transformations is explained. Using penalty functions to manage the constraints was investigated but gave poor results. The techniques described can be used as constraint-handling method for a wide range of constrained optimisations.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Togo, I. Yoshii, and R. Kohno. Dynamic cell-size control according to geographical mobile distribution in a ds/cdma cellular system. In The Proceedings of the Ninth IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, volume 2, pages 677–681, 1998.

    Google Scholar 

  2. D.E. Goldberg. Genetic Algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, Massachusetts, 1989.

    Google Scholar 

  3. Raphael Dorne and Jin-Kao Hao. An evolutionary approach for frequency assignment in cellular radio networks. In The Proceedings of IEEE InternationalConference on Evolutionary Computation, volume 2, pages 539–544, Perth, WA,Australia, 1995.

    Google Scholar 

  4. F.J. Ares-Pena, J.A. Rodriguez-Gonzalez, E. Villanueva-Lopez, and S.R. Rengarajan. Genetic algorithms in the design and optimization of antenna array patterns. IEEE Transactions on Antennas and Propagation, 47(3):506–510, March 1999.

    Article  Google Scholar 

  5. D.E. Goldberg. The theory of virtual alphabets. In H.P. Schwefel and R. Manner, editors, Parallel Problem Solving from Nature, pages 13–22. Springer-Verlag, 1990.

    Google Scholar 

  6. Alden H. Wright. Genetic algorithms for real parameter optimization. In Gregory J. E. Rawlins, editor, Foundations of Genetic Algorithms, pages 205–218. Morgan Kaufman, 1991.

    Google Scholar 

  7. C.Z. Janikow and Z. Michalewicz. An experimental comparison of binary and floating point representations in genetic algorithms. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 31–36, 1991.

    Google Scholar 

  8. L. Davis, editor. Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991.

    Google Scholar 

  9. L.J. Eshelman and J.D. Schaffer. Real-coded algorithms and interval schemata. In L.D. Whitley, editor, Foundations of Genetic Algorithms, pages 187–202, 1993.

    Google Scholar 

  10. Z. Michalewicz and C.Z. Janikow. Handling constraints in genetic algorithms. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 151–157, 1991.

    Google Scholar 

  11. Carlos A. Coello Coello. A survey of constraint handling techniques used with evolutionary algorithms. Technical report, Lania-RI-99-04, Laboratorio Nacional de Informatica Avanzada, Veracruz, Mexico, 2000.

    Google Scholar 

  12. Z. Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In Proceedings of the Fourth Annual Conference on Evolutionary Programming, pages 135–155, Cambridge, Massachusetts, 1995. The MIT Press.

    Google Scholar 

  13. S. Koziel and Z. Michalewicz. Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization. Evolutionary Computation, 7(1):19–44, 1999.

    Article  Google Scholar 

  14. Z. Michalewicz and M. Schoenauer. Evolutionary computation for constrained parameter optimization problems. Evolutionary Computation, 4(1):1–32, 1996.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electronic Engineering Department Queen Mary, University of London, E1 4NS, London, UK

    Lin Du & John Bigham

Authors
  1. Lin Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Bigham
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Engineering, University of Parma, Parco Area delle Scienze 181/a, 43100, Parma, Italy

    Stefano Cagnoni

  2. Computing Laboratory, University of Kent, Canterbury, Kent, CT2 7NF, UK

    Colin G. Johnson

  3. Dept. of Information and Communications Technologies Faculty of Computer Science, University of A Coruña, A Coruña, CP 15071, Spain

    Juan J. Romero Cardalda

  4. Dept. of Mathematics and Computer Science, Free University of Amsterdam, de Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Elena Marchiori

  5. Schol of Systems Engineering, University of Reading, PO Box 225, Whiteknights, Reading, RG6 6AY, UK

    David W. Corne

  6. AnimatLab, 8 rue du capitaine Scott, 75015, Paris, France

    Jean-Arcady Meyer  & Agnès Guillot  & 

  7. SAP AG, Neurottstrasse 16, 69190, Walldorf, Germany

    Jens Gottlieb

  8. Parallel Computing and Complex Systems Group, University of Leipzig, Augustusplatz 10/11, 04109, Leipzig, Germany

    Martin Middendorf

  9. Algorithms and Data Structures Group Institute of Computer Graphics, Vienna University of Technology, Favoritenstrasse 9-11/186, 1040, Vienna, Austria

    Günther R. Raidl

  10. School of Computing, Napier University, 219 Colinton Road, Edinburgh, EH14 1DJ, UK

    Emma Hart

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Du, L., Bigham, J. (2003). Constrained Coverage Optimisation for Mobile Cellular Networks. In: Cagnoni, S., et al. Applications of Evolutionary Computing. EvoWorkshops 2003. Lecture Notes in Computer Science, vol 2611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36605-9_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-36605-9_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00976-4

  • Online ISBN: 978-3-540-36605-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation