Multiobjective evolutionary algorithm test suites
Proceedings of the 1999 ACM symposium on Applied computing
Optimum positioning of base stations for cellular radio networks
Wireless Networks
A polynomial-time approximation scheme for base station positioning in UMTS networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Multi-Tier Cellular Network Dimensioning
Wireless Networks
An agent based approach to site selection for wireless networks
Proceedings of the 2002 ACM symposium on Applied computing
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
A Heuristic Approach for Antenna Positioning in Cellular Networks
Journal of Heuristics
Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Automated Decision Technology for Network Design in Cellular Communication Systems
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 3 - Volume 3
Comparison and evaluation of multiple objective genetic algorithms for the antenna placement problem
Mobile Networks and Applications
IEEE Transactions on Evolutionary Computation
IEEE Journal on Selected Areas in Communications
Design a breeze sensor system based on electric field via two-elemental direction
Expert Systems with Applications: An International Journal
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
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.