Column generation algorithm for RSA problems in flexgrid optical networks

• DOI: 10.1007/s11107-013-0408-0
• Publication Date: 2013-08-07T14:15:32Z
• Authors: Marc Ruiz; Michał Pióro; Mateusz Żotkiewicz; Mirosław Klinkowski; Luis Velasco
• Keywords: :Enginyeria de la telecomunicació::Telecomunicació òptica [Àrees temàtiques de la UPC]; Routing and spectrum allocation; Optical communications; Column generation; 0211 other engineering and technologies; Comunicacions òptiques; Integer programming; Flexgrid optical networks; 02 engineering and technology; Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telecomunicació òptica

Finding optimal routes and spectrum allocation in flexgrid optical networks, known as the RSA problem, is an important design problem in transport communication networks. The problem is TeX -hard, and its intractability becomes profound when network instances with several tens of nodes and several hundreds of demands are to be solved to optimum. In order to deal with such instances, large-scale optimization methods need to be considered. In this work, we present a column (more precisely, path) generation-based method for the RSA problem. The method is capable of finding reasonable sets of lightpaths, avoiding large sets of precomputed paths, and leading to high-quality solutions. Numerical results illustrating effectiveness of the proposed method for obtaining solutions for large RSA problem instances are presented. Peer Reviewed