A Multiobjective Tabu Framework for the Optimization and Evaluation of Wireless Systems
Katia Jaffr√®s-Runser, Jean-Marie Gorce, Cristina Comaniciu · 2008
As presented in this chapter, Tabu Search is a promising metaheuristic when addressing multiobjective optimization problems. It is particularly suited to handle problems with numerous combinatorial or continuous variables. The local search at its heart also makes it an interesting technique for highly constrained optimization problems. Most of the heuristics dealing with MO Tabu search use a single search path. PMOTS, the algorithm used as an example in this work, relies on a simple parallel search which uses several paths and a specific neighbourhood construction strategy in order to spread the search paths in all the interesting parts of the solution space. The benefits of such an approach are highlighted for two particular problems arising in wireless systems. In the first one, a real world WLAN network has to be planned to meet several performance