Abstract
A three-stage algorithm of heuristic search methods and a neural network is presented for the channel assignment problem in cellular mobile communication systems. This NP-complete problem requires to find a channel assignment to requested calls with the minimum number of channels subject to interference constraints between channels. The proposed algorithm consists of 1) the regular interval assignment stage, 2) the greedy assignment stage, and 3) the neural network assignment stage. The performance is evaluated through benchmark problems, where our algorithm finds the optimum or near-optimum solutions in all the instances.
| Original language | English |
|---|---|
| Pages (from-to) | 3948-3953 |
| Number of pages | 6 |
| Journal | Proceedings of the IEEE International Conference on Systems, Man and Cybernetics |
| Volume | 4 |
| Publication status | Published - 1997 |
| Externally published | Yes |
| Event | Proceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5) - Orlando, FL, USA Duration: Oct 12 1997 → Oct 15 1997 |
ASJC Scopus subject areas
- Control and Systems Engineering
- Hardware and Architecture