A permutation based Genetic Algorithm for minimum span frequency assignment

摘要

We describe a Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP).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. the range of frequencies used, is minimized. The technique involves finding an ordering of the transmitters for use in a sequential (greedy) assignment process. Results are given which show that our GA produces optimal solutions to several practical problem instances, and compares favourably to simulated annealing and tabu search algorithms.