Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
D. Castelino, S. Hurley, and N.M. Stephens. A tabu search algorithm for frequency assignment. Annals of Operations Reasearch, 63:301–319, 1996.
D.J. Cavicchio. Adaptive search using simulated evolution. Unpublished Doctorial Dissertation, 1970.
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.
D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, 1989.
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.
J.H. Holland. Adaptation in the Natural and Artificial Systems. Ann Arbor: University of Michigan Press, 1975.
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.
D.H. Smith and S. Hurley. Bounds for the frequency assignment problem. Discrete Mathematics. To Appear.
D.H. Smith and S.U. Thiel. Frequency assignment algorithms. Final report, Radiocommunications Agency Agreement, March 1996.
G. Syswerda. Uniform crossover in genetic algorithms. In Proceedings of the Third International Conference on Genetic Algoritms, Hillsdale, NJ, 1989. Lawrence Erlbaum Associates.
C.L. Valenzuela. Evolutionary divide and conquer (i): A novel genetic approach to the TSR Unpublished Doctoral Thesis, 1995.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Wien
About this paper
Cite this paper
Valenzuela, C.L., Jones, A., Hurley, S. (1998). Breeding Permutations for Minimum Span Frequency Assignment. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6492-1_67
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6492-1_67
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83087-1
Online ISBN: 978-3-7091-6492-1
eBook Packages: Springer Book Archive