Comparison and evaluation of multiple objective genetic algorithms for the antenna placement problem

  • Authors:
  • Larry Raisanen;Roger M. Whitaker

  • Affiliations:
  • Centre for Mobile Communications, Department of Computer Science, Cardiff University, Queens Buildings, The Parade, P.O. Box 916, Cardiff CF24 3XF, UK;Centre for Mobile Communications, Department of Computer Science, Cardiff University, Queens Buildings, The Parade, P.O. Box 916, Cardiff CF24 3XF, UK

  • Venue:
  • Mobile Networks and Applications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The antenna placement problem, or cell planning problem, involves locating and configuring infrastructure for cellular wireless networks. From candidate site locations, a set needs to be selected against objectives relating to issues such as financial cost and service provision. This is an NP-hard optimization problem and consequently heuristic approaches are necessary for large problem instances. In this study, we use a greedy algorithm to select and configure base station locations. The performance of this greedy approach is dependent on the order in which the candidate sites are considered. We compare the ability of four state-of-the-art multiple objective genetic algorithms to find an optimal ordering of potential base stations. Results and discussion on the performance of the algorithms are provided.