Skip to main content

Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem

  • Conference paper
Evolutionary Computation in Combinatorial Optimization (EvoCOP 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4972))

Abstract

This paper deals with the design of improved construction heuristics and iterated local search for the Routing and Wavelength Assignment problem (RWA). Given a physical network and a set of communication requests, the static RWA deals with the problem of assigning suitable paths and wavelengths to the requests. We introduce benchmark instances from the SND library to the RWA and argue that these instances are more challenging than previously used random instances. We analyze the properties of several instances in detail and propose an improved construction heuristic to handle ‘problematic’ instances. Our iterated local search finds the optimum for most instances.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chlamtac, I., Ganz, A., Karmi, G.: Lightnet: Lightpath based solutions for wide bandwidth wans. In: INFOCOM, pp. 1014–1021 (1990)

    Google Scholar 

  2. Xu, S., Li, L., Wang, S.: Dynamic routing and assignment of wavelength algorithms in multifiber wavelength division multiplexing networks. IEEE J. Sel. Areas Comm. 18(10), 2130–2137 (2000)

    Article  Google Scholar 

  3. Chlamtac, I., Faragó, A., Zhang, T.: Lightpath (Wavelength) Routing in Large WDM Networks. IEEE J. Sel. Areas Comm. 14(5) (1996)

    Google Scholar 

  4. Ozdaglar, A.E., Bertsekas, D.P.: Routing and wavelength assignment in optical networks. IEEE/ACM Trans. Netw. 11(2) (2003)

    Google Scholar 

  5. Sinclair, M.C.: Minimum cost routing and wavelength allocation using a genetic-algorithm/heuristic hybrid approach. In: Proc. 6th IEE Conf. Telecom. (1998)

    Google Scholar 

  6. Zang, H., Jue, J.P., Mukherjee, B.: A Review of Routing and Wavelength Assignment Approaches for Wavelength-Routed Optical WDM Networks. Optical Networks Magazine 1(1), 47–60 (2000)

    Google Scholar 

  7. Choi, J.S., Golmie, N., Lapeyrere, F., Mouveaux, F., Su, D.: A Functional Classification of Routing and Wavelength Assignment Schemes in DWDM networks: Static Case. In: Proc. of the 7th International Conference on Optical Communications and Networks, OPNET 2000, pp. 1109–1115 (2000)

    Google Scholar 

  8. Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated Local Search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 57, pp. 321–353 (2002)

    Google Scholar 

  9. Hoos, H.H., Stützle, T.: Stochastic Local Search: Foundations and Applications. The Morgan Kaufmann Series in Artificial Intelligence. Morgan Kaufmann, San Francisco (2004)

    Google Scholar 

  10. Skorin-Kapov, N.: Routing and Wavelength Assignment in Optical Networks using Bin Packing Based Algorithms. EJOR 177(2), 1167–1179 (2007)

    Article  MATH  Google Scholar 

  11. Erdős, P., Rényi, A.: On Random Graphs I. Publ. Math. Debrecen 6, 290–297 (1959)

    MathSciNet  Google Scholar 

  12. Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and Wavelength Assignment in Optical Networks From Edge Disjoint Path Algorithms. IEEE Communications Letters 6(5), 211–213 (2002)

    Article  Google Scholar 

  13. de Noronha, T.F., Resende, M.G.C., Ribeiro, C.C.: A Random-Keys Genetic Algorithm for Routing and Wavelength Assignment. In: Proc. of the Seventh Metaheuristics International Conference (MIC 2007) (2007)

    Google Scholar 

  14. Bollobás, B.: Random Graphs. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  15. Orlowski, S., Pióro, M., Tomaszewski, A., Wessäly, R.: SNDlib 1.0–Survivable Network Design Library. In: Proc. of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium (2007), http://sndlib.zib.de

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jano van Hemert Carlos Cotta

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bauer, K., Fischer, T., Krumke, S.O., Gerhardt, K., Westphal, S., Merz, P. (2008). Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem. In: van Hemert, J., Cotta, C. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2008. Lecture Notes in Computer Science, vol 4972. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78604-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78604-7_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78603-0

  • Online ISBN: 978-3-540-78604-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics