Channel assignment optimisation using a hyper-heuristic
Channel assignment optimisation using a hyper-heuristic
复制标题
使用超启发式方法优化信道分配
DOI：
10.1109/iccis.2004.1460689
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
Mazlan Mohamad
中科院分区：
文献类型：
--
作者：
G. Kendall;Mazlan Mohamad
信道分配问题是移动通信行业的一个现实问题。主要目标是找到移动网络内不同话务需求分布的最小频率带宽，除了满足信道需求要求外，还必须考虑最小信道复用距离，以避免同小区或相邻小区内的呼叫干扰的影响。以前的方法使用了图形着色算法、启发式搜索、神经网络、模拟退火和遗传算法（CA）。在本文中，我们提出了一种超启发式方法，并将我们的方法与文献中的通道分配问题进行比较
The channel assignment problem is a real world problem from the mobile communications industry. The primary objective is to find the minimum frequency bandwidth given different traffic demand distribution within the mobile network, besides fulfilling the channel demand requirement, we must also consider the minimum channel reuse distance in order to avoid the effect of call interference within the same cell or adjacent cells. Previous approaches have used graph-colouring algorithms, heuristic search, neural networks, simulated annealing and genetic algorithms (CA). In this paper, we propose a hyper-heuristic methodology and compare our approach against channel assignment problems from the literature