Local search algorithms

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. c948718 Niels M. Jørgensen Simulated annealing in FWA-network planning Page 1 of 95 Preface During the time I was writing this master thesis I was pleased with the assistance form not only my supervisors. I was also supported by the people at both O/ZA group at L.M. Ericsson Denmark A/S and Operational Research (OR) -group at Informatics, Mathematics and Modeling (IMM) at the Technical University of Denmark (DTU). I am very grateful for this support and I would like to thank all the people who have contributed to my paper and have been very helpful when things have appeared impossible. At IMM I would like to thank my co-students Michael Løve, Kim Riis Sørensen, Mette Krogh-Jespersen and the Ph.D.-students Thomas K. Stidsen and Jesper A. Hansen for their assistance in all aspects of the project. At L.M. Ericsson I would like to thank Ulrik Heins and Nils Rinaldi for explaining the mysteries of radio transmission and Mazeyar Firouzi for helping in mastering C-programming. Especially I would like to thank my two supervisors. For the academic and theoretical part, Professor Jens Clausen, IMM at DTU and for the commercial and practical part, Senior Specialist Ph.D. Christian Kloch, O/ZAF at L.M. Ericsson Denmark A/S. _______________________________ Niels M. Jørgensen, c948718 IMM, DTU Lyngby, 31. July 2001 c948718 Niels M. Jørgensen Simulated annealing in FWA-network planning