An efficient genetic algorithm for a fixed frequency assignment problem with limited bandwidth constraint
Shouichi Matsui, Isamu Watanabe, Ken‐ichi Tokoro · Systems and Computers in Japan · 2004
Abstract In this paper, we propose an efficient genetic algorithm (GA) for a fixed frequency assignment problem with limited bandwidth constraint. We propose a new GA‐based algorithm for the problem of minimizing the weighted sum of damage due to interference and damage due to blocked call, which was formulated by Jin and colleagues. The proposed algorithm, which uses a steady‐state GA that adaptively controls the mutation rate to search for an appropriate instruction sequence for a virtual machine performing the frequency assignment work, introduces a solution improvement algorithm based on a local search. The results of applying the proposed algorithm to benchmark problems, which show better performance than the existing GAs, indicate that this is an efficient algorithm. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(10): 32–39, 2004; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/scj.10677