A Variable Neighborhood Search Algorithm for Assigning Cells to Switches in Wireless Networks | Science Publications

Journal of Computer Science

Samuel Pierre¹  Matthieu Andr¹  Gilles Pesant¹ 

关键词: Cell Assignment;    Mobile Networks;    Variable Neighborhood Search;    Tabu Search;    Heuristics;   

DOI  :  10.3844/jcssp.2005.175.181

学科分类：计算机科学（综合）

来源: Science Publications

【 摘 要 】

The problem of assigning cells to switches in wireless networks consists of minimizing thetotal operating cost, that is, the cost of linking cells to switches and the cost of handover from one cellto another, by taking into account factors such as network topology, switch capacity and traffic load inthe entire network. Such a problem is well known in the literature as NP-hard, such that exactenumerative approaches are not suitable for solving real-size instances of this problem. Thus,heuristics are recommended and have been used for finding good solutions in reasonable executiontimes. Tabu Search (TS) is one of the best heuristics used to solve this problem. This research proposesa hybrid heuristic approach for further improving the quality of solutions obtained from TS. Thisapproach applies TS in combination with variable neighborhood search, a recent metaheuristic that isbased on the principle of systematic change of neighborhood during the local search.. A key element inthe success of this approach is the use of several neighborhood structures that complement each otherwell and that remain within the feasible region of the search space.

【 授权许可】

Unknown