Abstract
The genetic algorithm (GA) described in this paper breeds permutations of transmitters for minimum span frequency assignment. The approach hybridizes a GA with a greedy algorithm, and employs a technique called Generalized Saturation Degree to seed the initial population. Several permutation operators from the GA literature are compared, and results indicate that position based operators are more appropriate for this kind of problem than are order based operators. My offspring versus mid-parent correlation studies on crossovers show Pearson's correlation coefficient to be a reliable predictor of performance in most cases. Results presented herein represent improvements over previously published results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Allen, S.M., S. Hurley, and D.H. Smith. (1998). “Lower Bounds for Frequency Assignment.” Methods and Algorithms for Radio Channel Assignment. In R.A. Leese (ed.), Oxford University Press, Oxford, UK. A STUDY OF PERMUTATION OPERATORS 21
Cavicchio, D.J. (1970). “Adaptive Search Using Simulated Evolution.” Unpublished Doctorial Dissertation, University of Michigan, Ann Arbor.
Clark, T. and G.D. Smith. (1997). “A Practical Frequency Planning Technique for Cellular Radio.” Proceedings of the Third International Conference on Artificial Neural Nets and Genetic Algorithms, pp. 312–316.
Crisan, C. and H. Mühlenbein. (1998). “The Breeder Genetic Algorithm for Frequency Assignment.” Proceedings of the 5th International Conference on Parallel Problem Solving from Nature (PPSN V), Amsterdam, The Netherlands, pp. 897–906.
Crompton, W., S. Hurley, and N.M. Stephens. (1994). “A Parallel Genetic Algorithm for Frequency Assignment Problems.” Proceedings IMACS/IEEE Conference on Signal Processing, Robotics and Neural Networks, Lille, France, pp. 81–84.
Davis, L. (1991). “Order-Based Genetic Algorithms and the Graph Coloring Problem.” Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, pp. 72–90.
Elmore, P.B. and P.L. Woehlke. (1997). Basic Statistics. Longman, New York, 1997.
Gamst, A. (1986). “Some Lower Bounds for a Class of Frequency Assignment Problems.” IEEE Transactions on Vehicular Technology 35, 8–14.
Gorges-Schleuter, M. (1989). “ASPARAGOS an Asynchronous Parallel Genetic Optimization Strategy.” Proceedings of the Third International Conference on Genetic Algorithms. Hillsdale, NJ: Lawrence Erlbaum Associates.
Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor: The University of Michigan Press.
Hurley, S., D. Smith, and S. Thiel. (1997). “FASoft: A System for Discrete Channel Frequency Assignment.” Radio Science 32, 1921–1939.
Leese, R.A. (1997). “A Unified Approach to the Assignment of Radio Channels on a Hexagonal Grid.” IEEE Transactions on Vehicular Technology 46(4), 968–980.
Nagata, Y. and Shigenobu, K. (1997). “Edge Assembly Crossover: A High-Power Genetic Algorithm for the Traveling Salesman Problem.” Proceedings of the 7th International Conference on Genetic Algorithms. Morgan Kaufmann, Michigan State University, pp. 450–457.
Oliver, I.M., D.J. Smith, and J.R.C. Holland. (1987). “AStudy of Permutation Crossover Operators on the Traveling Salesman Problem.” Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, pp. 224–230.
Smith, D., S. Hurley, and S. Thiel. (1998). “Improving Heuristics for the Frequency Assignment Problem.” European Journal of Operational Research 107(1), 76–86. ISSN 0377-2217.
Syswerda, G. (1989). “Uniform Crossover in Genetic Algorithms.” Proceedings of the Third International Conference on Genetic Algorithms. Hillsdale, NJ: Lawrence Erlbaum Associates.
Valenzuela, C.L. (1995). “Evolutionary Divide and Conquer: A Novel Genetic Approach to the TSP.” Unpublished Doctorial Thesis, Imperial College, University of London.
Valenzuela, C.L., A. Jones, and S. Hurley. (1997). “Breeding Permutations for Minimum Span Frequency Assignment.” Proceedings of the Third International Conference on Artificial Neural Nets and Genetic Algorithms, pp. 308–311.
Valenzuela, C., S. Hurley, and D. Smith (1998). “A Permutation Based Genetic Algorithm for Minimum Span Frequency Assignment.” Proceedings of the 5th International Conference onParallel Problem Solving in Nature, Amsterdam, The Netherlands, pp. 907–916.
Whitley, D. (1989). “Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator.” Proceedings of the Third International Conference on Genetic Algorithms. San Mateo, CA. In J.D. Schaffer (ed.), Morgan Kaufmann, pp. 133–140.
Whitley, D. (1997) Handbook of Evolutionary Computation, Part C: Evolutionary Computation Models, Section C3.3. Institute of Physics Publishing.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Valenzuela, C.L. A Study of Permutation Operators for Minimum Span Frequency Assignment Using an Order Based Representation. Journal of Heuristics 7, 5–21 (2001). https://doi.org/10.1023/A:1026597127504
Issue Date:
DOI: https://doi.org/10.1023/A:1026597127504