Constrained coverage optimisation for mobile cellular networks

Authors:
Lin Du;John Bigham
Affiliations:
Electronic Engineering Department, Queen Mary, University of London, London, United Kingdom;Electronic Engineering Department, Queen Mary, University of London, London, United Kingdom
Venue:
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Year:
2003

Citing 4
Cited 0

Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
The Theory of Virtual Alphabets

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization

Evolutionary Computation
Evolutionary algorithms for constrained parameter optimization problems

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper explores the use of evolutionary algorithms to optimise cellular coverage so as to balance the traffic 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 transformation-based 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.