Simulated annealing in FWA-network |
|
| Abstract | The planning of FWA-networks is a time consuming process. The aim with this paper is to find a model that can locate base stations in designspace and connect end-user to the base stations and solve the model within one hour. This paper describes the exact mathematical model for the base station location problem in FWA-networks and why it is not possible to solve the problem using this exact method within the given timeframe. Instead the base station location problem is solved using the Metaheuristic Simulated Annealing while minimizing the number of not connected end-users. |
| Type | Master's thesis [Academic thesis] |
| Year | 2001 |
| Publisher | Informatics and Mathematical Modelling, Technical University of Denmark, DTU |
| Address | Richard Petersens Plads, Building 321, DK-2800 Kgs. Lyngby |
| Series | IMM-EKS-2001-31 |
| Electronic version(s) | [pdf] |
| BibTeX data | [bibtex] |
| IMM Group(s) | Operations Research |