Solving the routing and wavelength assignment problem with conflict-driven ASP solvers

Thumbnail
View/Open
Issue date
2015
Author
Béjar Torres, Ramón
Mateu Piñol, Carles
Fernàndez Camon, César
Guitart Bravo, Francesc
Suggested citation
Béjar Torres, Ramón; Mateu Piñol, Carles; Fernàndez Camon, César; Guitart Bravo, Francesc; . (2015) . Solving the routing and wavelength assignment problem with conflict-driven ASP solvers. Ai Communications, 2015, vol.28, núm. 1, p. 21-34. https://doi.org/10.3233/AIC-140619.
Impact

Google Scholar logo  Google Scholar
Share
Export to Mendeley
Metadata
Show full item record
Abstract
The Routing and Wavelength Assignment (RWA) problem is an optical networking problem that aims to improve data transmission by eliminating optoelectronic conversions through the network. The RWA problem is in the set of NP-complete problems and thus, it is also an interesting problem from a computational point of view. It can be solved in different flavors, being the Static Lightpath Establishment (SLE) the one studied in this work. In this work we define different Answer Set Programming (ASP) encodings for the RWA-SLE problem and study their performance when solving the problem with a state-of-the-art conflict-driven ASP solver: clasp. We investigate the relation between the performance of the ASP encodings and two different characteristics of the encodings: the number of nogoods and loop nogoods generated during search and a new measure for their tightness that we introduce. We also compare the performance of our ASP encodings with the best performing pseudo-Boolean encoding that we presented in a previous work.
URI
http://hdl.handle.net/10459.1/56653
DOI
https://doi.org/10.3233/AIC-140619
Is part of
Ai Communications, 2015, vol.28, núm. 1, p. 21-34
Collections