Optimal switch location in mobile communication networks using hybrid genetic algorithms

Applied Soft Computing Journal

Volumn 8, Issue 4, 2008, Pages 1486-1497

  Salcedo Sanz, Sancho ^a   Portilla Figueras, Jose A ^a   Ortiz García, Emilio G ^a   Pérez Bellido, Angel M ^a   Thraves, Christopher ^b   Fernández Anta, Antonio ^c   Yao, Xin ^d  

^a UNIVERSITY OF ALCALÁ   (Spain)

^b UNIVERSITY OF CHILE   (Chile)

^c UNIVERSIDAD REY JUAN CARLOS   (Spain)

^d UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Heuristics; Hybrid genetic algorithms; Switch location problem; Wireless communications networks

Indexed keywords

COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; MOBILE TELECOMMUNICATION SYSTEMS; WIRELESS TELECOMMUNICATION SYSTEMS;

CAPACITATED P-MEDIAN PROBLEMS; HEURISTICS; HYBRID GENETIC ALGORITHMS; LOCAL SEARCH HEURISTICS; MOBILE COMMUNICATION NETWORKS; OPTIMAL POSITIONING; SWITCH LOCATION PROBLEM; WIRELESS COMMUNICATIONS NETWORKS;

PROBLEM SOLVING;

EID: 50349101710     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2007.10.021     Document Type: Article

References (34)

1. Menon S., and Gupta R. Assigning cells to switches in cellular networks by incorporating a pricing mechanism into simulated annealing. IEEE Trans. Syst. Man Cybern. B 34 1 (2004) 558-565
2. Krishnamachari B., and Wicker S. Base station location optimization in cellular wireless networks using heuristic search algorithms. In: Wang L. (Ed). Soft Computing in Communications (2003), Springer
3. Merchant A., and Sengupta B. Assignment of cells to switches in PCS networks. IEEE/ACM Trans. Network. 3 5 (1995) 521-526
4. Pierre S., and Houéto F. Assigning cells to switches in cellular mobile networks using taboo search. IEEE Trans. Syst. Man Cyben. B 32 3 (2002) 351-357
5. Quintero A., and Pierre S. Assigning cells to switches in cellular mobile networks: a comparative study. Comput. Commun. 26 (2003) 950-960
6. Riis M. Deployment of mobile switching centers in a telecommunications network: a stochastic programming approach. Telecomm. Syst. 26 1 (2004) 93-109
7. Soni S., Narasimhan S., and LeBlanc L. Telecommunication access network design with reliability constraints. IEEE Trans. Reliability 53 4 (2004) 532-541
8. Jüttner A., Orbán A., and Fiala Z. Two new algorithms for UMTS access network topology design. Eur. J. Oper. Res. 164 (2005) 456-474
9. Pomerleau Y., Chamberland S., and Pesant G. A constraint programming approach for the design problem of cellular wireless networks. Proceedings of IEEE Canadian Conference on Electrical and Computer Engineering. Canada (2003) 881-884
10. Abolhassani B., Salt J.E., and Dodds D. A two-phase genetic K-means algorithm for placement of radioports in cellular networks. IEEE Trans. Syst. Man Cybern. B 34 1 (2004) 533-538
11. Chamberland S. A efficient heuristic for the expansion problem of cellular wireless networks. Comput. Oper. Res. 31 (2004) 1769-1791
12. Chu C.H., Premkumar G., and Chou H. Digital data networks design using genetic algorithms. Eur. J. Oper. Res. 127 (2000) 140-158
13. Kershembaum A. Telecommunications Network Design Algorithms (1993), McGraw-Hill
14. Pirkul H., Narasimhan S., and De P. Locating concentrators for primary and secondary coverage in a computer communications network. IEEE Trans. Commun. 36 4 (1988) 450-457
15. Abuali F.N., Schoenefeld D.A., and Wainwright R.L. Terminal assignment in a communications network using genetic algorithms. Proceedings of the 22sd Annual ACM Computer Science Conference (1994), ACM Press 74-81
16. Khuri S., and Chiu T. Heuristic algorithms for the terminal assignment problem. Proceedings of the 1997 ACM Symposium on Applied Computing (1997), ACM Press 247-251
17. Salcedo-Sanz S., and Xin Yao. A hybrid Hopfield network-genetic algorithm for the terminal assignment problem. IEEE Trans. Syst. Man Cybern. B 34 6 (2004) 2343-2353
18. Yao X., Wang F., Padmanabham K., and Salcedo-Sanz S. Hybrid evolutionary approaches to terminal assignment in communication networks. In: Hart W., Krasnogor N., and Smith J.E. (Eds). Recent Advances in Memetic Algorithms and Related Search Technologies (2004), Springer-Verlag 129-159
19. Santos-Correa E., Steiner M.T., Freitas A.A., and Carnieri C. A genetic algorithm for solving a capacitated p-median problem. Numer. Algorithms 35 4 (2004) 373-388
20. Mateus G., and Fanqueira R.V. Model and heuristic for a generalizated access network design problem. Telecommun. Syst. 15 (2000) 257-271
21. Cortés P., Larrañeta J., Onieva L., García J.M., and Caraballo M.S. Genetic algorithm for planning cable telecommunication networks. Appl. Soft Comput. 1 1 (2001) 21-33
22. Rosenberg E. Dual ascent for uncapacitated telecommunications network design with access, backbone, and switch costs. Telecommun. Syst. 16 3 (2001) 423-435
23. Pizzolato N.D., Broseghini-Barcelos F., and Nogueira-Lorena L.A. School location methodology in urban areas of developing countries. Int. Trans. Oper. Res. 11 (2004) 667-681
24. Maniezzo V., Mingozzi A., and Badacci R. A bionomic approach to the capacitated p-median problem. J. Heuristics 4 3 (1998) 263-280
25. Goldberg D. Genetic Algorithms in Search, Optimization and Machine Learning (1989), Addison-Wesley, Reading, MA
26. Salcedo-Sanz S., Camps-Valls G., Pérez-Cruz F., Sepúlveda-Sanchís J., and Bousoño-Calzón C. Enhancing genetic feature selection through restricted search and Walsh analysis. IEEE Trans. Syst. Man Cybern. 34 4 (2004) 398-406
27. Salcedo-Sanz S., and Su J. Improving metaheuristics convergence properties in inductive query by example using two strategies for reducing the search space. Comput. Oper. Res. 34 1 (2007) 91-106
28. Pacheco J.A., and Casado S. Solving two location models with few facilities by using a hybrid heuristic: a real health resources case. Comput. Oper. Res. 32 12 (2005) 3075-3091
29. Alp O., Erkut E., and Drezner Z. An efficient genetic algorithm for the p-median problem. Ann. Oper. Res. 122 (2003) 21-41
30. K. Hackbarth, A. Portilla-Figueras, C. Díaz, Cost models for telecommunication networks and their application to GSM systems, Encyclopedia of Multimedia Technology and Networking, Idea Group, 2005.
31. Hackbarth K., Portilla-Figueras A., Kulenkampf G., and González F. Cost and network models and their applications in telecommunications issues. Proceedings of the 13th Biennial International Telecommunication Society Conference. Madrid, Spain (2002)
32. Courcoubetis C., and Weber R. Pricing Communication Networks (2003), Wiley & Sons Ltd.
33. European Commission, European Commission Recommendation About Interconnections. Second Part: Cost Accounting and Account Division, April 8, 1998, DOCE L 146 May 13, 1998, pp. 6-35.
34. K. Neumann et al., Mobile Termination Cost Model for Australia, Wik Consult, January 2007.