Tabu Search for Multiple Routing Scheme Problems

Routing schemes of non hierachical telecommunication networks may be multiple Multiple routing scheme problem is a problem with great complexity A two level Tabu search algorithm is presented in this paper Macro level search controls and guides the search in macro areas Micro level search realizes the intensive search in local areas This algorithm resolves the multiple routing scheme problem successfully The two level Tabu search algorithm is a general algorithm and can be applied to many combinatorial problems with huge problem space