{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:01:04Z","timestamp":1778601664287,"version":"3.51.4"},"reference-count":77,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1109\/tevc.2011.2173579","type":"journal-article","created":{"date-parts":[[2012,2,10]],"date-time":"2012-02-10T19:25:48Z","timestamp":1328901948000},"page":"829-846","source":"Crossref","is-referenced-by-count":19,"title":["Efficient Forest Data Structure for Evolutionary Algorithms Applied to Network Design"],"prefix":"10.1109","volume":"16","author":[{"given":"Alexandre C. B.","family":"Delbem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Telma W.","family":"de Lima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guilherme P.","family":"Telles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.880730"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_7"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/BF02614369"},{"key":"ref70","article-title":"Asynchronous teams","author":"talukdar","year":"1993","journal-title":"Proc 4th Int Symp Expert Syst Applicat Power Syst"},{"key":"ref76","author":"zeng","year":"1997","journal-title":"Heuristic search strategies to solve transportation network design problems"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<91::AID-NET3>3.0.CO;2-F"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7744-1"},{"key":"ref39","author":"kershenbaum","year":"1993","journal-title":"Telecommunications Network Design Algorithms"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1002\/atr.5670360106"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068108"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892328"},{"key":"ref32","first-page":"283","article-title":"The effects of locality on the dynamics of decoder-based evolutionary search","author":"gottlieb","year":"2000","journal-title":"Proc GECCO"},{"key":"ref31","first-page":"38","article-title":"Characterizing locality in decoder-based eas for the multidimensional knapsack problem","author":"gottlieb","year":"2000","journal-title":"Proc AE'99 Select Papers 4th Eur Conf Artif Evol"},{"key":"ref30","first-page":"144","article-title":"Asynchronous organizations for solving the point-to-point connection problem","author":"gomes","year":"1998","journal-title":"Proc 3rd ICMAS"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/net.3230080402","article-title":"The complexity of the network design problem","volume":"8","author":"johnson","year":"1978","journal-title":"Networks"},{"key":"ref36","doi-asserted-by":"crossref","DOI":"10.1007\/b107306","author":"ibaraki","year":"2005","journal-title":"Metaheuristics Progress as Real Problem Solvers"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/59.898118"},{"key":"ref34","first-page":"272","article-title":"A genetic algorithm for Steiner tree optimization with multiple constraints using pr&#x00FC;fer number","author":"haghighat","year":"2002","journal-title":"Proceedings of EURASIA-ICT"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1507-4"},{"key":"ref62","first-page":"238","article-title":"Tree network design with genetic algorithms: An investigation in the locality of the pruefer number encoding","author":"rothlauf","year":"1999","journal-title":"Proc Late Break Papers Genet Evol Computat Conf"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-32444-5_2"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1162\/106365602317301781"},{"key":"ref28","first-page":"223","article-title":"Chapter 26: Improved approximation algorithms for netowrk desing problems","author":"goemans","year":"1994","journal-title":"Proc 5th Annu ACM-SIAM Symp Discrete Algor"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2010.2041475"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-005-1177-7"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46004-7_15"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794270881"},{"key":"ref29","author":"goldberg","year":"1989","journal-title":"Genetic Algorithms in Search Optimization and Machine Learning"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-7535-4_9"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1093\/ietcom\/e88-b.10.4090"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1002\/0471722138"},{"key":"ref2","first-page":"470","article-title":"Determinant factorization: A new encoding scheme for spanning trees applied to the probabilistic minimum spanning tree problem","author":"abuali","year":"1995","journal-title":"Proc 6th Int Conf Genet Algor"},{"key":"ref1","author":"aarts","year":"1989","journal-title":"Simulated Annealing and Boltzmann Machines A Stochastic Approach to Combinatorial Optimization and Neural Computing"},{"key":"ref20","author":"felsenstein","year":"2003","journal-title":"Inferring Phylogenies"},{"key":"ref22","author":"gen","year":"1997","journal-title":"Genetic Algorithms and Engineering Design"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"key":"ref24","first-page":"2802","article-title":"Solving multiobjective transportation problem by spanning tree-based genetic algorithm","volume":"e82a","author":"gen","year":"1999","journal-title":"IEICE Trans Fundamental Electron Commun Comput Sci"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2004.05.026"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_33"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1023\/A:1026154708960","article-title":"Bi-objective median subtree location problems","volume":"122","author":"george","year":"1993","journal-title":"Ann Oper Res"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/90.986568"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"ref59","author":"resende","year":"2005","journal-title":"Parallel Metaheuristics A New Class of Algorithms"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/S0303-2647(98)00033-1"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.807275"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230260305"},{"key":"ref55","author":"ordonez","year":"2005","journal-title":"Robust capacity expansion of network flow"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(80)90022-2"},{"key":"ref53","author":"munagala","year":"2003","journal-title":"Approximation algorithms for concave cost network flow problems"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602362"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5184-0"},{"key":"ref11","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/4235.850653"},{"key":"ref12","author":"crescenzi","year":"2005","journal-title":"A compendium of NP optimization problems"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90140-I"},{"key":"ref14","first-page":"408","article-title":"A genetic algorithm for survivable network design","author":"davis","year":"1993","journal-title":"Proc Int Conf of Genetic Algorithm"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/162754.162902"},{"key":"ref16","author":"deb","year":"2001","journal-title":"Multi-Objective Optimization Using Evolutionary Algorithms"},{"key":"ref17","first-page":"678","article-title":"Node-depth encoding applied to the network design","volume":"3102","author":"delbem","year":"2004","journal-title":"Proc Genet Algor Evol Computat Conf"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2004.840442"},{"key":"ref19","first-page":"179","author":"ekisoglu","year":"2002","journal-title":"Models for Parallel and Distributed Computation-Theory Algorithmic Techniques and Applications"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0142-0615(99)00040-X"},{"key":"ref3","author":"atamturk","year":"2004","journal-title":"Two-Stage Robust Network Flow and Design Under Demand Uncertainty"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2028330"},{"key":"ref5","author":"cahn","year":"1998","journal-title":"Wide Area Network Design Concepts and Tools for Optimization"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/4235.930313"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/4235.974844"},{"key":"ref49","author":"mansour","year":"1994","journal-title":"An approximation algorithm for minimum- cost network design"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1361192.1361200"},{"key":"ref46","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","author":"laguna","year":"2003","journal-title":"Scatter Search Methodology and Implementations in C"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30463-0_40"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/4235.873237"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/11504894_77"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24596-4_37"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011977126230"},{"key":"ref44","first-page":"494","article-title":"Improved quality of solutions for spanning tree problem using distributed evolutionary approach","volume":"3296","author":"kumar","year":"2004","journal-title":"Proc HiPC"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1007\/978-3-540-31880-4_56","article-title":"Multiobjective EA approach for improved quality of solutions for spanning tree problem","volume":"3410","author":"kumar","year":"2005","journal-title":"Proc Evol Multi-Criterion Optimization"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4235\/6362272\/06151100.pdf?arnumber=6151100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:53:32Z","timestamp":1633910012000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6151100\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":77,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2011.2173579","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12]]}}}