Utilisation de la programmation par contraintes et de la recherche taboue pour le probleme d'affectation de cellules aux commutateurs (French text)

Personal communication service networks have developed rapidly during the last decade. The design of such networks is a difficult task that is generally decomposed into many subproblems, most of them still very difficult to solve.; Among these problems, the assignment of cells to switches is the central concern of this thesis. The goal is to find an optimal assignment of cells to switches (whose locations are known and fixed), that minimizes the overall cost composed of the cost of handoff between cells, and the cost of wiring between cells and switches. Moreover, switches have a limited handling so that only a restricted number of cells may be assigned to each switch. Heuristic methods are often used to solve this combinatorial optimization problem, because it is known as being NP-hard.; The main objective of this thesis is to use tabu search and constraint programming techniques to solve this problem. (Abstract shortened by UMI.)...