{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:16:33Z","timestamp":1760645793982},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,9,24]],"date-time":"2010-09-24T00:00:00Z","timestamp":1285286400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s10898-010-9608-7","type":"journal-article","created":{"date-parts":[[2010,9,23]],"date-time":"2010-09-23T11:10:42Z","timestamp":1285240242000},"page":"503-518","source":"Crossref","is-referenced-by-count":59,"title":["A biased random-key genetic algorithm for routing and wavelength assignment"],"prefix":"10.1007","volume":"50","author":[{"given":"Thiago F.","family":"Noronha","sequence":"first","affiliation":[]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[]},{"given":"Celso C.","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,24]]},"reference":[{"key":"9608_CR1","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1023\/A:1015061802659","volume":"8","author":"R.M. 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":"9608_CR2","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"1","author":"R.M. 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":"9608_CR3","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1109\/49.510913","volume":"14","author":"D. Bannerjee","year":"1995","unstructured":"Bannerjee D., Mukherjee B.: Practical approach for routing and wavelength assignment in large wavelength routed optical networks. IEEE J. Sel. Areas Commun. 14, 903\u2013908 (1995)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9608_CR4","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"2","author":"J.C. Bean","year":"1994","unstructured":"Bean J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 2, 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"key":"9608_CR5","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1002\/net.20070","volume":"46","author":"L.S. Buriol","year":"2005","unstructured":"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\u201356 (2005)","journal-title":"Networks"},{"key":"9608_CR6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1002\/net.20141","volume":"49","author":"L.S. Buriol","year":"2007","unstructured":"Buriol L.S., Resende M.G.C., Thorup M.: Survivable IP network design with OSPF routing. Networks 49, 51\u201364 (2007)","journal-title":"Networks"},{"key":"9608_CR7","unstructured":"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\u20131115. Paris (2000)"},{"key":"9608_CR8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/A:1014852026591","volume":"6","author":"M. Ericsson","year":"2002","unstructured":"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\u2013333 (2002)","journal-title":"J. Comb. Optim."},{"key":"9608_CR9","doi-asserted-by":"crossref","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":"9608_CR10","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1002\/net.20365","volume":"55","author":"Y. Frota","year":"2010","unstructured":"Frota Y., Maculan N., Noronha T.F., Ribeiro C.C.: A branch-and-cut algorithm for partition coloring. Networks 55, 194\u2013204 (2010)","journal-title":"Networks"},{"key":"9608_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.ejor.2004.03.012","volume":"167","author":"J.F. Gon\u00e7alves","year":"2005","unstructured":"Gon\u00e7alves 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\u201395 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"9608_CR12","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1016\/j.ejor.2006.06.074","volume":"189","author":"J.F. Gon\u00e7alves","year":"2008","unstructured":"Gon\u00e7alves 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\u20131190 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9608_CR13","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.cor.2007.07.001","volume":"36","author":"J.F. Gon\u00e7alves","year":"2009","unstructured":"Gon\u00e7alves 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\u2013109 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9608_CR14","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.cie.2004.07.003","volume":"47","author":"J.F. Gon\u00e7alves","year":"2004","unstructured":"Gon\u00e7alves J.F., Resende M.G.C.: An evolutionary algorithm for manufacturing cell formation. Comput. Ind. Eng. 47, 247\u2013273 (2004)","journal-title":"Comput. Ind. Eng."},{"key":"9608_CR15","unstructured":"Gon\u00e7alves, 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)"},{"key":"9608_CR16","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"Hertz A., de Werra D.: Using tabu search techniques for graph coloring. Computing 39, 345\u2013351 (1987)","journal-title":"Computing"},{"key":"9608_CR17","unstructured":"Hyytia, E., Virtamo, J.: Wavelength assignment and routing in WDM networks. In: Fourteenth Nordic Teletraffic Seminar, pp. 31\u201340. Copenhagen (1998)"},{"key":"9608_CR18","unstructured":"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)"},{"key":"9608_CR19","unstructured":"Jaumard, B., Meyer, C., Thiongane, B.: ILP formulations for the RWA problem for symmetrical systems. In: Handbook for Optimization in Telecommunications, pp. 637\u2013677. Springer Science + Business Media (2006)"},{"key":"9608_CR20","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1016\/j.dam.2008.08.033","volume":"157","author":"B. Jaumard","year":"2009","unstructured":"Jaumard B., Meyer C., Thiongane B.: On column generation formulations for the RWA problem. Discrete Appl. Math. 157, 1291\u20131308 (2009)","journal-title":"Discrete Appl. Math."},{"key":"9608_CR21","unstructured":"Kleinberg, J.M.: Approximation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge (1996)"},{"key":"9608_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":"9608_CR23","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/4234.1001667","volume":"5","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. 5, 211\u2013213 (2002)","journal-title":"IEEE Commun. Lett."},{"key":"9608_CR24","doi-asserted-by":"crossref","unstructured":"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\u2013180. Springer, Provincetown, Mass (2008)","DOI":"10.1007\/978-3-540-68552-4_13"},{"key":"9608_CR25","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/j.ejor.2004.09.007","volume":"171","author":"T.F. Noronha","year":"2006","unstructured":"Noronha T.F., Ribeiro C.C.: Routing and wavelength assignment by partition coloring. Eur. J. Oper. Res. 171, 797\u2013810 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9608_CR26","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/355826.355828","volume":"5","author":"L. Schrage","year":"1979","unstructured":"Schrage L.: A more portable Fortran random number generator. ACM Trans. Math. Softw. 5, 132\u2013138 (1979)","journal-title":"ACM Trans. Math. Softw."},{"key":"9608_CR27","doi-asserted-by":"crossref","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 assignment in optical networks using bin packing based algorithms. Eur. J. Oper. Res. 177, 1167\u20131179 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9608_CR28","unstructured":"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\u2013236. San Mateo, Morgan Kaufman (1991)"},{"key":"9608_CR29","first-page":"47","volume":"1","author":"H. Zang","year":"2000","unstructured":"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\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-010-9608-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-010-9608-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9608-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T18:12:09Z","timestamp":1711822329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-010-9608-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,24]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9608"],"URL":"https:\/\/doi.org\/10.1007\/s10898-010-9608-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,24]]}}}