Journal
IET OPTOELECTRONICS
Volume 12, Issue 2, Pages 65-72Publisher
INST ENGINEERING TECHNOLOGY-IET
DOI: 10.1049/iet-opt.2017.0013
Keywords
telecommunication network routing; optical fibre networks; integer programming; linear programming; genetic algorithms; heuristic approach; exact approach; routing assignment; spectrum assignment; flex-grid optical network; network efficiency; integer linear programming; local optimal trapping; genetic algorithm; RSA problem; running time performance
Ask authors/readers for more resources
Efficient algorithms for solving the routing and spectrum assignment (RSA) problem in flex-grid optical networks are of paramount importance to leverage network efficiency. Exact approaches based on integer linear programming (ILP) models are known to be computationally hard and hence, difficult to solve for realistic models while heuristics have inherent downsize of local optimal trapping. In addressing those issues, this paper firstly presents a novel and efficient heuristic based on the genetic algorithm (GA) to provide (near-) optimal solutions to the RSA problem. The effectiveness of the GA-based algorithm is benchmarked against typically used reference heuristics for a set of network scenarios and it is shown that in addition to the better performance than conventional heuristics in the literature, the proposed GA technique indeed could achieve optimal solutions in most cases while the running time is still manageable. Secondly, we propose to make use of efficient solutions from the heuristic approaches to set the upper-bound and warm-start point for ILP formulation. This combination has been shown very productive in enhancing running time performance and increasing the capability of achieving an optimal solution and/or improving the solution quality in a given time span compared with traditional ways for solving ILP models.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available