A comparative study on search strategies for cell assignments

Abstract

We present a comparative study on heuristic optimization search techniques for solving the cell assignment problem which arises in mobile communication services. A new hybrid search strategy, bounded scattering, is proposed, which combines the advantages of scatter search and limited discrepancy search with dynamic value ordering and branch-and-bound. Extensive experimental study demonstrates the promising performance of the new approach with quality improvement.

Keywords:

• Heuristics
• Optimization
• Scatter search
• Branch-and-bound
• Mobile communication