Referenced Items are not available for this document.
The channel-assignment problem in cellular radio networks is known to belong to the class of NP-complete optimization problems. So far, this problem has been solved by heuristic assignment strategies or by the application of combinatorial optimization tools like simulated annealing or neural networks. We propose a new powerful approach to the channel-assignment problem by combining the two mentioned groups of solution techniques. The results obtained by the application to a well-known benchmark problem reveal that this absolutely new strategy clearly outperforms the already existing algorithms
Published in:
Vehicular Technology, IEEE Transactions on
(Volume:48
,
Issue:
4
)
Date of Publication: Jul 1999
- Page(s):
- 1261 - 1269
- ISSN :
- 0018-9545
- INSPEC Accession Number:
- 6316833
- Digital Object Identifier :
- 10.1109/25.775374
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Jul 1999
- Sponsored by :
- IEEE Vehicular Technology Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
