Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
A genetic algorithm for flowshop sequencing
Computers and Operations Research - Special issue on genetic algorithms
Dynamic channel assignment in wireless communication networks
International Journal of Network Management
Genetic Algorithms and Grouping Problems
Genetic Algorithms and Grouping Problems
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
A hybrid grouping genetic algorithm for assigning students to preferred laboratory groups
Expert Systems with Applications: An International Journal
A hybrid grouping genetic algorithm for citywide ubiquitous WiFi access deployment
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Near optimal citywide WiFi network deployment using a hybrid grouping genetic algorithm
Expert Systems with Applications: An International Journal
Computers and Operations Research
A novel grouping harmony search algorithm for the multiple-type access node location problem
Expert Systems with Applications: An International Journal
A new grouping genetic algorithm for clustering problems
Expert Systems with Applications: An International Journal
Task-driven e-manufacturing resource configurable model
Journal of Intelligent Manufacturing
Expert Systems with Applications: An International Journal
Engineering Applications of Artificial Intelligence
Solution approaches to the course timetabling problem
Artificial Intelligence Review
A particle swarm optimizer for grouping problems
Information Sciences: an International Journal
Hi-index | 0.01 |
The number of wireless users has steadily increased over the last decade, leading to the need for methods that efficiently use the limited bandwidth available. Reducing the size of the cells in a cellular network increases the rate of frequency reuse or channel reuse, thus increasing the network capacity. The drawback of this approach is increased costs associated with installation and coordination of the additional base stations. A code-division multiple-access network where the base stations are connected to the central station by fiber has been proposed to reduce the installation costs. To reduce the coordination costs and the number of handoffs, sectorization (grouping) of the cells is suggested. We propose a dynamic sectorization of the cells, depending on the current sectorization and the time-varying traffic. A grouping genetic algorithm is proposed to find a solution which minimizes costs. The computational results demonstrate the effectiveness of the algorithm across a wide range of problems. The GGA is shown to be a useful tool to efficiently allocate the limited number of channels available.