A multi-objective approach to the Channel Assignment Problem

With the rapid growth of mobile communications, solving the channel assignment problem has now become a new challenge in research. In this paper, we present the channel assignment problem (CAP) from a multi-objective approach. From this new idea, the communication system can be easily managed in case of an unexpected rise in demand in some particular cells. We carry out the experiments with the Philadelphia problem.

[1]  Fred W. Glover,et al.  Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[2]  Nabanita Das,et al.  Coalesced CAP: an improved technique for frequency assignment in cellular networks , 2006, IEEE Transactions on Vehicular Technology.

[3]  Stephen Hurley,et al.  A tabu search algorithm for frequency assignment , 1996, Ann. Oper. Res..

[4]  Mahmoud Naghshineh,et al.  Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey , 1996 .

[5]  Antonio Capone,et al.  Channel assignment problem in cellular systems: a new model and a tabu search algorithm , 1999 .

[6]  Ulrich Killat,et al.  A new strategy for the application of genetic algorithms to the channel-assignment problem , 1999 .

[7]  Wei Wang,et al.  An adaptive local-search algorithm for the channel-assignment problem (CAP) , 1996 .

[8]  L. M. San José-Revuelta.  A new adaptive genetic algorithm for fixed channel assignment , 2007 .

[9]  Mahmoud Naghshineh,et al.  Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey , 2000, IEEE Communications Surveys & Tutorials.

[10]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[11]  Goutam Chakraborty,et al.  An efficient heuristic algorithm for channel assignment problem in cellular radio networks , 2001, IEEE Trans. Veh. Technol..

[12]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[13]  L. G. Anderson.  A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system , 1973 .

[14]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[15]  D. Kunz,et al.  Channel assignment for cellular radio using neural networks , 1991 .

[16]  Dietmar Kunz,et al.  Channel assignment for cellular radio using simulated annealing , 1993 .

[17]  J. Zoeliner,et al.  A Breakthrough in Spectrum Conserving Frequency Assignment Technology , 1977, IEEE Transactions on Electromagnetic Compatibility.

[18]  L M San Jose Revuelta.  A NEW ADAPTIVE GENETIC ALGORITHM FOR FIXED CHANNEL ASSIGNMENT , 2007 .

[19]  R.J. McEliece,et al.  Channel assignment in cellular radio , 1989, IEEE 39th Vehicular Technology Conference.

[20]  A. Gamst,et al.  Some lower bounds for a class of frequency assignment problems , 1986, IEEE Transactions on Vehicular Technology.

[21]  Rafael Martí,et al.  Intensification and diversification with elite tabu search solutions for the linear ordering problem , 1999, Comput. Oper. Res..

[22]  F. Box,et al.  A heuristic technique for assigning frequencies to mobile radio nets , 1978, IEEE Transactions on Vehicular Technology.