{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T09:46:25Z","timestamp":1776764785249,"version":"3.51.2"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T00:00:00Z","timestamp":1580688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T00:00:00Z","timestamp":1580688000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"crossref","award":["303958\/2015-4"],"award-info":[{"award-number":["303958\/2015-4"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004586","name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"crossref","award":["E-26\/201.198\/2014"],"award-info":[{"award-number":["E-26\/201.198\/2014"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"crossref","award":["Finance Code 1"],"award-info":[{"award-number":["Finance Code 1"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["Finance Code 1"],"award-info":[{"award-number":["Finance Code 1"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10898-020-00877-0","type":"journal-article","created":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T07:02:33Z","timestamp":1580713353000},"page":"949-973","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model"],"prefix":"10.1007","volume":"77","author":[{"given":"Bruno Q.","family":"Pinto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9478-2351","authenticated-orcid":false,"given":"Celso C.","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isabel","family":"Rosseti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thiago F.","family":"Noronha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,3]]},"reference":[{"key":"877_CR1","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1015061802659","volume":"8","author":"RM Aiex","year":"2002","unstructured":"Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Probability distribution of solution time in GRASP: an experimental investigation. J. Heuristics 8, 343\u2013373 (2002)","journal-title":"J. Heuristics"},{"key":"877_CR2","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"1","author":"RM Aiex","year":"2007","unstructured":"Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: TTTPLOTS: a perl program to create time-to-target plots. Optim. Lett. 1, 355\u2013366 (2007)","journal-title":"Optim. Lett."},{"key":"877_CR3","unstructured":"Alfaro-Fern\u00e1ndez, P., Ruiz, R., Pagnozzi, F., St\u00fctzle, T.: Exploring automatic algorithm design for the hybrid flowshop problem. In: 12th Metaheuristics International Conference, pp. 201\u2013203. Barcelona (2017)"},{"key":"877_CR4","doi-asserted-by":"publisher","first-page":"A94","DOI":"10.1364\/JOCN.1.000A94","volume":"1","author":"D Andrei","year":"2009","unstructured":"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\u2013A105 (2009)","journal-title":"IEEE\/OSA J. Opt. Commun. Netw."},{"key":"877_CR5","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1109\/49.510913","volume":"14","author":"D Banerjee","year":"1996","unstructured":"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\u2013908 (1996)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"877_CR6","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"key":"877_CR7","unstructured":"Bouamama, S., Blum, C.: A population-based iterated greedy algorithm for the knapsack problem with setup. In: 12th Metaheuristics International Conference, pp. 558\u2013565. Barcelona (2017)"},{"key":"877_CR8","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1111\/itor.12178","volume":"22","author":"JS Brand\u00e3o","year":"2015","unstructured":"Brand\u00e3o, 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\u2013839 (2015)","journal-title":"Int. Trans. Oper. Res."},{"key":"877_CR9","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1111\/itor.12429","volume":"24","author":"JS Brand\u00e3o","year":"2016","unstructured":"Brand\u00e3o, 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\u20131077 (2016)","journal-title":"Int. Trans. Oper. Res."},{"key":"877_CR10","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s10898-015-0389-x","volume":"65","author":"JS Brand\u00e3o","year":"2016","unstructured":"Brand\u00e3o, 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\u2013835 (2016)","journal-title":"J. Glob. Optim."},{"key":"877_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1177\/0145445516673998","volume":"41","author":"D Drevon","year":"2017","unstructured":"Drevon, D., Fursa, S.R., Malcolm, A.L.: Intercoder reliability and validity of WebPlotDigitizer in extracting graphed data. Behav. Modif. 41, 323\u2013339 (2017)","journal-title":"Behav. Modif."},{"key":"877_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(99)00152-8","volume":"255","author":"T Erlebach","year":"2001","unstructured":"Erlebach, T., Jansen, K.: The complexity of path coloring and call scheduling. Theor. Comput. Sci. 255, 33\u201350 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"877_CR13","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17, 487\u2013525 (2011)","journal-title":"J. Heuristics"},{"key":"877_CR14","unstructured":"Gon\u00e7alves, 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)"},{"key":"877_CR15","doi-asserted-by":"crossref","unstructured":"Hoos, H.H., St\u00fctzle, T.: Evaluation of Las Vegas algorithms\u2014pitfalls and remedies. In: Cooper, G., Moral, S. (eds.) Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pp. 238\u2013245. Madison (1998)","DOI":"10.1007\/978-3-7091-6492-1_54"},{"key":"877_CR16","unstructured":"Hyytia, E., Virtamo, J.: Wavelength assignment and routing in WDM networks. In: Fourteenth Nordic Teletraffic Seminar, pp. 31\u201340. Copenhagen (1998)"},{"key":"877_CR17","doi-asserted-by":"crossref","unstructured":"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\u2013503. Raleigh (2007)","DOI":"10.1109\/BROADNETS.2007.4550474"},{"key":"877_CR18","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.osn.2008.05.001","volume":"6","author":"A Jaekel","year":"2009","unstructured":"Jaekel, A., Chen, Y.: Resource provisioning for survivable WDM networks under a sliding scheduled traffic model. Opt. Switch. Netw. 6, 44\u201354 (2009)","journal-title":"Opt. Switch. Netw."},{"key":"877_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s11107-014-0478-7","volume":"29","author":"A Jaekel","year":"2015","unstructured":"Jaekel, A., Pare, J., Chen, Y., Shaabana, A., Luo, F.: Traffic grooming of scheduled demands for minimizing energy consumption. Photonic Netw. Commun. 29, 151\u2013163 (2015)","journal-title":"Photonic Netw. Commun."},{"key":"877_CR20","unstructured":"Kleinberg, J.M.: Approximation algorithms for disjoint paths problems. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge (1996)"},{"key":"877_CR21","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1109\/JSAC.2003.816622","volume":"21","author":"J Kuri","year":"2003","unstructured":"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\u20131240 (2003)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"877_CR22","unstructured":"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)"},{"key":"877_CR23","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.osn.2012.05.001","volume":"10","author":"Z Liu","year":"2013","unstructured":"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\u201353 (2013)","journal-title":"Opt. Switch. Netw."},{"key":"877_CR24","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Ib\u00e1nez, M., Dubois-Lacoste, J., St\u00fctzle, T., Birattari, M.: The IRACE package: iterated race for automatic algorithm configuration. Technical Report TR\/IRIDIA\/2011-004, IRIDIA. Universit\u00e9 Libre de Bruxelles, Belgium (2011)","DOI":"10.32614\/CRAN.package.irace"},{"key":"877_CR25","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1109\/4234.1001667","volume":"6","author":"P Manohar","year":"2002","unstructured":"Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and wavelength assignment in optical networks from edge disjoint path algorithms. IEEE Commun. Lett. 6, 211\u2013213 (2002)","journal-title":"IEEE Commun. Lett."},{"key":"877_CR26","unstructured":"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\u2013127. Barcelona (2017)"},{"key":"877_CR27","first-page":"169","volume-title":"Experimental Algorithms, Volume 5038 of Lecture Notes in Computer Science","author":"TF Noronha","year":"2008","unstructured":"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\u2013180. Springer, Berlin (2008)"},{"key":"877_CR28","unstructured":"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"},{"key":"877_CR29","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10898-010-9608-7","volume":"50","author":"TF Noronha","year":"2011","unstructured":"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\u2013518 (2011)","journal-title":"J. Glob. Optim."},{"key":"877_CR30","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/j.ejor.2004.09.007","volume":"171","author":"TF Noronha","year":"2006","unstructured":"Noronha, T.F., Ribeiro, C.C.: Routing and wavelength assignment by partition colouring. Eur. J. Oper. Res. 171, 797\u2013810 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"877_CR31","doi-asserted-by":"crossref","unstructured":"P\u00e9rez C\u00e1ceres, L., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, 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\u201348. Springer, Berlin (2014)","DOI":"10.1007\/978-3-662-44320-0_4"},{"key":"877_CR32","unstructured":"Pinto, B.Q., Ribeiro, C.C., Rosseti, I., Noronha, T.F.: Input data and detailed numerical results for \u2019A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model in WDM optical networks\u2019 (2018). https:\/\/data.mendeley.com\/datasets\/r76d3pjnnk\/. Last accessed on 17 Oct 2018"},{"key":"877_CR33","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/90.469957","volume":"3","author":"R Ramaswami","year":"1995","unstructured":"Ramaswami, R., Sivarajan, K.N.: Routing and wavelength assignment in all-optical networks. IEEE\/ACM Trans. Netw. 3, 489\u2013500 (1995)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"877_CR34","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s11590-011-0322-2","volume":"5","author":"MGC Resende","year":"2011","unstructured":"Resende, M.G.C., Ribeiro, C.C.: Restart strategies for GRASP with path-relinking heuristics. Optim. Lett. 5, 467\u2013478 (2011)","journal-title":"Optim. Lett."},{"key":"877_CR35","unstructured":"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\u2014GECCO\u201916 Companion Volume, pp. 483\u2013514, Denver (2016). Association for Computing Machinery"},{"key":"877_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-6530-4","volume-title":"Optimization by GRASP","author":"MGC Resende","year":"2016","unstructured":"Resende, M.G.C., Ribeiro, C.C.: Optimization by GRASP. Springer, Boston (2016)"},{"key":"877_CR37","unstructured":"Rohatgi, A.: WebPlotDigitizer (Version 4.1) 2018. Last visit in October 6 (2018)"},{"key":"877_CR38","doi-asserted-by":"crossref","unstructured":"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\u20133. Anaheim (2007)","DOI":"10.1109\/OFC.2007.4348937"},{"key":"877_CR39","unstructured":"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\u2013202 (2008)"},{"key":"877_CR40","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/JSAC.2006.1677251","volume":"24","author":"N Skorin-Kapov","year":"2006","unstructured":"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\u201315 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"877_CR41","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1016\/j.ejor.2006.01.003","volume":"177","author":"N Skorin-Kapov","year":"2007","unstructured":"Skorin-Kapov, N.: Routing and wavelength assigment in optical networks using bin packing based algorithms. Eur. J. Oper. Res. 177, 1167\u20131179 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"877_CR42","unstructured":"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\u2013236. Morgan Kaufman, San Mateo (1991)"},{"key":"877_CR43","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1080\/10556788.2014.890197","volume":"30","author":"RF Toso","year":"2015","unstructured":"Toso, R.F., Resende, M.G.C.: A C++ application programming interface for biased random-key genetic algorithms. Optim. Methods Softw. 30, 81\u201393 (2015)","journal-title":"Optim. Methods Softw."},{"key":"877_CR44","unstructured":"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)"},{"key":"877_CR45","doi-asserted-by":"crossref","unstructured":"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\u201322. Boston (2005)","DOI":"10.1109\/ICBN.2005.1589596"},{"key":"877_CR46","first-page":"47","volume":"1","author":"H Zang","year":"2000","unstructured":"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\u201360 (2000)","journal-title":"Opt. Netw. Mag."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00877-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-020-00877-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00877-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T23:56:16Z","timestamp":1722383776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-020-00877-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,3]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["877"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00877-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,3]]},"assertion":[{"value":"21 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}