Parallel Genetic Algorithms for Third Generation Mobile Network Planning

Authors:
Carsten Maple;Liang Guo;Jie Zhang
Affiliations:
University of Luton, UK;University of Luton, UK;University of Luton, UK
Venue:
PARELEC '04 Proceedings of the international conference on Parallel Computing in Electrical Engineering
Year:
2004

Citing 0
Cited 7

Metaheuristics for optimization problems in computer communications

Computer Communications
Hardware implementation of a novel genetic algorithm

Neurocomputing
Optimal placement of antennae using metaheuristics

NMA'06 Proceedings of the 6th international conference on Numerical methods and applications
Comparison of different meta-heuristics to solve the global planning problem of UMTS networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimisation of CDMA-based mobile telephone networks: algorithmic studies on real-world networks

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
A Dimensioning Study for UMTS Core Networks

International Journal of Business Data Communications and Networking
An Analysis of Traffic and Throughput for UMTS Packet Core Networks

International Journal of Interdisciplinary Telecommunications and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

As Third Generation (3G) mobile networks start to be implemented, there is a need for effective network planning. However, deciding upon the optimum placement for the base stations of the networks is a complex task requiring vast computational resource. This paper discusses the conflicting objectives of base station planning and characterises a multi-objective optimisation problem. We present a genetic encoding of the third generation mobile network planning problem and parallel genetic algorithms to solve it.