A New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique

We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each transmitter in a region satisfying a number of constraints. The proposed method involves finding and ordering of the transmitters for use in a greedy (sequential) assignment process, and it also utilizes graph theoretic constraint to reduce search space. Results are given which show that our GA produces optimal solutions to several practical problems, and the performance of our GA is far better than the existing GAs.

• Type: Conference
• Year: 2000
• Where: GECCO
• Authors: Shouichi Matsui, Ken-ichi Tokoro
• Keywords: Assignment Process, GECCO 2000, Graph Theoretic Constraint, Optimization, Span Frequency Assignment