蜂窝移动网络中切换蜂格的禁忌搜索算法

无线通信网络的设计是一个复杂的过程，许多困难的组合优化问题需要联立求解。这里用禁忌搜索算法致力于解决这个设计优化问题。在蜂窝单元指派交换机时定义了一系列应用于初始解的移动，以改进费用和建立解的可行性。给出了一个能更新程序的增益结构来有效地选择当前邻域中最优解。

Taboo Search for Assignment of Cells to Switches in Cellular Mobile Network

The design of wireless telecommunications networks is a complex process, which requires solving simultaneously many difficult combinatorial optimization problems. A taboo search approach dedicated to the cell assignment problem is proposed in this paper. This approach defines a series of moves applicable to an initial solution in order to improve the cost and establish the feasibility of the solution. A gain structure with update procedures to efficiently choose the best solution in the current neighborhood is proposed.