Article ID: | iaor20082554 |
Country: | United Kingdom |
Volume: | 34 |
Issue: | 6 |
Start Page Number: | 1842 |
End Page Number: | 1856 |
Publication Date: | Jun 2007 |
Journal: | Computers and Operations Research |
Authors: | Smith Alice E., Kim Sung-Soo, Lee Jong-Hyun |
Keywords: | communication, heuristics: genetic algorithms |
A new problem encoding is devised for the minimum span frequency assignment problem in wireless communications networks which is compact and general. Using the new encoding, which reduces search space dramatically over previous problem encodings, an optimization algorithm is developed which combines a genetic algorithm global search with a computationally efficient local search method from the literature. This memetic algorithm is shown to be more effective than six previous approaches in the literature on a suite of established test problems. Further, it shown that the integration of the global search with the local search is important; neither component by itself is nearly as effective.