Premium
Optimal radio channel assignment through a new binary dynamic simulated annealing algorithm
Author(s) -
AlKhaled Fahad S.
Publication year - 1998
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/(sici)1099-1131(199809/10)11:5<327::aid-dac374>3.0.co;2-9
Subject(s) - computer science , simulated annealing , binary number , algorithm , channel (broadcasting) , computation , convergence (economics) , mathematical optimization , optimization problem , frequency assignment , binary search algorithm , search algorithm , telecommunications , mathematics , arithmetic , economics , economic growth
The radio channel assignment problem (CAP) is classified as an NP‐complete binary optimization problem, which creates the need for faster, yet optimal optimization algorithms to reduce the time of computation when solving such a complex problem. Simulated annealing (SA), a powerful optimal combinatorial search algorithm, was found to be very suitable for CAP. This paper extends the standard capabilities of SA and proposes a new CAP‐oriented, quicker binary SA, the binary dynamic SA (BDSA) algorithm, as part of a newly proposed radio channel assignment approach. Simulation results proved that the proposed BDSA has very fast convergence as a stand‐alone algorithm and even faster convergence with the newly proposed radio channel assignment approach. © 1998 John Wiley & Sons, Ltd.