Abstract
The frequency assignment problem, known to be NP-complete, is to find an assignment of radio frequencies to a set of transmitters in a region. The transmitters satisfy a large number of constraints. This paper presents a simulated annealing algorithm for determining such an assignment and compares the results with those obtained from a genetic algorithm. We report on our computational experiments in terms of quality of the solutions obtained for realistic, computer generated problem 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.
