Abstract
Multicommodity flow models are commonly used to formulate the logical topology design (LTD) problem and the lightpath routing (LR) problem as mixed integer linear programming (MILP) problems. In general, MILP formulations are intractable even for relatively small networks due to the combinatorial complexity of the problem. In this paper we propose improvements to these models and a method to solve the LTD and the LR problems in a combined manner. The interest is two fold: firstly, by tackling the two problems with separate models, problem instances of realistic size (up to 14 nodes in this paper) can be dealt with. Furthermore, different combinations of optimization models and objective functions can be investigated in a modular manner. Secondly, the mechanisms proposed to combine the problems allow to keep track of the global design problem when solving each individual step.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
