Article ID: | iaor20023268 |
Country: | Netherlands |
Volume: | 107 |
Issue: | 1 |
Start Page Number: | 225 |
End Page Number: | 236 |
Publication Date: | Oct 2001 |
Journal: | Annals of Operations Research |
Authors: | Schmeink Michael, Mathar Rudolf |
Keywords: | location, programming: integer, programming: branch and bound |
In this paper, discrete mathematical programming approaches are used to solve the frequency allocation and cell site selection problem in an integrated setup. Both CDMA (code division multiple access) and FD/TDMA (frequency/time division multiple access) technologies will be important for 3rd generation mobile systems. If all users share the same bandwidth, base transmitter stations should be placed such that a maximum of traffic can be carried at low interference rates. The expected traffic is represented by spatially scattered weighted nodes. The problem to select an optimal set of base station locations from a given pool of configurations is formulated as an integer linear program and solved by combinatorial optimization methods. For systems which employ FD/TDMA schemes, the cell site optimization process depends on the assignment of channels. We suggest an integrated linear programming approach to solve both objectives in a single planning step. Because of the problems' tremendous complexity, special branch-and-bound procedures are developed as exact and approximate solution methods. An example is given for a typical urban scenario with base transmitters below roof tops.