Comparison and Evaluation of Multiple Objective Genetic Algorithms for the Antenna Placement Problem

Whitaker, Roger Marcus ORCID: https://orcid.org/0000-0002-8473-1913 and Raisanen, Larry 2005. Comparison and Evaluation of Multiple Objective Genetic Algorithms for the Antenna Placement Problem. Mobile Networks and Applications 10 (1-2) , pp. 79-88. 10.1023/B:MONE.0000048547.84327.95

Full text not available from this repository.

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.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	Springer Verlag
ISSN:	15728153
Last Modified:	17 Oct 2022 09:00
URI:	https://orca.cardiff.ac.uk/id/eprint/1806

Citation Data

Cited 87 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item