Solving channel assignment problems using local search methods and simulated annealing
We solve the channel assignment problems (CAPs) with the main objective of minimizing the overall interference level while meeting the channel demand requirements. We use 3 methods, i.e., (1) local search (LS) with an acceptance ratio to re-initialize the search at a predefined threshold; (2) Simula...
Saved in:
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2012
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/94713 http://hdl.handle.net/10220/8133 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | We solve the channel assignment problems (CAPs) with the main objective of minimizing the overall interference level while meeting the channel demand requirements. We use 3 methods, i.e., (1) local search (LS) with an acceptance ratio to re-initialize the search at a predefined threshold; (2) Simulated Annealing (SA); and (3) improve local search (ILS) with two control parameters, namely Restart (RS) and Stop (ST) thresholds. Simulation results on benchmarking CAPs show that these simple methods outperform other more complex heuristics on both the average and minimum cost solutions. |
|---|