A comparison of randomized and evolutionary approaches for optimizing base station site selection

Raisanen, Lawrence Matthew, Whitaker, Roger Marcus ORCID: https://orcid.org/0000-0002-8473-1913 and Hurley, Stephen 2004. A comparison of randomized and evolutionary approaches for optimizing base station site selection. Presented at: ACM Symposium on Applied Computing SAC 2004, Nicosia, Cyprus, 14-17 March 2004. SAC '04 Proceedings of the 2004 ACM symposium on Applied computing. New York, NY: ACM, pp. 1159-1165. 10.1145/967900.968136

Full text not available from this repository.

Abstract

It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potential site locations, a subset needs to be selected which optimizes two critical objectives: service coverage and financial cost. As this is an NP-hard optimization problem, heuristic approaches are required for problems of practical size. Our approach consists of two phases which act upon a set of candidate site permutations at each generation. Firstly, a sequential greedy algorithm is designed to commission sites from an ordering of candidate sites, subject to satisfying an alterable constraint. Secondly, an evolutionary optimization technique, which is tested against a randomized approach, is used to search for orderings of candidate sites which optimize multiple objectives. The two-phase strategy is vigorously tested and the results delineated.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics Medicine MRC Centre for Neuropsychiatric Genetics and Genomics (CNGG)
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	ACM
Last Modified:	09 Aug 2024 13:56
URI:	https://orca.cardiff.ac.uk/id/eprint/43628

Citation Data

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

Actions (repository staff only)

Edit Item