A grouping genetic algorithm for the microcell sectorization problem

被引:21
|
作者
Brown, EC [1 ]
Vroblefski, M [1 ]
机构
[1] Virginia Tech, Dept Business Informat Technol, Blacksburg, VA 24061 USA
关键词
code-division multiple-access; dynamic channel allocation; genetic algorithm; grouping genetic algorithm; microcell sectorization; wireless communication networks;
D O I
10.1016/j.engappai.2004.08.003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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. (C) 2004 Elsevier Ltd. All rights reserved.
引用
收藏
页码:589 / 598
页数:10
相关论文
共 50 条
  • [31] A Steady-State Grouping Genetic Algorithm for the Rainbow Spanning Forest Problem
    Ghoshal S.
    Sundar S.
    SN Computer Science, 4 (4)
  • [32] A GENETIC ALGORITHM APPROACH TO THE MACHINE-COMPONENT GROUPING PROBLEM WITH MULTIPLE OBJECTIVES
    VENUGOPAL, V
    NARENDRAN, TT
    COMPUTERS & INDUSTRIAL ENGINEERING, 1992, 22 (04) : 469 - 480
  • [33] Grouping Genetic Algorithm for Data Clustering
    Peddi, Santhosh
    Singh, Alok
    SWARM, EVOLUTIONARY, AND MEMETIC COMPUTING, PT I, 2011, 7076 : 225 - 232
  • [34] A multiple-objective grouping genetic algorithm for the cell formation problem with alternative routings
    E. Vin
    P. De Lit
    A. Delchambre
    Journal of Intelligent Manufacturing, 2005, 16 : 189 - 205
  • [35] A Novel Grouping Genetic Algorithm for the One-Dimensional Bin Packing Problem on GPU
    Ozcan, Sukru Ozer
    Dokeroglu, Tansel
    Cosar, Ahmet
    Yazici, Adnan
    COMPUTER AND INFORMATION SCIENCES, ISCIS 2016, 2016, 659 : 52 - 60
  • [36] A Hybrid Grouping Genetic Algorithm for the Inventory Routing Problem with multi-tours of the Vehicle
    Sadok, A.
    Teghem, J.
    Chabchoub, H.
    INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS, 2010, 1 (02): : 42 - 61
  • [37] Cooperative parallel grouping genetic algorithm for the one-dimensional bin packing problem
    Kucukyilmaz, Tayfun
    Kiziloz, Hakan Ezgi
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 125 : 157 - 170
  • [38] A multiple-objective grouping genetic algorithm for the cell formation problem with alternative routings
    Vin, E
    De Lit, P
    Delchambre, A
    JOURNAL OF INTELLIGENT MANUFACTURING, 2005, 16 (02) : 189 - 205
  • [39] A genetic algorithm-based grouping method for a cell formation problem with the efficacy measure
    Salehi M.
    Tavakkoli-Moghaddam R.
    International Journal of Industrial and Systems Engineering, 2010, 6 (03) : 340 - 359
  • [40] A Hybrid Grouping Genetic Algorithm for the Multiple-Type Access Node Location Problem
    Alonso-Garrido, O.
    Salcedo-Sanz, S.
    Agustin-Blas, L. E.
    Ortiz-Garcia, E. G.
    Perez-Bellido, A. M.
    Portilla-Figueras, J. A.
    INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING, PROCEEDINGS, 2009, 5788 : 376 - 383