Advertisement

Journal of Global Optimization

, Volume 50, Issue 3, pp 503–518 | Cite as

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

  • Thiago F. Noronha
  • Mauricio G. C. Resende
  • Celso C. Ribeiro
Article

Abstract

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.

Keywords

Genetic algorithm Routing Wavelength assignment Optical networks Random keys 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aiex R.M., Resende M.G.C., Ribeiro C.C.: Probability distribution of solution time in GRASP: an experimental investigation. J. Heuristics 8, 343–373 (2002)CrossRefGoogle Scholar
  2. 2.
    Aiex R.M., Resende M.G.C., Ribeiro C.C.: TTTPLOTS: a Perl program to create time-to-target plots. Optim. Lett. 1, 355–366 (2007)CrossRefGoogle Scholar
  3. 3.
    Bannerjee D., Mukherjee B.: Practical approach for routing and wavelength assignment in large wavelength routed optical networks. IEEE J. Sel. Areas Commun. 14, 903–908 (1995)CrossRefGoogle Scholar
  4. 4.
    Bean J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 2, 154–160 (1994)Google Scholar
  5. 5.
    Buriol L.S., Resende M.G.C., Ribeiro C.C., Thorup M.: A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks 46, 36–56 (2005)CrossRefGoogle Scholar
  6. 6.
    Buriol L.S., Resende M.G.C., Thorup M.: Survivable IP network design with OSPF routing. Networks 49, 51–64 (2007)CrossRefGoogle Scholar
  7. 7.
    Choi, J.S., Golmie, N., Lapeyrere, F., Mouveaux, F., Su, D.: A functional classification of routing and wavelength assignment schemes in DWDM networks: static case. In: Proceedings of the 7th International Conference on Optical Communication and Networks, pp. 1109–1115. Paris (2000)Google Scholar
  8. 8.
    Ericsson M., Resende M.G.C., Pardalos P.M.: A genetic algorithm for the weight setting problem in OSPF routing. J. Comb. Optim. 6, 299–333 (2002)CrossRefGoogle Scholar
  9. 9.
    Erlebach T., Jansen K.: The complexity of path coloring and call scheduling. Theor. Comput. Sci. 255, 33–50 (2001)CrossRefGoogle Scholar
  10. 10.
    Frota Y., Maculan N., Noronha T.F., Ribeiro C.C.: A branch-and-cut algorithm for partition coloring. Networks 55, 194–204 (2010)Google Scholar
  11. 11.
    Gonçalves J.F., Mendes J.J.M., Resende M.G.C.: A hybrid genetic algorithm for the job shop scheduling problem. Eur. J. Oper. Res. 167, 77–95 (2005)CrossRefGoogle Scholar
  12. 12.
    Gonçalves J.F., Mendes J.J.M., Resende M.G.C.: A genetic algorithm for the resource constrained multi-project scheduling problem. Eur. J. Oper. Res. 189, 1171–1190 (2008)CrossRefGoogle Scholar
  13. 13.
    Gonçalves J.F., Mendes J.J.M., Resende M.G.C.: A random key based genetic algorithm for the resource constrained project scheduling problems. Comput. Oper. Res. 36, 92–109 (2009)CrossRefGoogle Scholar
  14. 14.
    Gonçalves J.F., Resende M.G.C.: An evolutionary algorithm for manufacturing cell formation. Comput. Ind. Eng. 47, 247–273 (2004)CrossRefGoogle Scholar
  15. 15.
    Gonçalves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. Technical report, AT& T Labs Research. Florham Park, NJ, To appear in J. of Heuristics (2009)Google Scholar
  16. 16.
    Hertz A., de Werra D.: Using tabu search techniques for graph coloring. Computing 39, 345–351 (1987)CrossRefGoogle Scholar
  17. 17.
    Hyytia, E., Virtamo, J.: Wavelength assignment and routing in WDM networks. In: Fourteenth Nordic Teletraffic Seminar, pp. 31–40. Copenhagen (1998)Google Scholar
  18. 18.
    Jaumard, B.: Network and traffic data sets for optical network optimization. Online publication in http://users.encs.concordia.ca/~bjaumard/CRC_Chair/Research/Optical_Networks/Optical_Networks_Data.htm, last visited on April 1st (2010)
  19. 19.
    Jaumard, B., Meyer, C., Thiongane, B.: ILP formulations for the RWA problem for symmetrical systems. In: Handbook for Optimization in Telecommunications, pp. 637–677. Springer Science + Business Media (2006)Google Scholar
  20. 20.
    Jaumard B., Meyer C., Thiongane B.: On column generation formulations for the RWA problem. Discrete Appl. Math. 157, 1291–1308 (2009)CrossRefGoogle Scholar
  21. 21.
    Kleinberg, J.M.: Approximation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge (1996)Google Scholar
  22. 22.
    Li, G., Simha, R.: The partition coloring problem and its application to wavelength routing and assignment. In: Proceedings of the First Workshop on Optical Networks. Dallas (2000)Google Scholar
  23. 23.
    Manohar P., Manjunath D., Shevgaonkar R.K.: Routing and wavelength assignment in optical networks from edge disjoint path algorithms. IEEE Commun. Lett. 5, 211–213 (2002)CrossRefGoogle Scholar
  24. 24.
    Noronha, T.F., Resende, M.G.C., Ribeiro, C.C.: Efficient implementation of heuristics for routing and wavelength assignment. In: McGeoch, C.C. (ed.) Proceedings of the 7th International Workshop on Experimental Algorithms, volume 5038 of Lecture Notes in Computer Science, pp. 169–180. Springer, Provincetown, Mass (2008)Google Scholar
  25. 25.
    Noronha T.F., Ribeiro C.C.: Routing and wavelength assignment by partition coloring. Eur. J. Oper. Res. 171, 797–810 (2006)CrossRefGoogle Scholar
  26. 26.
    Schrage L.: A more portable Fortran random number generator. ACM Trans. Math. Softw. 5, 132–138 (1979)CrossRefGoogle Scholar
  27. 27.
    Skorin-Kapov N.: Routing and wavelength assignment in optical networks using bin packing based algorithms. Eur. J. Oper. Res. 177, 1167–1179 (2007)CrossRefGoogle Scholar
  28. 28.
    Spears, W., de Jong, K.: On the virtues of parameterized uniform crossover. In: Belew, R., Booker, L. (eds.) Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 230–236. San Mateo, Morgan Kaufman (1991)Google Scholar
  29. 29.
    Zang H., Jue J.P., Mukherjee B.: A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. Opt. Netw. Mag. 1, 47–60 (2000)Google Scholar

Copyright information

© AT&T Intellectual Property 2010

Authors and Affiliations

  • Thiago F. Noronha
    • 1
  • Mauricio G. C. Resende
    • 2
  • Celso C. Ribeiro
    • 3
  1. 1.Department of Computer ScienceUniversidade Federal de Minas GeraisBelo HorizonteBrazil
  2. 2.Algorithms and Optimization Research DepartmentAT & T Labs ResearchFlorham ParkUSA
  3. 3.Department of Computer ScienceUniversidade Federal FluminenseNiteróiBrazil

Personalised recommendations