A mathematical programming approach to the channel assignment problem in radio networks
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (10903038) , 736-740
- https://doi.org/10.1109/vetec.1996.501409
Abstract
The demand for mobile telephone service is increasing rapidly. A new formulation for the channel assignment problem (CAP) is proposed. The CAP has been formulated as an integer linear programming problem including compatibility and requirement constraints. For the solution of the resulting formulation conventional branch and bound methods have been used. The exploitation of the problem's special structure can improve the computational efficiency of the algorithm used. The algorithm has been applied to different benchmark problems that have appeared in the literature. The presented examples illustrate that using the proposed formulation and a specially designed branch and bound algorithm is possible to solve optimally and efficiently fairly large channel assignment problems.Keywords
This publication has 7 references indexed in Scilit:
- Subspace approach to channel assignment in mobile communication networksIEE Proceedings - Communications, 1995
- A genetic algorithm for channel assignment problemsEuropean Transactions on Telecommunications, 1994
- Channel assignment for cellular radio using simulated annealingIEEE Transactions on Vehicular Technology, 1993
- A neural network parallel algorithm for channel assignment problems in cellular radio networksIEEE Transactions on Vehicular Technology, 1992
- Suboptimum solutions obtained by the Hopfield-Tank neural network algorithmBiological Cybernetics, 1991
- Channel assignment for cellular radio using neural networksIEEE Transactions on Vehicular Technology, 1991
- Frequency assignment: Theory and applicationsProceedings of the IEEE, 1980