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 条
  • [21] CF-GGA: a grouping genetic algorithm for the cell formation problem
    Brown, EC
    Sumichrast, RT
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2001, 39 (16) : 3651 - 3669
  • [22] A new grouping genetic algorithm approach to the multiple traveling salesperson problem
    Singh, Alok
    Baghel, Anurag Singh
    SOFT COMPUTING, 2009, 13 (01) : 95 - 101
  • [23] Improved Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows
    Ding, Genhong
    Mao, Juncheng
    Ding, Yuchen
    PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND SERVICE SYSTEM (CSSS), 2014, 109 : 595 - 598
  • [24] A grouping genetic algorithm with controlled gene transmission for the bin packing problem
    Quiroz-Castellanos, Marcela
    Cruz-Reyes, Laura
    Torres-Jimenez, Jose
    Gomez, Claudia S.
    Huacuja, Hector J. Fraire
    Alvin, Adriana C. F.
    COMPUTERS & OPERATIONS RESEARCH, 2015, 55 : 52 - 64
  • [25] A New Grouping Genetic Algorithm for the MapReduce Placement Problem in Cloud Computing
    Xu, Xiaoyong
    Tang, Maolin
    2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 1601 - 1608
  • [26] A new grouping genetic algorithm approach to the multiple traveling salesperson problem
    Alok Singh
    Anurag Singh Baghel
    Soft Computing, 2009, 13 : 95 - 101
  • [27] A grouping genetic algorithm for the multi-objective cell formation problem
    Yasuda, K
    Hu, L
    Yin, Y
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2005, 43 (04) : 829 - 853
  • [28] Dynamic airspace sectorization via improved genetic algorithm
    Yangzhou Chen
    Hong Bi
    Defu Zhang
    Zhuoxi Song
    Journal of Modern Transportation, 2013, (02) : 117 - 124
  • [29] Dynamic airspace sectorization via improved genetic algorithm
    Chen Y.
    Bi H.
    Zhang D.
    Song Z.
    Journal of Modern Transportation, 2013, 21 (2): : 117 - 124
  • [30] Hybrid grouping genetic algorithm for one-dimensional cutting stock problem
    School of Transportation, Wuhan Univ. of Technology, Wuhan 430063, China
    Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2006, 40 (06): : 1015 - 1018