Abstract
The routing and wavelength assignment (RWA) problem typically occurs in wavelength division multiplexing optical networks. Given a number of available wavelengths, we consider here the problem of maximising the number of accepted connections with respect to the clash and continuity constraints. We first propose a new strategy which combines two existing models. This leads to an improved column generation scheme. We also present two heuristics to compute feasible solutions: a hybrid heuristic and the integer solution at the root node of the column generation. Our approaches are compared with the best existing results on a set of classic RWA instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Banerjee D, Mukherjee B (1996) A practical approach for routing and wavelength assignment in large wavelength-routed optical networks. IEEE J Sel Areas Commun 14:903–908
Chlamtac I, Ganz A, Karmi G (1992) Lightpath communications: an approach to high-bandwidth optical WANs. IEEE Trans Commun 40:1171–1182
Corteel S, Gardy D, Valencia-Pabon M, Bath D, Denise A (2003) The permutation-path coloring problem on trees. Theoret Comput Sci 297:119–143
Erlebach T, Jansen K (2001) The complexity of path coloring and call scheduling. Theoret Comput Sci 255:33–50
Jaumard B, Meyer C, Thiongane B (2007) Comparison of ILP formulations for the RWA problem. Opt Switch Netw 4:157–172
Jaumard B, Meyer C, Thiongane B (2009) On column generation formulations for the RWA problem. Discrete Appl Math 157:1291–1308
Jaumard B, Meyer C, Thiongane B, Yu X (2004) ILP formulations and optimal solutions for the RWA problem. Proc IEEE GLOBECOM 3:1918–1924
Krishnaswamy RM, Sivarajan KN (2001) Design of logical topologies: a linear formulation for wavelength-routed optical networks with no wavelength changers. IEEE/ACM Trans Netw 9:186–198
Lee T, Lee K, Park S (2000) Optimal routing and wavelength assignment in WDM ring networks. IEEE J Sel Areas Commun 18:2146–2154
Li G, Simha R (2000) The partition coloring problem and its application to wavelength routing and assignment. In: Proceedings of the First Workshop on Optical Networks
Manohar P, Manjunath D, Shevgaonkar RK (2002) Routing and wavelength assignment in optical networks from edge disjoint path algorithms. IEEE Commun Lett 6:211–213
Martins AX, Duhamel C, Mahey P, Saldanha RR, de Souza MC (2012) Variable neighborhood descent with iterated local search for routing and wavelength assignment. Comput Oper Res 39:2133–2141
Noronha TF, Ribeiro CC (2006) Routing and wavelength assignment by partition colouring. Eur J Oper Res 171:797–810
Noronha TF, Resende MGC, Ribeiro CC (2008) Efficient implementations of heuristics for routing and wavelength assignment. Lect Notes Comput Sci 5038:169–180
Noronha TF, Resende MGC, Ribeiro CC (2011) A biased random-key genetic algorithm for routing and wavelength assignment. J Global Optim 50:503–518
Ramaswami R, Sivarajan KN (1995) Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans Netw 3:489–500
Skorin-Kapov N (2007) Routing and wavelength assignment in optical networks using bin packing based algorithms. Eur J Oper Res 177:1167–1179
Acknowledgments
The authors from Brazilian institutions were partially supported by CAPES, CNPq and FAPEMIG, Brazil.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Rights and permissions
About this article
Cite this article
Duhamel, C., Mahey, P., Martins, A.X. et al. Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem. 4OR-Q J Oper Res 14, 201–220 (2016). https://doi.org/10.1007/s10288-016-0309-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-016-0309-z