Graph-based hybrid hyper-heuristic channel scheduling algorithm in multicell networks

Abstract

In this paper, we consider the scheduling problem that minimises the number of required channel without violation of traffic demand by considering the intercell interference and intracell interference simultaneously. This concerned problem is proved to be a non-deterministic polynomial-time hard problem. We propose a graph-based hyper-heuristic method composed of two level heuristics: the high level heuristic and a set of low level heuristics. A sequence of graph-based low level heuristics is generated to guide the channel assignment process, and then searching in the heuristic space by the high level heuristic obtains the best channel scheduling scheme. The performance is tested on 20 benchmark problems, which show that the proposed graph-based hyper-heuristic algorithm is effective and outperforms the existing method. Copyright © 2015 John Wiley & Sons, Ltd.