An efficient heuristic for the expansion problem of cellular wireless networks

Computers and Operations Research

Volumn 31, Issue 11, 2004, Pages 1769-1791

  Chamberland, Steven ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

Cellular networks; Facility location and type selection; Tabu search; Topological expansion

Indexed keywords

COSTS; HEURISTIC METHODS; PROBLEM SOLVING;

NETWORK EXPANSION; NETWORK SUBSYSTEM (NSS);

CELLULAR RADIO SYSTEMS;

HEURISTICS; TELECOMMUNICATIONS;

EID: 1942533501     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(03)00119-9     Document Type: Article

References (17)

1. Yacoub M.D. Wireless technology-protocols, standards, and techniques 2001 CRC Press Boca Raton, FL
2. Krishnamachari B, Wicker SB. Optimization of fixed network design in cellular systems using local search algorithms. Proceedings of the Vehicular Technology Conference Fall, 2000. p. 1632-8.
3. Skorin-Kapov D. Skorin-Kapov J. On tabu search for the location of interacting hub facilities European Journal of Operational Research 73 3 1994 502-509
4. Sohn J. Park S. Efficient solution procedure and reduced size formulations for p-hub location problems European Journal of Operational Research 108 1 1998 118-126
5. Beaubrun R, Pierre S, Conan J. An efficient method for optimizing the assignment of cells to MSCs in PCS networks. Proceedings International Conference on Wireless Communications, 1999. p. 259-65.
6. Bhattacharjee PS, Saha D, Mukherjee A. Heuristics for assignment of cells to switches in a PCSN: A comparative study. Proceedings of the IEEE International Conference on Personal Wireless Communications, 1999. p. 331-4.
7. Merchant A. Sengupta B. Assignment of cells to switches in PCS networks IEEE/ACM Transactions on Networking 3 5 1995 521-526
8. Pierre S. Houéto F. A tabu search approach for assigning cells to switches in cellular mobile networks Computer Communications 25 5 2002 465-478
9. Saha D. Mukherjee A. Bhattacharjee P. A simple heuristic for assignment of cell to switches in a PCS network Wireless Personal Communication 12 2 2000 209-224
10. Dutta A. Kubat P. Design of partially survivable networks for cellular telecommunication systems European Journal of Operational Research 118 1 1999 52-64
11. Shahbaz M. Fixed network design of cellular mobile communication networks using genetic algorithms. Proceedings of the IEEE International Conference on Universal Personal Communications, 1995. p. 163-7.
12. Shahbaz M. Random guided algorithms for fixed network design of cellular mobile communication networks. Proceedings of the International Teletraffic Congress, 1997. p. 255-64.
13. Kubat P. Smith J.M. Yum C. Design of cellular networks with diversity and capacity constraints IEEE Transactions on Reliability 49 2 2000 165-175
14. Kubat P. Smith J.M. A multi-period network design problem for cellular telecommunication systems European Journal of Operational Research 134 2 2001 439-456
15. Glover F. Laguna M. Tabu search 1997 Kluwer Academic Publisher Boston, MA
16. Jonker R. Volgenant T. A shortest augmenting path algorithm for dense and sparse linear assignment problems Computing 38 4 1987 325-340
17. ILOG.ILOG CPLEX 7.1-advanced reference manual. Incline Vallage, NV: ILOG Inc., 2001.