The automatic location of base-stations for optimised cellular coverage : a new combinatorial approach

Araceli Molina, GE Athanasiadou, AR Nix

Research output: Contribution to conferenceConference Abstract

316 Downloads (Pure)


The cost and complexity of a network is closely related to the number of base-stations (BSs) required to achieve the system operator's service objectives. The location of BSs is not an easy task and there are numerous factors that must be taken into account when deciding the optimum position of BSs. This paper discusses the performance of three different algorithms developed to solve the BS location problem: the greedy algorithm (GR), the genetic algorithm (GA) and the combination algorithm for total optimisation (CAT). These three methods are compared and results are given for a typical test scenario
Original languageEnglish
Pages606 - 610
Publication statusPublished - May 1999

Bibliographical note

Terms of use: Copyright © 1999 IEEE. Reprinted from Proceedings of IEEE Vehicular Technology Conference, Spring 1999. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to

By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Name of Conference: 49th Vehicular Technology Conference 1999 (VTC 1999-Spring)
Venue of Conference: Houston


  • genetic algorithms
  • cellular radio


Dive into the research topics of 'The automatic location of base-stations for optimised cellular coverage : a new combinatorial approach'. Together they form a unique fingerprint.

Cite this