An efficient methodology for optimal channel assignment of large and complex mobile radio networks

The channel assignment problem (CAP) is of major importance in the design of cellular mobile communication networks. Previous solutions to the problem are limited by their inability to solve globally and optimally complex channel assignment problems. A technique is presented that is capable of handling the real world CAP. The technique is based on the use of a binary integer linear program and an associated branch and bound algorithm. By considering a range of benchmark problems that have appeared in the literature, it is shown that the proposed technique has a significantly superior performance to other known techniques.