Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
IBM Journal of Research and Development
Constraint Logic Programming using Eclipse
Constraint Logic Programming using Eclipse
Efficient propagators for global constraints
Efficient propagators for global constraints
On column generation formulations for the RWA problem
Discrete Applied Mathematics
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Solving the static design routing and wavelength assignment problem
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Generalizing alldifferent: the somedifferent constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Symmetry and search in a network design problem
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Review: Comparison of ILP formulations for the RWA problem
Optical Switching and Networking
IEEE Journal on Selected Areas in Communications
Philosophy of the MiniZinc challenge
Constraints
The extended global cardinality constraint: An empirical survey
Artificial Intelligence
Solving the static design routing and wavelength assignment problem
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
On the design of the next generation access networks
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The extended global cardinality constraint: an empirical survey (extended abstract)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
In this paper we present a hybrid model for the demand acceptance variant of the routing and wavelength assignment problem in directed networks, an important benchmark problem in optical network design. Our solution uses a decomposition into a MIP model for the routing and optimization aspect, combined with a finite domain constraint model for the wavelength assignment. If a solution to the constraint problem is found, it provides an optimal solution to the overall problem. If the constraint problem is infeasible, we use an extended explanation technique to find a good relaxation of the problem which leads to a near optimal solution. Extensive experiments show that proven optimality is achieved for more than 99.8% of all cases tested, while run-times are orders of magnitude smaller than the best known MIP solution.