A biased random-key genetic algorithm for routing and wavelength assignment

The problem of routing and wavelength assignment in wavelength division multiplexing optical networks consists in routing a set of lightpaths and assigning a wavelength to each of them, such that lightpaths whose routes share a common fiber are assigned different wavelengths. This problem was shown to be NP-hard when the objective is to minimize the total number of wavelengths used. We propose a genetic algorithm with random keys for routing and wavelength assignment with the goal of minimizing the number of different wavelengths used in the assignment. This algorithm extends the best heuristic in the literature by embedding it into an evolutionary framework. Computational results show that the new heuristic improves the state-of-the-art algorithms in the literature.

[1]  Mikkel Thorup,et al.  Survivable IP network design with OSPF routing , 2007, Networks.

[2]  Alain Hertz,et al.  Using tabu search techniques for graph coloring , 1987, Computing.

[3]  Biswanath Mukherjee,et al.  A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..

[4]  Mikkel Thorup,et al.  Survivable IP network design with OSPF routing , 2007 .

[5]  Celso C. Ribeiro,et al.  Routing and wavelength assignment by partition colouring , 2006, Eur. J. Oper. Res..

[6]  Mauricio G. C. Resende,et al.  A genetic algorithm for the resource constrained multi-project scheduling problem , 2008, Eur. J. Oper. Res..

[7]  Celso C. Ribeiro,et al.  Probability Distribution of Solution Time in GRASP: An Experimental Investigation , 2002, J. Heuristics.

[8]  Mauricio G. C. Resende,et al.  A random key based genetic algorithm for the resource constrained project scheduling problem , 2009, Comput. Oper. Res..

[9]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[10]  D. Manjunath,et al.  Routing and wavelength assignment in optical networks from edge disjoint path algorithms , 2002, IEEE Communications Letters.

[11]  Nina Skorin-Kapov,et al.  Routing and wavelength assignment in optical networks using bin packing based algorithms , 2007, Eur. J. Oper. Res..

[12]  Rahul Simha,et al.  The Partition Coloring Problem and its Application to Wavelength Routing and Assignment , 2000 .

[13]  Celso C. Ribeiro,et al.  A branch‐and‐cut algorithm for partition coloring , 2010, Networks.

[14]  Klaus Jansen,et al.  The complexity of path coloring and call scheduling , 2001, Theor. Comput. Sci..

[15]  Mauricio G. C. Resende,et al.  An evolutionary algorithm for manufacturing cell formation , 2004, Comput. Ind. Eng..

[16]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[17]  Panos M. Pardalos,et al.  A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..

[18]  Mauricio G. C. Resende,et al.  Biased random-key genetic algorithms for combinatorial optimization , 2011, J. Heuristics.

[19]  Jorma Virtamo,et al.  Wavelength Assignment and Routing in WDM Networks , 1998 .

[20]  Nada Golmie,et al.  A Functional Classi cation of Routing and Wavelength Assignement Schemes in DWDM networks: Static Case , 2000 .

[21]  Celso C. Ribeiro,et al.  A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing , 2005, Networks.

[22]  Celso C. Ribeiro,et al.  Efficient Implementations of Heuristics for Routing and Wavelength Assignment , 2008, WEA.

[23]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[24]  B. Mukherjee,et al.  A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .

[25]  Brigitte Jaumard,et al.  On column generation formulations for the RWA problem , 2004, Discret. Appl. Math..

[26]  Linus Schrage,et al.  A More Portable Fortran Random Number Generator , 1979, TOMS.

[27]  W. Spears,et al.  On the Virtues of Parameterized Uniform Crossover , 1995 .

[28]  Celso C. Ribeiro,et al.  TTT plots: a perl program to create time-to-target plots , 2007, Optim. Lett..

[29]  Celso C. Ribeiro,et al.  Design of Survivable Networks: A survey , 2005 .