Breeding Permutations for Minimum Span Frequency Assignment

  • C. L. Valenzuela
  • A. Jones
  • S. Hurley


This paper describes a genetic algorithm for solving the minimum span frequency assignment problem (MS-FAP). The MSFAP involves assigning frequencies to each transmitter in a region, subject to a number of constraints being satisfied, such that the span, i.e. range of frequencies used, is minimised. The technique involves finding an ordering of the transmitters for use in a sequential (greedy) assignment process. Results are given for several practical problem instances.


Genetic Algorithm Frequency Assignment Sequential Assignment Frequency Assignment Problem Channel Assignment Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    L. Anderson. A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunications system. IEEE Transactions on Communications, 21:1294–1301, 1973.CrossRefGoogle Scholar
  2. [2]
    D. Castelino, S. Hurley, and N.M. Stephens. A tabu search algorithm for frequency assignment. Annals of Operations Reasearch, 63:301–319, 1996.MATHCrossRefGoogle Scholar
  3. [3]
    D.J. Cavicchio. Adaptive search using simulated evolution. Unpublished Doctorial Dissertation, 1970.Google Scholar
  4. [4]
    W. Crompton, S. Hurley, and N.M. Stephens. A parallel genetic algorithm for frequency assignment problems. In IMACS/ IEEE Internation Symposium on signal Processing, Robotics and Neural Networks, pages 81–84, France, 1994.Google Scholar
  5. [5]
    D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, 1989.Google Scholar
  6. [6]
    M. Gorges-Schulter. Asparagos: An asynchronos parallel genetic optimization strategy. In Proceedings of the Third International Conference on Genetic Algorithms, Hillsdale, NJ, 1989. Lawrence Erlbaum Assocciates.Google Scholar
  7. [7]
    J.H. Holland. Adaptation in the Natural and Artificial Systems. Ann Arbor: University of Michigan Press, 1975.Google Scholar
  8. [8]
    S. Hurley and D.H. Smith. Fixed spectrum frequency assignment using natural algorithms. In Proceedings of the First International Conference on Genetic Algorithms in Engineering Systems, pages 373–378, Sheffield, September 1995.Google Scholar
  9. [9]
    D.H. Smith and S. Hurley. Bounds for the frequency assignment problem. Discrete Mathematics. To Appear.Google Scholar
  10. [10]
    D.H. Smith and S.U. Thiel. Frequency assignment algorithms. Final report, Radiocommunications Agency Agreement, March 1996.Google Scholar
  11. [11]
    G. Syswerda. Uniform crossover in genetic algorithms. In Proceedings of the Third International Conference on Genetic Algoritms, Hillsdale, NJ, 1989. Lawrence Erlbaum Associates.Google Scholar
  12. [12]
    C.L. Valenzuela. Evolutionary divide and conquer (i): A novel genetic approach to the TSR Unpublished Doctoral Thesis, 1995.Google Scholar
  13. [13]
    D. Whitley. Scheduling problems and travelling salesman: The genetic edge recombination operator. In J.D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 133–140, San Mateo, 1989. Morgan Kauffman.Google Scholar

Copyright information

© Springer-Verlag Wien 1998

Authors and Affiliations

  • C. L. Valenzuela
    • 1
  • A. Jones
    • 2
  • S. Hurley
    • 2
  1. 1.School of Computing and MathematicsUniversity of TeessideMiddlesbroughUK
  2. 2.Department of Computer ScienceUniversity of Wales, CardiffCardiffUK

Personalised recommendations