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 条
  • [1] Grouping Genetic Algorithm for the Blockmodel Problem
    James, Tabitha
    Brown, Evelyn
    Ragsdale, Cliff T.
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2010, 14 (01) : 103 - 111
  • [2] A Grouping Genetic Algorithm for the Intercell Scheduling Problem
    Wang, Shuai
    Du, Shaofeng
    Ma, Tao
    Li, Dongni
    2018 IEEE 14TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2018, : 956 - 961
  • [3] A New Grouping Genetic Algorithm for the Multiple Knapsack Problem
    Fukunaga, Alex S.
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 2225 - 2232
  • [4] A grouping genetic algorithm for the multiple traveling salesperson problem
    Brown, Evelyn C.
    Ragsdale, Cliff T.
    Carter, Arthur E.
    INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY & DECISION MAKING, 2007, 6 (02) : 333 - 347
  • [5] A hybrid grouping genetic algorithm for the cell formation problem
    James, Tabitha L.
    Brown, Evelyn C.
    Keeling, Kellie B.
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (07) : 2059 - 2079
  • [6] Solution to grouping problem with constraints using improved genetic algorithm
    Chuan-Yun X.
    Dan Y.
    Lei Z.
    Advances in Information Sciences and Service Sciences, 2011, 3 (11): : 114 - 123
  • [7] A Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows
    Giselher Pankratz
    OR Spectrum, 2005, 27 : 21 - 41
  • [8] A new grouping genetic algorithm for the quadratic multiple knapsack problem
    Singh, Alok
    Baghel, Anurag Singh
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2007, 4446 : 210 - +
  • [9] A hybrid grouping genetic algorithm for reviewer group construction problem
    Chen, Yuan
    Fan, Zhi-Ping
    Ma, Jian
    Zeng, Shuo
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (03) : 2401 - 2411
  • [10] Grouping Genetic Algorithm for Solving the Server Consolidation Problem with Conflicts
    Agrawal, Shubham
    Bose, Sumit Kumar
    Sundarrajan, Srikanth
    WORLD SUMMIT ON GENETIC AND EVOLUTIONARY COMPUTATION (GEC 09), 2009, : 1 - 8