FASoft: A system for discrete channel frequency assignment

Radio Science

Volumn 32, Issue 5, 1997, Pages 1921-1939

  Hurley, S ^a   Smith, D H ^b   Thiel, S U ^a  

^a CARDIFF UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF GLAMORGAN   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SOFTWARE; HEURISTIC METHODS; NATURAL FREQUENCIES; ELECTRICAL ENGINEERING; RADIO;

DISCRETE CHANNEL FREQUENCY ASSIGNMENT;

FREQUENCY ALLOCATION; OPTIMIZATION;

ASSIGNMENT TECHNIQUE; BOUNDING PROCEDURES; COMPUTATIONAL TECHNIQUE; DISCRETE CHANNEL; MAXIMAL CLIQUE; OPTIMAL SOLUTIONS; SEQUENTIAL ASSIGNMENT; STATE OF THE ART;

EID: 0031233009     PISSN: 00486604     EISSN: None     Source Type: Journal    
DOI: 10.1029/97RS01866     Document Type: Article

References (35)

1. Anderson, L. G., A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system, IEEE Trans. Commun., COM-21, 1294-1301, 1973.
2. Bouju, A., J. F. Boyce, C. H. D. Dimitropoulos, G. vom Scheldt, and J. G. Taylor, Tabu search for the radio links frequency assignment problem, in Conference on Applied Decision Technologies: Modem Heuristic Methods, pp. 233-250, Brunel Univ., Uxbridge, England, 1995.
3. Costa, D., On the use of some known methods for T-colourings of graphs, Ann. Oper. Res., 41, 343-358, 1993.
4. Cozzens, M. B., and F. S. Roberts, T-colorings of graphs and the channel assignment problem, Congr. Numer., 35, 191-208, 1982.
5. Cozzens, M. B., and D.-I. Wang, The general channel assignment problem, Congr. Numer., 41, 115-129, 1984.
6. Crompton, W., S. Hurley, and N. M. Stephens, Frequency assignment using a parallel genetic algorithm, in Natural Algorithms for Signal Processing, vol. 2, pp. 26/1-26/8, Inst. of Electr. Eng., London, 1993.
7. Funabiki, N., and Y. Takefuji, A neural network parallel algorithm for channel assignment problems in cellular radio networks, IEEE Trans. Veh. Technol., 41, 430-437, 1992.
8. Gamst, A., Some lower bounds for a class of frequency assignment problems, IEEE Trans. Veh. Technol., 35, 8-14, 1986.
9. Glover, F., Heuristics for integer programming using surrogate constraints, Decis. Sci., 8, 156-166, 1977.
10. Glover, F., E. Taillard, and D. de Werra, A user's guide to tabu search, Ann. Oper. Res., 41, 3-28, 1993.
11. Goldberg, D. E., Genetic Algorithms in Search, Optimization and Machine Learning, Addison Wesley, Reading, Mass., 1989.
12. Hale, W. K., Frequency assignment: Theory and applications, Proc. IEEE, 68, 1497-1514, 1980.
13. Hale, W. K., New spectrum management tools, in Electromatic Compatibility Record, pp. 47-53, IEEE Press, Piscataway, N. J., 1981.
14. Holland, J. H., Adaption in Natural and Artificial Systems, Univ. of Mich. Press, Ann Arbor, 1975.
15. Hurley, S., and D. H. Smith, Fixed spectrum frequency assignment using natural algorithms, in Genetic Algorithms in Engineering Systems, pp. 373-378, Inst. of Electr. Eng., London, 1995.
16. Hurley, S., S. U. Thiel, and D. H. Smith, A comparison of local search algorithms for radio link frequency assignment problems, in ACM Symposium on Applied Computing, pp. 251-257, Assoc. for Comput. Mach., New York, 1996.
17. Janssen, J., and K. Kilakos, Polyhedral analysis of channel assignment problems, I, Tours, Techn. Rep. CDAM-96-17, London Sch. of Econ., London, 1996.
18. Kirkpatrick, S., C. D. Gelatt, and M. D. Vecchi. Optimization by simulated annealing, Science, 220(4598), 671-680, May 1983.
19. Kruskal, J. B., On the shortest spanning subtree of a graph and the travelling salesman problem, Proc. Am. Math. Soc., 7, 48-50, 1956.
20. Kunz, D., Channel assignment for cellular radio using neural networks, IEEE Trans. Veh. Technol., 40, 188-193, 1991.
21. Lai, W. K., and G. G. Coghill, Channel assignment through evolutionary optimization, IEEE Trans. Veh. Technol., 45, 91-95, 1996.
22. Lanfear, T. A., Graph theory and radio frequency assignment, technical report, NATO EMC Anal. Proj. 5, NATO Headquarters, Brussels, 1989.
23. Leese, R., Tiling methods for channel assignment in radio communication networks, paper presented at 3rd ICIAM Congress, Int. Congr. for Ind. and Appl. Math., Hamburg, Germany, 1996.
24. Leese, R., A unified approach to the assignment of radio channels on regular hexagonal grid, IEEE Trans. Veh. Technol., in press, 1997.
25. Lochtie, G. D., and M. J. Mehler, Channel assignment using a subspace approach to neural networks, in Antennas and Propagation, pp. 296-300, Inst. of Electr. Eng., London, 1995.
26. Metropolis, N., A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller, Equations of state calculations by fast computing machines, J. Chem. Phys., 27(6), 1087-1092, 1953.
27. Prosser, P., Hybrid algorithms for the constraint satisfaction problem, Comput. Intell., 9(3), 268-299, 1993.
28. Roberts, F. S., T-colorings of graphs: Recent results and open problems, Discrete Math., 93, 229-245, 1991.
29. Sivarajan, K. N., R. J. McEliece, and J. W. Ketchum, Channel assignment in cellular radio, in 39th Conference on Vehicular Technol., pp. 846-850, IEEE Press, Piscataway, N. J., 1989.
30. Smith, D. H., and S. Hurley, Bounds for the frequency assignment problem, Discrete Math., 167/168, 571-582, 1997.
31. Smith, D. H., S. Hurley, and S. U. Thiel, Improving heuristics for the frequency assignment problem, Eur. J. Oper. Res., in press, 1997.
32. Smith, G. D., A. Kapsalis, V. J. Rayward-Smith, and A. Kolen, Report 2.1: Implementation and testing of genetic algorithm approaches, technical report, EUCLID CALMA Radio Link Frequency Assignment Project, Dep. of Comput. Sci., Univ. of East Anglia, Norwich, England, 1995.
33. Volgenant, T, and R. Jonker, A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation, Eur. J. Operational Res., 9, 83-89, 1982.
34. Wang, W., and C. Rushforth, An adaptive local search algorithm for the channel assignment problem (cap), IEEE Trans. Veh. Technol., 45, 459-466, 1996.
35. Zoellner, J. A., and C. L. Beall, A breakthrough in spectrum conserving frequency assignment technology, IEEE Trans. Electromagn. Compat., EMC-19, 313-319, 1977.