We present an exact algorithm for solving the channel assignment problem in cellular telephony networks. This problem consists of assigning sets of channels to the network cells in such a way that the channel demand is satisfied, while avoiding co-channel interference and adjacent channel interference and respecting the channel spacing constraint for each antenna. In a previous article (Jaumard, B., Marcotte, O., Meyer, C., Vovor, T., Comparison of column generation models for channel assignment in cellular networks, Discrete Applied Mathematics 118 (2002) 299–322), we formulated this problem as a covering problem in two different ways and compared these two formulations and another formulation both from a theoretical and computational point of view (by solving their linear relaxations). In the present article we focus on the best set covering formulation, where the subsets are sets of cells that can be assigned the same channel, and we actually solve two versions of the integer program. In the first version, we seek to minimize the unmet demand, while in the second, we seek to minimize the overall interference while assigning the required number of channels to each cell. In either version, the integer program is solved by an algorithm combining the column generation technique and a branch-and-cut scheme. Finally we present the solutions produced by these algorithms for some instances of European networks and real-life instances supplied by the Bell Mobilité company.
Paru en décembre 2003 , 36 pages
Ce cahier a été révisé en juin 2006