| Article ID: | iaor2000409 |
| Country: | Italy |
| Volume: | 28 |
| Issue: | 85/86 |
| Start Page Number: | 95 |
| End Page Number: | 119 |
| Publication Date: | Jan 1998 |
| Journal: | Ricerca Operativa |
| Authors: | Lepschy Chiara, Menolascino Raffaele, Minerva Giuseppe |
| Keywords: | communications |
In this paper we present three planning problems in the field of Radio Mobile Systems, concerning the Frequency Assignment, the Access Network Definition and Location and Paging Area Dimensioning. These NP-Hard problems are solved in CSELT by means of a Tabu Search approach. For each problem we show a possible mathematical definition and the main characteristics of the specific Tabu Search implementation.