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 us 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
