Reactive GRASP with path relinking for channel assignment in mobile phone networks

Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications

Volumn , Issue , 2001, Pages 60-67

  Gomes, Fernando C ^a   Pardalos, Panos ^b   Oliveira, Carlos S ^b   Resende, Mauricio G C ^c  

^a FEDERAL UNIVERSITY OF CEARÁ   (Brazil)

^b UNIVERSITY OF FLORIDA   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANTENNAS; CELLULAR RADIO SYSTEMS; COMMUNICATION CHANNELS (INFORMATION THEORY); FREQUENCIES; MOBILE TELECOMMUNICATION SYSTEMS; SIGNAL INTERFERENCE;

FREQUENCY ASSIGNMENT PROBLEM (FAP);

TELECOMMUNICATION NETWORKS;

EID: 0035790141     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/381448.381456     Document Type: Conference Paper

References (32)

1. K. Aardal, C. A. Hurkens, J. K. Lenstra, and S. R. Tiourine. Algorithms for frequency assignment problems. CWI Quarterly, 9, 1996.
2. K. Aardal, C. A. J. Hurkens, J. K. Lenstra, and S. R. Tiourine. An overview of algorithmic approaches to frequency assignment problems, CALMA project. Technical report, Dep. of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, Holanda, 1995.
3. K. I. Aardal, A. Hipolito, C. P. M. Van Hoesel, B. Jansen, C. Roos, and T. Terlaky. A branch-and-cut algorithm for the frequency assignment problem. Technical report, Eindhoven University, 1998.
4. R.M. Alex, M.G.C. Resende, P.M. Pardalos, and G. Toraldo. GRASP and path relinking for the three-index assignment problem. Technical report, AT&T Labs Research, Florham Park, NJ, 2000.
5. R. Borndörfer, A. Eisenblätter, M. Grötschel, and A. Martin. Frequency assignment in cellular phone networks. Annals of Operations Research, 76:73-93, 1998.
6. D. Brélaz. New methods to color the vertices of a graph. Communications of ACM, 22(4):251-256, April 1979.
7. A. Capone and M. Trubian. Channel assignment problem in cellular systems: A new model and a tabu search algorithm. IEEE Transactions on Vehicular Technology, 48(4):1252-1260, July 1999.
8. D. Costa. On the use of some known methods for T-colorings of graphs. Annals of Operations Research, 41:343-358, 1993.
9. S. Hurley D. Castelino and N. M. Stephens. A tabu search algorithm for frequency assignment. Annals of Operations Research, 63:301-319, 1996.
10. H. Delmaire, J. A. Díaz, E. Fernández, and M. Ortega. Comparing new heuristics for the pure integer capacitated plant location problem. Technical Report DR97/10, Department of Statistics and Operations Research, Universitat Politecnica de Catalunya, Barcelona, Spain, 1997.
11. M. Duque-Antón, D. Kunz, and B. Rüber. Channel assignment for cellular radio using simulated annealing. IEEE Transactions on Vehicular Technology, 42(1):14-21, 1993.
12. A. Eisenblätter. A frequency assignment problem in cellular phone networks (extended abstract). In Network Design, Connectivity and Facility Location, volume 35 of Dimacs Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1997.
13. T. A. Feo and M. G. C. Resende. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8:67-71, 1989.
14. T. A. Feo and M. G. C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109-133, 1995.
15. T. A. Feo, M. G. C. Resende, and S. H. Smith. A greedy randomized adaptive search procedure for maximum independent set. Operations Research, 42:860-878, 1994.
16. T. A. Feo, K. Venkatraman, and J. F. Bard. A GRASP for a difficult single machine scheduling problem. Computers & Operations Research, 18:635-643, 1991.
17. P. Festa and M. G. C. Resende. GRASP: An annotated bibliography. To appear in "Essays and Surveys on metaheuristics," P. Hansen and C.C. Ribeiro, eds., Kluwer Academic Publishers, 2001.
18. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, Boston, 1997.
19. W. K. Hale. Frequency assignment: Theory and applications. Proceedings of the IEEE, 68(12):1497-1513, December 1980.
20. C. A. Hjorring. The vehicle routing problem and local search metaheuristics. PhD thesis, University of Auckland, Auckland, New Zealand, 1995.
21. C. Hurkens and S. Tiourine. Upper and lower bounding techniques for frequency assignment problems. Technical report, Eindhoven University, 1995.
22. B. Jumard, O. Marcotte, and C. Meyer. Mathematical models and exact methods for channel assignment in cellular networks. Les Cahiers du GERAD, March 1998.
23. B. Jumard and T. Vovor. A column generation approach for the exact solution of channel assignment problems. Les Cahiers du GERAD, July 1998.
24. M. Laguna and R. Martí. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing, 11:44-52, 1999.
25. W. K. Lai and G. G. Coghill. Channel assignment through evolutionary optimization. IEEE Transactions on Vehicular Technology, 45(1), February 1996.
26. X. Liu, P. M. Pardalos, S. Rajasekaran, and M. G. C. Resende. A GRASP for frequency assignment in mobile radio networks. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 52:195-201, 2000.
27. R. A. Murphey, P. M. Pardalos, and M. G. C. Resende. Frequency assignment problems. In D.-Z. Du and P. M. Pardalos, editors, Handbook of Combinatorial Optimization, volume 4, pages 295-377. Kluwer Academic Publishers, 1999.
28. C. A. S. Oliveira. Alocação de freqüências para telefonia celular: Urea solução através do procedimento de busca guloso adaptativo aleatório. Master's thesis, Universidade Federal do Ceará, 2000.
29. J. Peemöller. A correction to Brelaz's modification of Brown's coloring algorithm. Communications of ACM, 26(8):595-599, August 1983.
30. M. Prais and C. C. Ribeiro. Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing, 12(3):164-176, 2000.
31. A. Quellmalz, A. Knälmann, and B. Müller. Efficient frequency assignment with simulated annealing. In IEEE ninth international conference on antennas and propagation, volume 2, Eindhoven, The Netherlands, 1995.
32. Z. Tuza. Graph colorings with local constraints a survey. Discussiones Mathematicae Graph Theory, 17(2):161-228, 1997.