Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

The problem of routing and wavelength assignment in optical networks consists in minimizing the number of wavelengths that are needed to route a set of demands, such that demands routed using lightpaths that share common links are assigned to different wavelengths. We present a biased random-key genetic algorithm for approximately solving the problem of routing and wavelength assignment of sliding scheduled lightpath demands in optical networks. In this problem variant, each demand is characterized not only by a source and a destination, but also by a duration and a time window in which it has to be met. Computational experiments show that the numerical results obtained by the proposed heuristic improved upon those obtained by a multistart constructive heuristic. In addition, the biased random-key genetic algorithm obtained much better results than an existing algorithm for the problem, finding solutions that use roughly 50% of the number of wavelengths determined by the latter.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

References

  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)

    Article  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  3. Alfaro-Fernández, P., Ruiz, R., Pagnozzi, F., Stützle, T.: Exploring automatic algorithm design for the hybrid flowshop problem. In: 12th Metaheuristics International Conference, pp. 201–203. Barcelona (2017)

  4. Andrei, D., Yen, H.H., Tornatore, M., Martel, C.U., Mukherjee, B.: Integrated provisioning of sliding scheduled services over WDM optical networks. IEEE/OSA J. Opt. Commun. Netw. 1, A94–A105 (2009)

    Article  Google Scholar 

  5. Banerjee, D., Mukherjee, B.: A practical approach for routing and wavelength assignment in large wavelength-routed optical networks. IEEE J. Sel. Areas Commun. 14, 903–908 (1996)

    Article  Google Scholar 

  6. Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154–160 (1994)

    Article  Google Scholar 

  7. Bouamama, S., Blum, C.: A population-based iterated greedy algorithm for the knapsack problem with setup. In: 12th Metaheuristics International Conference, pp. 558–565. Barcelona (2017)

  8. Brandão, J.S., Noronha, T.F., Resende, M.G.C., Ribeiro, C.C.: A biased random-key genetic algorithm for single-round divisible load scheduling. Int. Trans. Oper. Res. 22, 823–839 (2015)

    Article  MathSciNet  Google Scholar 

  9. Brandão, J.S., Noronha, T.F., Resende, M.G.C., Ribeiro, C.C.: A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems. Int. Trans. Oper. Res. 24, 1061–1077 (2016)

    Article  MathSciNet  Google Scholar 

  10. Brandão, J.S., Noronha, T.F., Ribeiro, C.C.: A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks. J. Glob. Optim. 65, 813–835 (2016)

    Article  MathSciNet  Google Scholar 

  11. Drevon, D., Fursa, S.R., Malcolm, A.L.: Intercoder reliability and validity of WebPlotDigitizer in extracting graphed data. Behav. Modif. 41, 323–339 (2017)

    Article  Google Scholar 

  12. Erlebach, T., Jansen, K.: The complexity of path coloring and call scheduling. Theor. Comput. Sci. 255, 33–50 (2001)

    Article  MathSciNet  Google Scholar 

  13. Gonçalves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17, 487–525 (2011)

    Article  Google Scholar 

  14. Gonçalves, J.F., Resende, M.G.C., Toso, R.F.: Biased and unbiased random key genetic algorithms: an experimental analysis. In: Abstracts of the 10th Metaheuristics International Conference, Singapore (2013)

  15. Hoos, H.H., Stützle, T.: Evaluation of Las Vegas algorithms—pitfalls and remedies. In: Cooper, G., Moral, S. (eds.) Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pp. 238–245. Madison (1998)

  16. Hyytia, E., Virtamo, J.: Wavelength assignment and routing in WDM networks. In: Fourteenth Nordic Teletraffic Seminar, pp. 31–40. Copenhagen (1998)

  17. Jaekel, A., Chen, Y.: Demand allocation without wavelength conversion under a sliding scheduled traffic model. In: Fourth International Conference on Broadband Communications, Networks and Systems, pp. 495–503. Raleigh (2007)

  18. Jaekel, A., Chen, Y.: Resource provisioning for survivable WDM networks under a sliding scheduled traffic model. Opt. Switch. Netw. 6, 44–54 (2009)

    Article  Google Scholar 

  19. Jaekel, A., Pare, J., Chen, Y., Shaabana, A., Luo, F.: Traffic grooming of scheduled demands for minimizing energy consumption. Photonic Netw. Commun. 29, 151–163 (2015)

    Article  Google Scholar 

  20. Kleinberg, J.M.: Approximation algorithms for disjoint paths problems. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge (1996)

  21. Kuri, J., Puech, N., Gagnaire, M., Dotaro, E., Douville, R.: Routing and wavelength assignment of scheduled lightpath demands. IEEE J. Sel. Areas Commun. 21, 1231–1240 (2003)

    Article  Google Scholar 

  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)

  23. Liu, Z., Guo, W., Shi, Q., Hu, W., Xia, M.: Sliding scheduled lightpath provisioning by mixed partition coloring in WDM optical networks. Opt. Switch. Netw. 10, 44–53 (2013)

    Article  Google Scholar 

  24. López-Ibánez, M., Dubois-Lacoste, J., Stützle, T., Birattari, M.: The IRACE package: iterated race for automatic algorithm configuration. Technical Report TR/IRIDIA/2011-004, IRIDIA. Université Libre de Bruxelles, Belgium (2011)

  25. Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and wavelength assignment in optical networks from edge disjoint path algorithms. IEEE Commun. Lett. 6, 211–213 (2002)

    Article  Google Scholar 

  26. Maschler, J., Hackl, T., Riedler, M., Raidl, G.R.: Enhanced iterated greedy metaheuristic for the particle therapy patient scheduling problem. In: 12th Metaheuristics International Conference, pp. 118–127. Barcelona (2017)

  27. Noronha, T.F., Resende, M.G.C., Ribeiro, C.C.: Efficient implementations of heuristics for routing and wavelength assignment. In: McGeoch, C.C. (ed.) Experimental Algorithms, Volume 5038 of Lecture Notes in Computer Science, pp. 169–180. Springer, Berlin (2008)

    Google Scholar 

  28. Noronha, T.F., Resende, M.G.C., Ribeiro, C.C.: Instances for the routing and wavelength assignment problem (2010). http://www2.ic.uff.br/~celso/grupo/rwa.html. Last accessed 13 Oct 2018

  29. Noronha, T.F., Resende, M.G.C., Ribeiro, C.C.: A biased random-key genetic algorithm for routing and wavelength assignment. J. Glob. Optim. 50, 503–518 (2011)

    Article  Google Scholar 

  30. Noronha, T.F., Ribeiro, C.C.: Routing and wavelength assignment by partition colouring. Eur. J. Oper. Res. 171, 797–810 (2006)

    Article  Google Scholar 

  31. Pérez Cáceres, L., López-Ibáñez, M., Stützle, T.: An analysis of parameters of IRACE. In: Proceedings of the 14th European Conference on Evolutionary Computation in Combinatorial Optimization, Volume 8600 of Lecture Notes in Computer Science, pp. 37–48. Springer, Berlin (2014)

  32. Pinto, B.Q., Ribeiro, C.C., Rosseti, I., Noronha, T.F.: Input data and detailed numerical results for ’A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model in WDM optical networks’ (2018). https://data.mendeley.com/datasets/r76d3pjnnk/. Last accessed on 17 Oct 2018

  33. Ramaswami, R., Sivarajan, K.N.: Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans. Netw. 3, 489–500 (1995)

    Article  Google Scholar 

  34. Resende, M.G.C., Ribeiro, C.C.: Restart strategies for GRASP with path-relinking heuristics. Optim. Lett. 5, 467–478 (2011)

    Article  MathSciNet  Google Scholar 

  35. Resende, M.G.C., Ribeiro, C.C.: Biased-random key genetic algorithms: an advanced tutorial. In: Proceedings of the 2016 Genetic and Evolutionary Computation Conference—GECCO’16 Companion Volume, pp. 483–514, Denver (2016). Association for Computing Machinery

  36. Resende, M.G.C., Ribeiro, C.C.: Optimization by GRASP. Springer, Boston (2016)

    Book  Google Scholar 

  37. Rohatgi, A.: WebPlotDigitizer (Version 4.1) 2018. Last visit in October 6 (2018)

  38. Saradhi, C.V., Gurusamy, M.: Scheduling and routing of sliding scheduled lightpath demands in WDM optical networks. In: Conference on Optical Fiber Communication and the National Fiber Optic Engineers Conference, pp. 1–3. Anaheim (2007)

  39. Saradhi, C.V., Gurusamy, M., Piesiewicz, R.: Routing fault-tolerant sliding scheduled traffic in WDM optical mesh networks. In: 5th International Conference on Broadband Communications, Networks and Systems, pp. 197–202 (2008)

  40. Skorin-Kapov, N.: Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks. IEEE J. Sel. Areas Commun. 24, 2–15 (2006)

    Article  Google Scholar 

  41. Skorin-Kapov, N.: Routing and wavelength assigment in optical networks using bin packing based algorithms. Eur. J. Oper. Res. 177, 1167–1179 (2007)

    Article  Google Scholar 

  42. Spears, W., De Jong, K.A.: 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. Morgan Kaufman, San Mateo (1991)

  43. Toso, R.F., Resende, M.G.C.: A C++ application programming interface for biased random-key genetic algorithms. Optim. Methods Softw. 30, 81–93 (2015)

    Article  Google Scholar 

  44. Wang, B., Li, T., Luo, X., Fan, Y.: Traffic grooming under a sliding scheduled traffic model in WDM optical networks. In: IEEE Workshop on Traffic Grooming in WDM Networks, San Jose (2004)

  45. Wang, B., Li, T., Luo, X., Fan, Y., Xin, C.: On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks. In: 2nd International Conference on Broadband Networks, pp. 13–22. Boston (2005)

  46. Zang, H., Jue, J.P., Mukherjeey, B.: A review of routing and wavelength assignment approaches for wavelength-routed optical wdm networks. Opt. Netw. Mag. 1, 47–60 (2000)

    Google Scholar 

Download references

Acknowledgements

The authors are grateful to J. Kuri for sending the Perl script for generating the test data. Work of Celso C. Ribeiro was partially supported by CNPq research grant 303958/2015-4 and by FAPERJ research grant E-26/201.198/2014, and concluded during a visit to Laboratoire d’Informatique de Modélisation et d’Optimisation des Systèmes of Université Clermont Auvergne, France. This work was also partially sponsored by the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES), Finance Code 001.

Author information

Authors and Affiliations

  1. Instituto Federal de Educação, Ciência e Tecnologia do Triângulo Mineiro, Uberlândia, MG, 38411-104, Brazil

    Bruno Q. Pinto

  2. Institute of Computing, Universidade Federal Fluminense, Niterói, RJ, 24210-240, Brazil

    Celso C. Ribeiro & Isabel Rosseti

  3. Department of Computer Science, Universidade Federal de Minas Gerais, Belo Horizonte, MG, 31270-901, Brazil

    Thiago F. Noronha

Authors
  1. Bruno Q. Pinto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Celso C. Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Isabel Rosseti
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Thiago F. Noronha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Celso C. Ribeiro.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pinto, B.Q., Ribeiro, C.C., Rosseti, I. et al. A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model. J Glob Optim 77, 949–973 (2020). https://doi.org/10.1007/s10898-020-00877-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-020-00877-0

Keywords

Search

Navigation