LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Mumford, Christine Lesley (2001)
Publisher: Springer-Verlag
Languages: English
Types: Article
Subjects: 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.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [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
    • [13] Nagata, Yuichi and Kobayashi, Shigenobu. Edge Assembly crossover: A high-power genetic algorithm for the traveling salesman problem. Proceedings of the 7th International Conference on Genetic Algorithms. Morgan Kaufmann, 1997. Pages 450-457.
    • [14] Oliver, I.M., Smith, D.J., and Holland, J.R.C. A study of permutation crossover operators on the traveling salesman problem. Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, pages 224-230.
    • [15] Smith, D., Hurley, S. and Thiel, S. Improving heuristics for the frequency assignment problem. European Journal of Operational Research, Vol. 107, No 1, pages 76-86, ISSN 0377-2217..
    • [16] Syswerda, G. Uniform Crossover in Genetic algorithms. Proceedings of the Third International Conference on Genetic Algorithms. Hillsdale, NJ: Lawrence Erlbaum Associates.
    • [17] Valenzuela, Christine L. Evolutionary Divide and Conquer: a Novel Genetic approach to the TSP. Unpublished Doctorial Thesis, Imperial College, University of London 1995.
    • [18] Valenzuela, C.L. ,Jones A. and Hurley, S. Breeding Permutations for Minimum Span Frequency Assignment. Proceedings of the Third International Conference on Artificial Neural Nets and Genetic Algorithms. Pages 308 - 311
    • [19] Valenzuela, Christine, Hurley, Steve, and Smith, Derek . A Permutation Based Genetic Algorithm for Minimum Span Frequency Assignment. Proceedings of the 5th International Conference on Parallel Problem Solving in Nature, Amsterdam, The Netherlands 1998. Pages 907-916.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article