Multi-objective optimization in area coverage problems for cellular communication networks: evaluation of an elitist evolutionary strategy

Authors:
Larry Raisanen;Roger M. Whitaker
Affiliations:
Cardiff University, The Parade Cardiff, U.K.;Cardiff University, The Parade Cardiff, U.K.
Venue:
Proceedings of the 2003 ACM symposium on Applied computing
Year:
2003

Citing 6
Cited 1

A study of permutation crossover operators on the traveling salesman problem

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Genetic algorithms as prototyping tools for multi-agent systems: application to the antenna parameter setting problem

IATA '98 Proceedings of the second international workshop on Intelligent agents for telecommunication applications
Optimum positioning of base stations for cellular radio networks

Wireless Networks
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization

Proceedings of the 5th International Conference on Genetic Algorithms
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach

IEEE Transactions on Evolutionary Computation

On heterogeneous sensor node placement

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cellular wireless networks transmit signals from base stations, over an area commonly referred to a as a cell, to provide local area coverage to subscribers. As the power of transmission is restricted, multiple cells are required to provide wide area coverage. When operators set up or expand a network, multiple potential sites are normally available. A subset of these potential sites must be chosen to form the network subject to multiple, competing objectives. In this paper, we investigate the application of a simple, steady state evolutionary algorithm to choose the best sites for optimizing the objectives. This approach generates a Pareto set of cell plans, which removes the need for a cellular network designer to rank, or weight objectives a priori, as in many proposed meta-heuristic optimization approaches. The problem specification, algorithm performance, and quality of results are delineated.