{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T16:16:18Z","timestamp":1756311378097},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,12,19]],"date-time":"2015-12-19T00:00:00Z","timestamp":1450483200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Brazilian National Council for Scientific and Technological Development (CNPq)"},{"name":"Foundation for Support of Research of the State of Minas Gerais (FAPEMIG)"},{"name":"Foundation for Support of Research of the State of Rio de Janeiro (FAPERJ)"},{"name":"Coordination for the Improvement of Higher Education Personnel (CAPES)"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10898-015-0389-x","type":"journal-article","created":{"date-parts":[[2015,12,19]],"date-time":"2015-12-19T08:40:46Z","timestamp":1450514446000},"page":"813-835","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks"],"prefix":"10.1007","volume":"65","author":[{"given":"Julliany S.","family":"Brand\u00e3o","sequence":"first","affiliation":[]},{"given":"Thiago F.","family":"Noronha","sequence":"additional","affiliation":[]},{"given":"Celso C.","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,19]]},"reference":[{"key":"389_CR1","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1023\/A:1015061802659","volume":"8","author":"R Aiex","year":"2002","unstructured":"Aiex, R., Resende, M., Ribeiro, C.C.: Probability distribution of solution time in GRASP: an experimental investigation. J. Heuristics 8, 343\u2013373 (2002)","journal-title":"J. Heuristics"},{"key":"389_CR2","doi-asserted-by":"crossref","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":"389_CR3","doi-asserted-by":"crossref","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":"389_CR4","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"2","author":"JC 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":"389_CR5","doi-asserted-by":"crossref","unstructured":"Belgacem, L., Puech, N.: Solving large size instances of the RWA problem using graph partitioning. In: International Conference on Optical Network Design and Modeling, IEEE, Barcelona (2008)","DOI":"10.1109\/ONDM.2008.4578389"},{"key":"389_CR6","doi-asserted-by":"crossref","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":"389_CR7","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1002\/net.20070","volume":"46","author":"LS 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\u2013IS routing. Networks 46, 36\u201356 (2005)","journal-title":"Networks"},{"key":"389_CR8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1002\/net.20141","volume":"49","author":"LS 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":"389_CR9","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s11590-010-0226-6","volume":"4","author":"LS Buriol","year":"2010","unstructured":"Buriol, L.S., Hirsch, M.J., Pardalos, P.M., Querido, T., Resende, M.G.C., Ritt, M.: A biased random-key genetic algorithm for road congestion minimization. Optim. Lett. 4, 619\u2013633 (2010)","journal-title":"Optim. Lett."},{"key":"389_CR10","doi-asserted-by":"crossref","unstructured":"Chen, C., Banerjee, S.: A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks. In: Proceedings of the Fifteenth Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation, vol. 1, pp. 64\u2013171. San Francisco (1996)","DOI":"10.1109\/INFCOM.1996.497890"},{"key":"389_CR11","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":"389_CR12","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1109\/LCOMM.2005.05011","volume":"9","author":"C Dzongang","year":"2005","unstructured":"Dzongang, C., Galinier, P., Pierre, S.: A tabu search heuristic for the routing and wavelength assignment problem in optical networks. IEEE Commun. Lett. 9, 426\u2013428 (2005)","journal-title":"IEEE Commun. Lett."},{"key":"389_CR13","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":"389_CR14","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":"389_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.ejor.2004.03.012","volume":"167","author":"JF Gon\u00e7alves","year":"2005","unstructured":"Gon\u00e7alves, J.F., de Magalh\u00e3es Mendes, J.J., 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":"389_CR16","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1023\/A:1020377910258","volume":"8","author":"JF Gon\u00e7alves","year":"2002","unstructured":"Gon\u00e7alves, J.F., Mendes, J.J.M.: A hybrid genetic algorithm for assembly line balancing. J. Heuristics 8, 629\u2013642 (2002)","journal-title":"J. Heuristics"},{"key":"389_CR17","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.cie.2004.07.003","volume":"47","author":"JF 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":"389_CR18","doi-asserted-by":"crossref","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":"389_CR19","doi-asserted-by":"crossref","unstructured":"Goulart, N., de Souza, S.R., Dias, L.G.S., Noronha, T.F.: Biased random-key genetic algorithm for fiber installation in optical network optimization. In: Proceedings of the 2011 IEEE Congress on Evolutionary Computation, pp. 2267\u20132271. New Orleans (2011)","DOI":"10.1109\/CEC.2011.5949896"},{"key":"389_CR20","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"389_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics","author":"M Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, vol. 2. Springer, Berlin (1993)"},{"key":"389_CR22","doi-asserted-by":"crossref","unstructured":"Hoos, H., St\u00fctzle, 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\u2013245. Madison (1998)","DOI":"10.1007\/978-3-7091-6492-1_54"},{"issue":"2","key":"389_CR23","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1109\/71.265940","volume":"5","author":"ES Hou","year":"1994","unstructured":"Hou, E.S., Ansari, N., Ren, H.: A genetic algorithm for multiprocessor scheduling. IEEE Trans. Parallel Distrib. Syst. 5(2), 113\u2013120 (1994)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"389_CR24","unstructured":"Hyyti\u00e4, E., Virtamo, J.: Wavelength assignment and routing in WDM networks. In: Fourteenth Nordic Teletraffic Seminar, pp. 31\u201340. Copenhagen (1998)"},{"key":"389_CR25","unstructured":"Hyyti\u00e4, E., Virtamo, J.: Wavelength assignment in multifibre in WDM-networks. Technical report COST257TD(99)04, Helsinki University of Technology (1999)"},{"key":"389_CR26","doi-asserted-by":"crossref","unstructured":"Jaumard, B., Meyer, C., Thiongane, B., Yu, X.: ILP formulations and optimal solutions for the RWA problem. In: Proceedings of the IEEE Global Telecommunications Conference, vol. 3, pp. 1918\u20131924. Dallas (2004)","DOI":"10.1109\/GLOCOM.2004.1378328"},{"key":"389_CR27","doi-asserted-by":"crossref","unstructured":"Jaumard, B., Meyer, C., Thiongane, B.: ILP formulations for the routing and wavelength assignment problem: symmetric systems. In: Handbook of Optimization in Telecommunications, pp. 637\u2013677. Springer, Berlin (2006)","DOI":"10.1007\/978-0-387-30165-5_23"},{"key":"389_CR28","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1364\/JON.5.000881","volume":"5","author":"B Jaumard","year":"2006","unstructured":"Jaumard, B., Meyer, C., Yu, X.: How much wavelength conversion allows a reduction in the blocking rate? J. Opt. Netw. 5, 81\u2013900 (2006)","journal-title":"J. Opt. Netw."},{"key":"389_CR29","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.osn.2007.05.002","volume":"4","author":"B Jaumard","year":"2007","unstructured":"Jaumard, B., Meyer, C., Thiongane, B.: Comparison of ILP formulations for the RWA problem. Opt. Switch. Netw. 4, 157\u2013172 (2007)","journal-title":"Opt. Switch. Netw."},{"key":"389_CR30","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":"389_CR31","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3, 299\u2013325 (1974)","journal-title":"SIAM J. Comput."},{"key":"389_CR32","unstructured":"Kleinberg, J.: Approximation algorithms for disjoint paths problems. Ph.D. thesis, MIT, Cambridge (1996)"},{"key":"389_CR33","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1109\/4234.957386","volume":"5","author":"R Krishnaswamy","year":"2001","unstructured":"Krishnaswamy, R., Sivarajan, K.: Algorithms for routing and wavelength assignment based on solutions of LP-relaxation. IEEE Commun. Lett. 5, 435\u2013437 (2001)","journal-title":"IEEE Commun. Lett."},{"key":"389_CR34","doi-asserted-by":"crossref","first-page":"2146","DOI":"10.1109\/49.887934","volume":"18","author":"T Lee","year":"2000","unstructured":"Lee, T., Lee, K., Park, S.: Optimal routing and wavelength assignment in WDM ring networks. IEEE J. Sel. Areas Commun. 18, 2146\u20132154 (2000)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"389_CR35","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/j.cie.2010.01.002","volume":"58","author":"D Lei","year":"2010","unstructured":"Lei, D.: Fuzzy job shop scheduling problem with availability constraints. Comput. Ind. Eng. 58, 610\u2013617 (2010)","journal-title":"Comput. Ind. Eng."},{"key":"389_CR36","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, pp. 1\u201319. Dallas (2000)"},{"key":"389_CR37","doi-asserted-by":"crossref","first-page":"3016","DOI":"10.1016\/j.cor.2005.11.011","volume":"34","author":"S Malve","year":"2007","unstructured":"Malve, S., Uzsoy, R.: A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families. Comput. Oper. Res. 34, 3016\u20133028 (2007)","journal-title":"Comput. Oper. Res."},{"key":"389_CR38","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":"389_CR39","first-page":"43","volume":"2","author":"G Markovi\u0107","year":"2010","unstructured":"Markovi\u0107, G., A\u0107imovi\u0107-Raspopovi\u0107, V.: Solving the RWA problem in WDM optical networks using the BCO meta-heuristic. Telfor J. 2, 43\u201348 (2010)","journal-title":"Telfor J."},{"key":"389_CR40","doi-asserted-by":"crossref","unstructured":"Martins, A.X., Duhamel, C., De\u00a0Souza, M.C., Saldanha, R.R., Mahey, P.: A VND-ILS heuristic to solve the RWA problem. In: Pahl, J., Reiners, T., Vo, S. (eds.) Network Optimization, pp. 577\u2013582. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-21527-8_64"},{"key":"389_CR41","unstructured":"Martins, A.X., Duhamel, C., Mahey, P., de Souza, M.C., Saldanha, R.R.: Gera\u00e7\u00e3o de colunas para o problema de roteamento e atribui\u00e7\u00e3o de comprimentos de onda. In: Anais do XLIV Simp. Bras. Pesq. Operacional, pp. 1\u201312. Rio de Janeiro (2012)"},{"key":"389_CR42","unstructured":"Martins, A.X.: Metaheur\u00edsticas e formula\u00e7\u00f5es para a resolu\u00e7\u00e3o do problema de roteamento e aloca\u00e7\u00e3o de comprimentos de onda em redes \u00f3pticas. Ph.D. thesis, Universidade Federal de Minas Gerais (2011)"},{"key":"389_CR43","doi-asserted-by":"crossref","first-page":"2133","DOI":"10.1016\/j.cor.2011.10.022","volume":"39","author":"AX Martins","year":"2012","unstructured":"Martins, A.X., Duhamel, C., Mahey, P., Saldanha, R.R., de Souza, M.C.: Variable neighborhood descent with iterated local search for routing and wavelength assignment. Comput. Oper. Res. 39, 2133\u20132141 (2012)","journal-title":"Comput. Oper. Res."},{"key":"389_CR44","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-540-68552-4_13","volume":"5038","author":"TF Noronha","year":"2008","unstructured":"Noronha, T.F., Resende, M.G.C., Ribeiro, C.C.: Efficient implementation of heuristics for routing and wavelength assigment. Lect. Notes Comput. Sci. 5038, 169\u2013180 (2008)","journal-title":"Lect. Notes Comput. Sci."},{"key":"389_CR45","doi-asserted-by":"crossref","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. Global Optim. 50, 503\u2013518 (2011)","journal-title":"J. Global Optim."},{"key":"389_CR46","doi-asserted-by":"crossref","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 coloring. Eur. J. Oper. Res. 171, 797\u2013810 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"389_CR47","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/LCOMM.2002.804249","volume":"6","author":"H Qin","year":"2002","unstructured":"Qin, H., Liu, Z., Zhang, S., Wen, A.: Routing and wavelength assignment based on genetic algorithm. Commun. Lett. 6(10), 455\u2013457 (2002)","journal-title":"Commun. Lett."},{"key":"389_CR48","doi-asserted-by":"crossref","unstructured":"Ramaswami, R., Sivarajan, K.: Optimal routing and wavelength assignment in all-optical networks. In: Proceedings of IEEE INFOCOM Conference on Computer Communications, pp. 970\u2013979. Toronto (1994)","DOI":"10.1109\/INFCOM.1994.337639"},{"key":"389_CR49","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1111\/j.1475-3995.2010.00771.x","volume":"18","author":"R Reis","year":"2011","unstructured":"Reis, R., Ritt, M., Buriol, L.S., Resende, M.G.C.: A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion. Int. Trans. Oper. Res. 18, 401\u2013423 (2011)","journal-title":"Int. Trans. Oper. Res."},{"key":"389_CR50","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1007\/s11590-014-0760-8","volume":"9","author":"CC Ribeiro","year":"2015","unstructured":"Ribeiro, C.C., Rosseti, I.: tttplots-compare: a perl program to compare time-to-target plots or general runtime distributions of randomized algorithms. Optim. Lett. 9, 601\u2013614 (2015)","journal-title":"Optim. Lett."},{"key":"389_CR51","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10898-011-9769-z","volume":"54","author":"CC Ribeiro","year":"2012","unstructured":"Ribeiro, C.C., Rosseti, I., Vallejos, R.: Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms. J. Global Optim. 54, 405\u2013429 (2012)","journal-title":"J. Global Optim."},{"issue":"1","key":"389_CR52","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/s10878-014-9710-8","volume":"28","author":"L Roque","year":"2014","unstructured":"Roque, L., Fontes, D., Fontes, F.: A hybrid biased random key genetic algorithm approach for the unit commitment problem. J. Comb. Optim. 28(1), 140\u2013166 (2014)","journal-title":"J. Comb. Optim."},{"key":"389_CR53","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":"389_CR54","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 assigment in optical networks using bin packing based algorithms. Eur. J. Oper. Res. 177, 1167\u20131179 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"389_CR55","first-page":"230","volume-title":"Proceedings of the Fourth International Conference on Genetic Algorithms","author":"W Spears","year":"1991","unstructured":"Spears, W., deJong, 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. Morgan Kaufman, San Mateo (1991)"},{"key":"389_CR56","doi-asserted-by":"crossref","first-page":"1621","DOI":"10.1016\/S0305-0548(01)00031-4","volume":"29","author":"CS Wang","year":"2002","unstructured":"Wang, C.S., Uzsoy, R.: A genetic algorithm to minimize maximum lateness on a batch processing machine. Comput. Oper. Res. 29, 1621\u20131640 (2002)","journal-title":"Comput. Oper. Res."},{"key":"389_CR57","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."},{"key":"389_CR58","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.cie.2014.07.012","volume":"89","author":"JN Zheng","year":"2015","unstructured":"Zheng, J.N., Chien, C.F., Gen, M.: Multi-objective multi-population biased random-key genetic algorithm for the 3-D container loading problem. Comput. Ind. Eng. 89, 80\u201387 (2015)","journal-title":"Comput. Ind. Eng."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0389-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-015-0389-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0389-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T19:08:01Z","timestamp":1567451281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-015-0389-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,19]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["389"],"URL":"https:\/\/doi.org\/10.1007\/s10898-015-0389-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,19]]}}}