Cell planning with capacity expansion in mobile communications: a tabu search approach

Abstract

Cell planning problem with capacity expansion is examined in wireless Computational results show that the proposed tabu search is highly effective. 10% cost reduction is obtained by the diversification strategies. The gap from the optimal solutions is approximately 1∼5 % in problems that can be handled in appropriate time limits. The proposed tabu search also outperforms the parallel genetic algorithm. The cost reduction by the tabu search approaches 10~20 % in problems with 2,500 traffic demand areas in CDMA.2

Self-organized Clustering for Improved Interference Mitigation in White Spaces

“…As the proposed linear program is a variation of the setcovering problem it is not scalable with the number of CPEs and BSs [26]. Nevertheless, as illustrated in the results, it provides a valuable comparison basis for configurations with a small number of CPEs.…”

Tabu Search: A Comparative Study

“…There are many other application fields and problems in which TS is used. For example: Cell planning with capacity expansion in mobile communications (Lee & Kang, 2000), application-level synthesis methodology for multidimensional embedded processing systems (Alippi et al 2003). Cogotti et al (2000) performed a comparison of optimization techniques for Loney's Solenoids Design and proposed an alternative TS algorithm.…”

Genetic Tabu search for robust fixed channel assignment under dynamic traffic data

“…Tabu search is a meta-heuristic well known for its ability to escape from local optima. The last decade has seen the multiplication of works on Tabu search in the field of telecommunications and notably radio networks [25,39]. Tabu search is a local heuristic based on the four principals: -Define the manner to construct the neighborhood of a solution and the kind of move to use.…”