Decomposition Models for the Routing and Slot Provisioning Problem

Severa1 studies have been proposed for the Routing and Slot Assignment (RSA) problem in optical networks. In this study, we focus on exact or $\varepsilon-$optimal solution schemes. In this paper, two decomposition schemes are investigated: a first one that exploits a slot decomposition, and a second one that takes advantage of a link decomposition. In the slot decomposition, we gather the requests with the same lowest indexed frequency slot; while in the link decomposition, we put together the requests using the same first link in their routing. Computational results compare the performance of both decomposition schemes, with an indirect comparison with the best results of the literature, showing that they could solve much larger data instances than in the previous studies.