Author

Chen

Date of Award

4-1996

Degree Name

Master of Science in Engineering

Department

Electrical and Computer Engineering

First Advisor

Dr. Garrison Greenwood

Second Advisor

Dr. Arthur White

Third Advisor

Dr. Ajay Gupta

Access Setting

Masters Thesis-Open Access

Abstract

Frequency allocation problem (F AP) is to assign radio frequencies to a number of stations subject to a number of constraints, so that the minimum interference is suffered. FAP is NP-complete. In order to solve FAPs, there are interference constraints to be satisfied. There are two constraints of FAP which were the focus of this study: (1) co-channel interference, (2) adjacent channel interference.

Evolutionary Strategies (ESs) are very efficient optimization algorithms based upon the principles of adaptive selection found in nature. In this study, a (μ,A)ES algorithm was implemented to solve instances of FAP.

This thesis has demonstrated that an ES algorithm is able to find the optimum or the near optimum solutions for FAPs. First, a small FAP was used to optimize the parameters of the algorithm. Then, the optimized algorithm was used to solve three real-world FAPs consisting of 10, 20 or 50 stations respectively. All the solutions were found on a SUN SPARC 1 workstation.

Share

COinS