{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:24:55Z","timestamp":1761895495947},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,6,13]],"date-time":"2012-06-13T00:00:00Z","timestamp":1339545600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s11590-012-0505-5","type":"journal-article","created":{"date-parts":[[2012,6,12]],"date-time":"2012-06-12T06:48:28Z","timestamp":1339483708000},"page":"1303-1324","source":"Crossref","is-referenced-by-count":25,"title":["A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks"],"prefix":"10.1007","volume":"7","author":[{"given":"Dalila B. M. M.","family":"Fontes","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Fernando","family":"Gon\u00e7alves","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,13]]},"reference":[{"key":"505_CR1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","volume":"91","author":"R. Ahuja","year":"2001","unstructured":"Ahuja R., Orlin J.: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Math. Program. 91, 71\u201397 (2001)","journal-title":"Math. Program."},{"key":"505_CR2","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley J.E.: Or-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"505_CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TCOM.1977.1093708","volume":"COM-25","author":"R. Boorstyn","year":"1977","unstructured":"Boorstyn R., Frank H.: Large-scale network topological optimization. IEEE Trans. Commun. COM-25, 29\u201347 (1977)","journal-title":"IEEE Trans. Commun."},{"key":"505_CR4","volume-title":"Introduction to algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to algorithms. MIT press, Cambridge (2001)","edition":"2"},{"key":"505_CR5","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/978-0-387-30165-5_19","volume-title":"Handbooks of Telecommunications","author":"G. Dahl","year":"2006","unstructured":"Dahl G., Gouveia L., Requejo C.: On formulations and methods for the hop-constrained minimum spanning tree problem. In: Pardalos, P.M., Resende, M. (eds) Handbooks of Telecommunications, pp. 493\u2013515. Springer, Berlin (2006)"},{"key":"505_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/78952.78953","volume":"8","author":"S.E. Deering","year":"1990","unstructured":"Deering S.E., Cheriton D.R.: Multicast routing in datagram internetworks and extended lans. ACM Trans. Comput. Syst. 8, 85\u2013110 (1990)","journal-title":"ACM Trans. Comput. Syst."},{"key":"505_CR7","doi-asserted-by":"crossref","unstructured":"Deering, S.E., Esrtrin, D., Farinacci, D.: An architecture for wide-area multicast routing. Proceedings of SIGCOMM (1994)","DOI":"10.1145\/190314.190326"},{"key":"505_CR8","first-page":"13","volume":"48","author":"D.B.M.M. Fontes","year":"2010","unstructured":"Fontes D.B.M.M.: Optimal hop-constrained trees for nonlinear cost flow networks. INFOR 48, 13\u201322 (2010)","journal-title":"INFOR"},{"key":"505_CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/net.20167","volume":"50","author":"D.B.M.M. Fontes","year":"2007","unstructured":"Fontes D.B.M.M., Gon\u00e7alves J.F.: Heuristic solutions for general concave minimum cost network flow problems. Networks 50, 67\u201376 (2007)","journal-title":"Networks"},{"key":"505_CR10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.10076","volume":"41","author":"D.B.M.M. Fontes","year":"2003","unstructured":"Fontes D.B.M.M., Hadjiconstantinou E., Christofides N.: Upper bounds for single source uncapacitated minimum concave-cost network flow problems. Networks 41, 221\u2013228 (2003)","journal-title":"Networks"},{"key":"505_CR11","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10898-005-1658-x","volume":"34","author":"D.B.M.M. Fontes","year":"2006","unstructured":"Fontes D.B.M.M., Hadjiconstantinou E., Christofides N.: A branch-and-bound algorithm for concave network flow problems. J. Global Optim. 34, 127\u2013155 (2006)","journal-title":"J. Global Optim."},{"key":"505_CR12","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1016\/j.ejor.2005.03.024","volume":"174","author":"D.B.M.M. Fontes","year":"2006","unstructured":"Fontes D.B.M.M., Hadjiconstantinou E., Christofides N.: A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems. Eur. J. Oper. Res. 174, 1205\u20131219 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"505_CR13","unstructured":"Fontes, D.B.M.M., Gon\u00e7alves, J.F.: Upper bounds for single source uncapacitated concave minimum cost network flow problems. Proceedings of INOC\u2014International Network Optimization Conference (2009)"},{"key":"505_CR14","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.3230090202","volume":"9","author":"G. Gallo","year":"1979","unstructured":"Gallo G., Sodini C.: Adjacent extreme flows and application to min concave cost flow problems. Networks 9, 95\u2013121 (1979)","journal-title":"Networks"},{"key":"505_CR15","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1016\/S0965-9978(01)00007-2","volume":"32","author":"M. Gen","year":"2001","unstructured":"Gen M., Cheng R., Oren S.: Network design techniques using adapted genetic algorithms. Adv. Eng. Softw. 32, 731\u2013744 (2001)","journal-title":"Adv. Eng. Softw."},{"key":"505_CR16","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.ijpe.2004.05.026","volume":"98","author":"M. Gen","year":"2005","unstructured":"Gen M., Kumar A., Kim R.: Recent network design techniques using evolutionary algorithms. Int. J. Prod. Econ. 98, 251\u2013261 (2005)","journal-title":"Int. J. Prod. Econ."},{"key":"505_CR17","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1016\/j.ejor.2006.06.074","volume":"189","author":"J.F. Gon\u00e7alves","year":"2009","unstructured":"Gon\u00e7alves J.F., Mendes J.J.M., Resende M.: A genetic algorithm for the resource constrained multi-project scheduling problem. Eur. J. Oper. Res. 189, 1171\u20131190 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"505_CR18","first-page":"1","volume":"22","author":"J. Gon\u00e7alves","year":"2010","unstructured":"Gon\u00e7alves J., Resende M.: A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. J. Comb. Optim. 22, 1\u201322 (2010)","journal-title":"J. Comb. Optim."},{"key":"505_CR19","first-page":"1","volume":"17","author":"J. Gon\u00e7alves","year":"2010","unstructured":"Gon\u00e7alves J., Resende M., Mendes J.: A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem. J. Heuristics 17, 1\u201320 (2010)","journal-title":"J. Heuristics"},{"issue":"9","key":"505_CR20","doi-asserted-by":"crossref","first-page":"2683","DOI":"10.1080\/00207543.2010.532936","volume":"49","author":"J. Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves J., Sousa P.: A genetic algorithm for lot sizing and scheduling under capacity constraints and allowing backorders. Int. J. Prod. Res. 49(9), 2683\u20132703 (2011)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"505_CR21","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1016\/j.ejor.2005.11.062","volume":"183","author":"J. Gon\u00e7alves","year":"2007","unstructured":"Gon\u00e7alves J.: A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem. Eur. J. Oper. Res. 183(3), 1212\u20131229 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"505_CR22","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1023\/A:1020377910258","volume":"8","author":"J. Gon\u00e7alves","year":"2002","unstructured":"Gon\u00e7alves J., Almeida J.: A hybrid genetic algorithm for assembly line balancing. J. Heuristics 8, 629\u2013642 (2002)","journal-title":"J. Heuristics"},{"issue":"1","key":"505_CR23","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.ejor.2004.03.012","volume":"167","author":"J. Gon\u00e7alves","year":"2005","unstructured":"Gon\u00e7alves J., Mendes J., Resende M.: A hybrid genetic algorithm for the job shop scheduling problem. Eur. J. Oper. Res. 167(1), 77\u201395 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"505_CR24","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.cie.2004.07.003","volume":"47","author":"J. Gon\u00e7alves","year":"2004","unstructured":"Gon\u00e7alves J., Resende M.: An evolutionary algorithm for manufacturing cell formation. Comput. Ind. Eng. 47, 247\u2013273 (2004)","journal-title":"Comput. Ind. Eng."},{"key":"505_CR25","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"J. Gon\u00e7alves","year":"2010","unstructured":"Gon\u00e7alves J., Resende M.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17, 487\u2013525 (2010)","journal-title":"J. Heuristics"},{"key":"505_CR26","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.cor.2011.03.009","volume":"39","author":"J. Gon\u00e7alves","year":"2012","unstructured":"Gon\u00e7alves J., Resende M.: A parallel multi-population biased randomkey genetic algorithm for a container loading problem. Comput. Oper. Res. 39, 179\u2013190 (2012)","journal-title":"Comput. Oper. Res."},{"key":"505_CR27","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/0305-0548(94)00074-I","volume":"22","author":"L. Gouveia","year":"1995","unstructured":"Gouveia L.: Using the Miller\u2013Tucker\u2013Zemlin constraints to formulate a minimal spanning tree problem with hop constraints. Comput. Oper. Res. 22, 959\u2013970 (1995)","journal-title":"Comput. Oper. Res."},{"key":"505_CR28","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/0377-2217(95)00090-9","volume":"91","author":"L. Gouveia","year":"1996","unstructured":"Gouveia L.: Multicommodity flow models for spanning trees with hop constraints. Eur. J. Oper. Res. 91, 178\u2013190 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"505_CR29","doi-asserted-by":"crossref","first-page":"2435","DOI":"10.1016\/j.cor.2004.03.011","volume":"32","author":"L. Gouveia","year":"2005","unstructured":"Gouveia L., Martins P.: The capacitated minimum spanning tree problem: revisiting hop-indexed formulations. Comput. Oper. Res. 32, 2435\u20132452 (2005)","journal-title":"Comput. Oper. Res."},{"key":"505_CR30","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S0377-2217(00)00143-0","volume":"132","author":"L. Gouveia","year":"2001","unstructured":"Gouveia L., Requejo C.: A new lagrangean relaxation approach for the hop-constrained minimum spanning tree problem. Eur. J. Oper. Res. 132, 539\u2013552 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"505_CR31","unstructured":"Han, L., Wang, Y., Guo, F.: A new genetic algorithm for the degree-constrained minimum spanning tree problem. IEEE International Workshop on VLSI Design and Video Technology, pp. 125\u2013128 (2005)"},{"key":"505_CR32","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. Holland","year":"1975","unstructured":"Holland J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)"},{"key":"505_CR33","doi-asserted-by":"crossref","first-page":"2648","DOI":"10.1016\/j.cor.2005.10.009","volume":"34","author":"R. Kawatra","year":"2007","unstructured":"Kawatra R.: A hop constrained min-sum arborescence with outage costs. Comput. Oper. Res. 34, 2648\u20132656 (2007)","journal-title":"Comput. Oper. Res."},{"key":"505_CR34","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/90.234851","volume":"1","author":"V. Kompella","year":"1993","unstructured":"Kompella V., Pasquale J., Polyzos G.: Multicast routing for multimedia communication. IEEE\/ACM Trans. Netw. 1, 286\u2013292 (1993)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"6","key":"505_CR35","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1109\/CEC.2006.1688383","volume":"1","author":"E. Lacerda","year":"2006","unstructured":"Lacerda E., Medeiros M.: A genetic algorithm for the capacitated minimum spanning tree problem. IEEE Congr. Evol. Comput. 1(6), 725\u2013729 (2006)","journal-title":"IEEE Congr. Evol. Comput."},{"key":"505_CR36","unstructured":"LeBlanc, L., Reddoch, R.: Reliable link topology\/capacity design and routing in backbone telecommunication networks. First ORSA telecommunications SIG conference (1990)"},{"key":"505_CR37","doi-asserted-by":"crossref","first-page":"1371","DOI":"10.1016\/j.comcom.2005.01.001","volume":"28","author":"Y. Lee","year":"2005","unstructured":"Lee Y., Atiquzzaman M.: Least cost heuristic for the delay constrained capacitated minimum spanning tree problem. Comput. Commun. 28, 1371\u20131379 (2005)","journal-title":"Comput. Commun."},{"key":"505_CR38","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s00186-007-0175-8","volume":"67","author":"M. Lelarge","year":"2008","unstructured":"Lelarge M.: Packet reordering in networks with heavy-tailed delays. Math. Methods Oper. Res. 67, 341\u2013371 (2008)","journal-title":"Math. Methods Oper. Res."},{"key":"505_CR39","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1016\/j.ejor.2003.10.008","volume":"161","author":"R. Montemanni","year":"2005","unstructured":"Montemanni R., Gambardella L.: A benders decomposition approach for the robust spanning tree problem with interval data. Eur. J. Oper. Res. 161, 771\u2013779 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"505_CR40","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10589-007-9060-x","volume":"39","author":"A. Nahapetyan","year":"2008","unstructured":"Nahapetyan A., Pardalos P.: Adaptive dynamic cost updating procedure for solving fixed charge network flow problems. Comput. Optim. Appl. 39, 37\u201350 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"505_CR41","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1145\/63039.63042","volume":"31","author":"S.K. Park","year":"1998","unstructured":"Park S.K., Miller K.W.: Random number generators: good ones are hard to find. Commun. ACM 31, 1192\u20131201 (1998)","journal-title":"Commun. ACM"},{"key":"505_CR42","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","volume":"7","author":"G. Raidl","year":"2003","unstructured":"Raidl G., Julstrom B.: Edge sets: an effective evolutionary coding of spanning trees. IEEE Trans. Evol. Comput. 7, 225\u2013239 (2003)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"505_CR43","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s11590-009-0114-0","volume":"3","author":"S. Rebennack","year":"2009","unstructured":"Rebennack S., Nahapetyan A., Pardalos P.M.: Bilinear modeling solution approach for fixed charge network flow problems. Optim. Lett. 3, 347\u2013355 (2009)","journal-title":"Optim. Lett."},{"key":"505_CR44","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1109\/TEVC.2006.880730","volume":"11","author":"E. Thompson","year":"2007","unstructured":"Thompson E., Paulden T., Smith D.: The dandelion code: a new coding of spanning trees for genetic algorithms. IEEE Trans. Evol. Comput. 11, 91\u2013100 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"505_CR45","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0305-0548(88)90033-0","volume":"15","author":"K. Woolston","year":"1988","unstructured":"Woolston K., Albin S.: The design of centralized networks with reliability and availability constraints. Comput. Oper. Res. 15, 207\u2013217 (1988)","journal-title":"Comput. Oper. Res."},{"key":"505_CR46","unstructured":"Zeng, Y., Wang, Y.: A new genetic algorithm with local search method for degree-constrained minimum spanning tree problems. ICCIMA\u20145th International Conference on Computational Intelligence and Multimedia Applications, pp. 218\u2013222 (September 2003)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0505-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0505-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0505-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:32Z","timestamp":1559409092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0505-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,13]]},"references-count":46,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["505"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0505-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,13]]}}}