Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Annals of Operations Research - Special issue on Tabu search
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
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
A Heuristic Approach for Antenna Positioning in Cellular Networks
Journal of Heuristics
ENCON: an evolutionary algorithm for the antenna placement problem
Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
A Permutation Based Genetic Algorithm for Minimum Span Frequency Assignment
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
On optimal design of multitier wireless cellular systems
IEEE Communications Magazine
Optimal location of transmitters for micro-cellular radio communication system design
IEEE Journal on Selected Areas in Communications
A comparison of randomized and evolutionary approaches for optimizing base station site selection
Proceedings of the 2004 ACM symposium on Applied computing
The infrastructure efficiency of cellular wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal antenna placement using a new multi-objective chc algorithm
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Survivable and delay-guaranteed backbone wireless mesh network design
Journal of Parallel and Distributed Computing
Personalised subscription pricing for optimised wireless mesh network deployment
Computer Networks: The International Journal of Computer and Telecommunications Networking
Active GSM cell-id tracking: "Where Did You Disappear?"
Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments
A Comparative Investigation on Heuristic Optimization of WCDMA Radio Networks
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
The infrastructure efficiency of cellular wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Antenna location design for generalized distributed antenna systems
IEEE Communications Letters
Wireless heterogeneous transmitter placement using multiobjective variable-length genetic algorithm
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
Optimising mobile base station placement using an enhanced Multi-Objective Genetic Algorithm
International Journal of Business Intelligence and Data Mining
A hybrid nature-inspired optimizer for wireless mesh networks design
Computer Communications
Optimising CDMA Cell Planning with Soft Handover
Wireless Personal Communications: An International Journal
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
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.