Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem
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.
KeywordsRouting and wavelength assignment Optical networks Column generation Heuristics
Mathematics Subject Classification90 Operations research, Mathematical programming
- Jaumard B, Meyer C, Thiongane B, Yu X (2004) ILP formulations and optimal solutions for the RWA problem. Proc IEEE GLOBECOM 3:1918–1924Google Scholar
- 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 NetworksGoogle Scholar