Skip to main content
SpringerLink
Log in
Book cover

International Conference on Principles and Practice of Constraint Programming

CP 2009: Principles and Practice of Constraint Programming - CP 2009 pp 104–118Cite as

A Hybrid Constraint Model for the Routing and Wavelength Assignment Problem

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5732))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K.R., Wallace, M.: Constraint Logic Programming using ECLiPSe. Cambridge University Press, New York (2007)

    MATH  Google Scholar 

  2. Banerjee, D., Mukherjee, B.: A practical approach for routing and wavelength assignment in large wavelength-routed optical networks. IEEE Journal on Selected Areas in Communications 14(5), 903–908 (1996)

    Article  Google Scholar 

  3. Beldiceanu, N., Bourreau, E., Chan, P., Rivreau, D.: Partial search strategy in CHIP. In: 2nd International Conference on Metaheuristics MIC 1997, Sophia Antipolis, France (1997)

    Google Scholar 

  4. Jaumard, B., Meyer, C., Thiongane, B.: ILP formulations for the routing and wavelength assignment problem: Symmetric systems. In: Resende, M., Pardalos, P. (eds.) Handbook of Optimization in Telecommunications, pp. 637–677. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Jaumard, B., Meyer, C., Thiongane, B.: Comparison of ILP formulations for the RWA problem. Optical Switching and Networking 4(3-4), 157–172 (2007)

    Article  Google Scholar 

  6. Jaumard, B., Meyer, C., Thiongane, B.: On column generation formulations for the RWA problem. Discrete Applied Mathematics 157, 1291–1308 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Junker, U.: Quickxplain: Conflict detection for arbitrary constraint propagation algorithms. In: IJCAI 2001 Workshop on Modelling and Solving problems with constraints (CONS-1), Seattle, WA, USA (August 2001)

    Google Scholar 

  8. Lever, J.: A local search/constraint propagation hybrid for a network routing problem. International Journal on Artificial Intelligence Tools 14(1-2), 43–60 (2005)

    Article  Google Scholar 

  9. Liatsos, V., Novello, S., El Sakkout, H.: A probe backtrack search algorithm for network routing. In: Proceedings of the Third International Workshop on Cooperative Solvers in Constraint Programming, CoSolv 2003, Kinsale, Ireland (September 2003)

    Google Scholar 

  10. Lougee-Heimer, R.: The common optimization interface for operations research. IBM Journal of Research and Development 47, 57–66 (2003)

    Article  Google Scholar 

  11. Quimper, C.-G.: Efficient Propagators for Global Constraints. PhD thesis, University of Waterloo (2006)

    Google Scholar 

  12. Ramaswami, R., Sivarajan, K.N.: Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans. Netw. 3(5), 489–500 (1995)

    Article  Google Scholar 

  13. Régin, J.-C.: Generalized arc consistency for global cardinality constraint. In: AAAI/IAAI, vol. 1, pp. 209–215 (1996)

    Google Scholar 

  14. Richter, Y., Freund, A., Naveh, Y.: Generalizing alldifferent: The somedifferent constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 468–483. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Shen, K., Schimpf, J.: Eplex: Harnessing mathematical programming solvers for constraint logic programming. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 622–636. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Simonis, H.: Constraint applications in networks. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2006)

    Google Scholar 

  17. Simonis, H.: Solving the static design routing and wavelength assignment problem. In: CSCLP 2009, Barcelona, Spain (June 2009)

    Google Scholar 

  18. Smith, B.M.: Symmetry and search in a network design problem. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 336–350. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  19. van Hoeve, W.J.: The alldifferent constraint: A survey. CoRR, cs.PL/0105015 (2001)

    Google Scholar 

  20. Wallace, M., Novello, S., Schimpf, J.: ECLiPSe: A platform for constraint logic programming. ICL Systems Journal 12(1) (May 1997)

    Google Scholar 

  21. Zang, H., Jue, J.P., Mukherjee, B.: A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. Optical Networks Magazine, 47–60 (January 2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cork Constraint Computation Centre Department of Computer Science, University College Cork, Ireland

    Helmut Simonis

Authors
  1. Helmut Simonis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, University of St. Andrews, North Haugh, St Andrews, KY16 9SX, Fife, Scotland, UK

    Ian P. Gent

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Simonis, H. (2009). A Hybrid Constraint Model for the Routing and Wavelength Assignment Problem. In: Gent, I.P. (eds) Principles and Practice of Constraint Programming - CP 2009. CP 2009. Lecture Notes in Computer Science, vol 5732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04244-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04244-7_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04243-0

  • Online ISBN: 978-3-642-04244-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation