A study of permutation operators for minimum span frequency assignment using an order based representation

Article English OPEN
Mumford, Christine Lesley (2001)
  • Publisher: Springer-Verlag
  • Subject: QA | QA75 | QA76

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\ud over previously published results.
  • References (17)
    17 references, page 1 of 2

    [1] Allen, S. M., Hurley, S. and Smith, D. H. Lower Bounds for Frequency Assignment, in Methods and Algorithms for Radio Channel Assignment, edited by R. A. Leese, (to be published by Oxford University Press).

    [2] Cavicchio, D.J. Adaptive search using simulated evolution. Unpublished doctorial dissertation, University of Michigan, Ann Arbor.

    [3] Clark, T., and Smith, G.D. A Practical Frequency Planning Technique for Cellular Radio. Proceedings of the Third International Conference on Artificial Neural Nets and Genetic Algorithms. Pages 312-316.

    [4] Crisan, Christine and Mu¨hlenbein, Heinz. The Breeder Genetic Algorithm for Frequency Assignment. Proceedings of the 5th International Conference on Parallel Problem Solving from Nature (PPSN V), Amsterdam, The Netherlands, 1998. Pages 897- 906.

    [5] Crompton, W., Hurley, S. and Stephens, N.M. A parallel genetic algorithm for frequency assignment problems. Proceedings IMACS/IEEE Conference on Signal Processing, Robotics and Neural Networks, pages 81 - 84, Lille, France, 1994.

    [6] Davis, L. Order-Based Genetic Algorithms and the Graph Coloring Problem. In Handbook of Genetic Algorithms, Van Nostrand Reinhold, pages 72 - 90.

    [7] Elmore, Patricia B., and Woehlke, Paula L. Basic Statistics, Longman 1997.

    [8] Gamst, A. Some lower bounds for a class of frequency assignment problems. IEEE Transactions on Vehicular Technology, 35: pages 8 - 14.

    [11] Hurley, S., Smith, D. and Thiel, S. FASoft: A system for discrete channel frequency assignment. Radio Science 32 , pages 1921-1939.

    [12] Leese, R. A. A unified approach to the assignment of radio channels on a hexagonal grid. IEEE Transactions on Vehicular Technology, Vol. 46, No 4, pages 968-980

  • Metrics
    0
    views in OpenAIRE
    0
    views in local repository
    30
    downloads in local repository

    The information is available from the following content providers:

    From Number Of Views Number Of Downloads
    Online Research @ Cardiff - IRUS-UK 0 30
Share - Bookmark