A genetic algorithm for frequency assignment with problem decomposition

International Journal of Mobile Network Design and Innovation

Volumn 1, Issue 2, 2006, Pages 102-112

  Colombo, Gualtiero ^a  

^a CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

Frequency Assignment Problem (FAP); Genetic Algorithm (GA); graph partitioning

Indexed keywords

EID: 34250223479     PISSN: 17442869     EISSN: 17442850     Source Type: Journal    
DOI: 10.1504/IJMNDI.2006.010812     Document Type: Article

References (27)

1. Allen, S.M., Dunkin, N., Hurley, S. and Smith, D. (1998) Frequency Assignment Problems: Benchmarks and Lower Bounds, University of Glamorgan.
2. Anderson, L.G. (1973) ‘A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system’, IEEE Transactions on Communications, Vol. 21, pp.1294ȓ1301.
3. Andreev, K. and Racke, H. (2004) ‘Balanced graph partitioning’, Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Barcelona, Spain, pp.120ȓ124.
4. Crisan, C. and Muhlenbein, H. (1997) ‘The frequency assignment problem: a look at the performance of evolutionary search’, Selected Papers from the Third European Conference on Artificial Evolution, pp.263ȓ274.
5. Dunkin, N. and Allen, S.M. (1998) ‘Frequency assignment problems: representations and solutions’, Technical Report, Royal Holloway, University of London.
6. Glover, F. (1989) ‘Tabu search – part 1’, ORSE Journal on Computing, Vol. 1, pp.190ȓ206.
7. Goldberg, D.A. and Richardson, J. (1987) ‘Genetic algorithms with sharing for multimodal function optimization’, Proceedings of the Second International Conference on Genetic Algorithms on Genetic Algorithms and their Application, Cambridge, MA, pp.41ȓ49.
8. Hale, W.H. (1980) ‘Frequency assignment: theory and application’, Proceedings of the IEEE, Vol. 68, pp.1497ȓ1514.
9. Hale, W.H. (1981) ‘New spectrum management tools’, Proceedings of the IEEE International Symposium on Electromagnetic Compatibility, Piscataway, NJ, pp.45ȓ47.
10. Holland, M.J.H. (1975) Adaptation in Natural and Artificial Systems, Ann Arbor: University of Michigan Press.
11. Hurley, S. and Smith, D. (1995) ‘Fixed spectrum frequency assignment using natural algorithms’, Proceedings IEE/IEEE International Conference on Genetic Algorithms in Engineering Systems, September, Sheffield, UK, pp.373ȓ378.
12. Hurley, S. and Smith, D. (2002) ‘Meta-heuristics and channel assignment’, in S. Hurley and R. Leese (Eds). Methods and Algorithms for Radio Channel Assignment, Oxford, UK: Oxford University Press, pp.22ȓ24.
13. Hurley, S., Smith, D. and Thiel, S.U. (1997) ‘FASoft: a system for discrete channel frequency assignment’, Radio Science, Vol. 32, pp.1921ȓ1939.
14. Hurley, S., Thiel, S.U. and Smith, D. (1996) ‘A comparison of local search algorithms for radio link frequency assignment problems’, Proceedings of the 1996 ACM Symposium on Applied Computing, Philadelphia, PA, pp.251ȓ257.
15. Karaoglu, N. and Manderick, B. (2005) ‘FAPSTER – a genetic algorithm for frequency assignment problem’, Proceedings of the 2005 Genetic and Evolutionary Computation Conference (GECCO), Washington, DC, USA.
16. Kirkpatrick, S., Gelatt, C.D. and Vecchi, P.M. (1983) ‘Optimization by simulated annealing’, Science, Vol. 220, pp.671ȓ680.
17. Koster, C.A., Van Hoesel C.P and Kolen, A.W. (1999) ‘Solving frequency assignment problems via tree-decomposition’, Technical Report, Maastricht University.
18. Lai, W.K. and Coghill, G.C. (1996) ‘Channel assignment through evolutionary optimization’, IEEE Transactions on Vehicular Technology, Vol. 45, pp.91ȓ95.
19. Maniezzo, V. and Montemanni, R. (2000) ‘An exact algorithm for the min-interference frequency assignment problem’, Technical Report, University of Bologna.
20. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, M. and Teller, E. (1953) ‘Equations of state calculations by fast computing machines’, Journal of Chemical Physics, Vol. 21, pp.1087ȓ1092.
21. Murphey, R.A., Pardalos, P.M. and Resende, M.G. (1999) ‘Frequency assignment problems’, Handbook of Combinatorial Optimization, Vol. 4, pp.1ȓ55.
22. Shazely, S., Baraka, H. and Abdel-Wahab, A. (1998) ‘Solving graph partitioning problem using genetic algorithms’, Proceedings of the 1998 Midwest Symposium on Circuits and Systems, Washington, DC, 09-12 August, pp.302ȓ305.
23. Sitharam, M. (2005) ‘Combinatorial approaches to geometric constraint solving: problems, progress and directions’, in R. Janardan, M. Smid and D. Dutta (Eds). Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, AMS-DIMACS, Vol. 67, pp.117ȓ164.
24. Smith, D., Allen, S. and Hurley, S. (2002) ‘Characteristics of good meta-heuristic algorihtms for the frequency assignment problem’, Annals of Operations Research, Vol. 107, pp.285ȓ301.
25. Smith, D., Allen, S., Hurley, S. and Watkins, W.J. (1998) ‘Frequency assignment: methods and algorithms’, NATO RTA SET/ISET Symposium on Frequency Assignment, Sharing and Conservation in Systems, Aalborg, Denmark.
26. Valenzuela, C.L. (2001) ‘A study of permutation operators for minimum span frequency assignment using an order based representation’, Journal of Heuristics, Vol. 1, pp.5ȓ21.
27. Wagner, F. and Stoer, M. (1997) ‘A simple min-cut algorithm’, Journal of the ACM, Vol. 44, pp.585ȓ591.