We address the logical topology design problem (LTD) in WDM transport networks under static traffic assumptions. We start
with one of the standard MILP formulations of the LTD problem that aims at optimizing the network congestion. We propose an
improvement to this model that additionally optimizes the average hop count. We then derive a new MILP model that compels
the traffic to be atomically routed. This last model enables fair comparisons of solutions obtained with MILP formulations
and with metaheuristic algorithms. The latter allow us to deal with large size networks whereas the former are limited by
their computational complexity. In this paper Tabu Search is used to tackle the LTD problem. We compare and discuss the logical
topologies computed by the various methods described in the paper.
This work has been funded by Alcatel R & I, Marcoussis, France under Grant No. CI 578. Nicolas Puech has been funded by the
French National Educational System (Education Nationale) and the University Paris 5 in the form of a sabbatical. Nicolas Puech
would like to express his thanks to Mrs. Dominique Gascon (Director) and Mr. Serge Blumenthal (Statistics Department), both
from the I.U.T., University Paris 5, France, for having decided in favor of his sabbatical. Josué Kuri has been partially
supported by CONACyT Grant No. 122688.