Node-depth phylogenetic-based encoding, a spanning-tree representation for evolutionary algorithms. part I: Proposal and properties analysis
Representation choice and the development of search operators are crucial aspects of the efficiency of Evolutionary Algorithms (EAs) in combinatorial problems. Several researchers have proposed representations and operators for EAs that manipulate spanning trees. This paper proposes a new encoding c...
Uložené v:
| Vydané v: | Swarm and evolutionary computation Ročník 31; s. 1 - 10 |
|---|---|
| Hlavní autori: | , , , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.12.2016
|
| Predmet: | |
| ISSN: | 2210-6502 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Representation choice and the development of search operators are crucial aspects of the efficiency of Evolutionary Algorithms (EAs) in combinatorial problems. Several researchers have proposed representations and operators for EAs that manipulate spanning trees. This paper proposes a new encoding called Node-depth Phylogenetic-based Encoding (NPE). NPE represents spanning trees by the relation between nodes and their depths using a relatively simple codification/decodification process. The proposed NPE operators are based on methods used for tree rearrangement in phylogenetic tree reconstruction: subtree prune and regraft; and tree bisection and reconstruction. NPE and its operators are designed to have high locality, feasibility, low time complexity, be unbiased, and have independent weight. Therefore, NPE is a good choice of data structure for EAs applied to network design problems. |
|---|---|
| AbstractList | Representation choice and the development of search operators are crucial aspects of the efficiency of Evolutionary Algorithms (EAs) in combinatorial problems. Several researchers have proposed representations and operators for EAs that manipulate spanning trees. This paper proposes a new encoding called Node-depth Phylogenetic-based Encoding (NPE). NPE represents spanning trees by the relation between nodes and their depths using a relatively simple codification/decodification process. The proposed NPE operators are based on methods used for tree rearrangement in phylogenetic tree reconstruction: subtree prune and regraft; and tree bisection and reconstruction. NPE and its operators are designed to have high locality, feasibility, low time complexity, be unbiased, and have independent weight. Therefore, NPE is a good choice of data structure for EAs applied to network design problems. |
| Author | Soares, Anderson da Silva Delbem, Alexandre Cláudio Botazzo Baalen, Jeffrey Van Junior, João Bosco Augusto London Lima, Telma Woerle de Federson, Fernando Marques |
| Author_xml | – sequence: 1 givenname: Telma Woerle de surname: Lima fullname: Lima, Telma Woerle de email: telma@inf.ufg.br organization: Universidade Federal de Goiás, Instituto de Informática, Brazil – sequence: 2 givenname: Alexandre Cláudio Botazzo surname: Delbem fullname: Delbem, Alexandre Cláudio Botazzo organization: University of São Paulo, São Carlos School of Engineering, Brazil – sequence: 3 givenname: Anderson da Silva surname: Soares fullname: Soares, Anderson da Silva organization: Universidade Federal de Goiás, Instituto de Informática, Brazil – sequence: 4 givenname: Fernando Marques surname: Federson fullname: Federson, Fernando Marques organization: Universidade Federal de Goiás, Instituto de Informática, Brazil – sequence: 5 givenname: João Bosco Augusto London surname: Junior fullname: Junior, João Bosco Augusto London organization: University of São Paulo, São Carlos School of Engineering, Brazil – sequence: 6 givenname: Jeffrey Van surname: Baalen fullname: Baalen, Jeffrey Van organization: University of Wyoming, Computer Science Departament, WY, USA |
| BookMark | eNqFkb9uHCEQhykcKY7jJ3BDmSK7AXYh60gpIit_LFlxirhGY5i948TBhuFs3Tv4ocPlUrlIaOAnzTcMH6_YScoJGbuQopdCmnebnh7xIfeqhV7oXgh5wk6VkqIzWqiX7JxoI9oyQml9ecqevmePncelrvmy3se8woQ1uO4eCD3H5LIPafWWA6cFUmrnrhZEXnApSJgq1JATn3Ph7eK4OyQoew5xlUuo6y31fIFS-fUH_qPkJRNEDsnzpQUsNSC1CHFPgV6zFzNEwvO_-xm7-_L559W37ub26_XVp5vODZOs3QiyzW7Q6XkeRueNGEatvJEgxT1oVNNgtAflxsm4UUvjvUJ8P5l5xklJPZyxN8e-bYZfO6Rqt4EcxggJ845sazAqMRk1tNLhWOpKJio426WEbXuglcIelNuN_aPcHpRboW1T3qjLZ5QLR1G1QIj_YT8eWWwGHgIWSy60f0AfCrpqfQ7_5H8Dt9qltw |
| CitedBy_id | crossref_primary_10_1016_j_engappai_2023_107463 crossref_primary_10_1016_j_knosys_2023_111168 crossref_primary_10_1016_j_swevo_2019_01_007 crossref_primary_10_1109_JIOT_2025_3573710 crossref_primary_10_1109_TCYB_2020_3005047 |
| Cites_doi | 10.1145/1068009.1068108 10.1145/1389095.1389279 10.1162/106365602317301781 10.1007/b98643 10.1002/net.3230260305 10.1093/ietcom/e88-b.10.4090 10.1145/2001858.2001936 10.1007/978-3-540-30132-5_128 10.1057/palgrave.jors.2601510 10.1002/(SICI)1097-0037(199709)30:2<91::AID-NET3>3.0.CO;2-F 10.1109/4235.850653 10.1109/4235.974844 10.1109/ICEC.1994.349921 10.1016/j.asoc.2015.04.016 10.1109/TEVC.2006.871249 10.1109/TEVC.2002.807275 10.1007/b98645 10.1145/315891.316001 10.1109/CEC.2000.870282 |
| ContentType | Journal Article |
| Copyright | 2016 Elsevier B.V. |
| Copyright_xml | – notice: 2016 Elsevier B.V. |
| DBID | AAYXX CITATION 7S9 L.6 |
| DOI | 10.1016/j.swevo.2016.05.001 |
| DatabaseName | CrossRef AGRICOLA AGRICOLA - Academic |
| DatabaseTitle | CrossRef AGRICOLA AGRICOLA - Academic |
| DatabaseTitleList | AGRICOLA |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EndPage | 10 |
| ExternalDocumentID | 10_1016_j_swevo_2016_05_001 S2210650216300232 |
| GroupedDBID | --K --M .~1 0R~ 1~. 1~5 4.4 457 4G. 5VS 7-5 8P~ AAAKF AABVA AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AATLK AAXUO AAYFN ABAOU ABBOA ABGRD ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADMUD ADQTV ADTZH AEBSH AECPX AEKER AENEX AEQOU AFKWA AFTJW AFXIZ AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BJAXD BKOJK BLXMC CBWCG EBS EFJIC EFLBG EJD FDB FEDTE FIRID FNPLU FYGXN GBLVA GBOLZ HAMUX HVGLF HZ~ J1W JJJVA KOM M41 MHUIS MO0 N9A O-L O9- OAUVE P-8 P-9 PC. Q38 RIG ROL SDF SES SPC SPCBC SSA SSB SSD SST SSV SSW SSZ T5K ~G- AATTM AAXKI AAYWO AAYXX ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7S9 L.6 |
| ID | FETCH-LOGICAL-c381t-4a15596ec5ff34cd603452d61a10ba5e28365da2c486c4516dd2ee786ffe82153 |
| ISICitedReferencesCount | 8 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000390739200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2210-6502 |
| IngestDate | Thu Oct 02 05:37:37 EDT 2025 Sat Nov 29 07:49:07 EST 2025 Tue Nov 18 22:29:07 EST 2025 Fri Feb 23 02:26:28 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Network design problems Dynamic data structures Evolutionary algorithms Tree representations |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c381t-4a15596ec5ff34cd603452d61a10ba5e28365da2c486c4516dd2ee786ffe82153 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| OpenAccessLink | http://dx.doi.org/10.1016/j.swevo.2016.05.001 |
| PQID | 2834208623 |
| PQPubID | 24069 |
| PageCount | 10 |
| ParticipantIDs | proquest_miscellaneous_2834208623 crossref_primary_10_1016_j_swevo_2016_05_001 crossref_citationtrail_10_1016_j_swevo_2016_05_001 elsevier_sciencedirect_doi_10_1016_j_swevo_2016_05_001 |
| PublicationCentury | 2000 |
| PublicationDate | 2016-12-01 |
| PublicationDateYYYYMMDD | 2016-12-01 |
| PublicationDate_xml | – month: 12 year: 2016 text: 2016-12-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Swarm and evolutionary computation |
| PublicationYear | 2016 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | F.N. Abuali, R.L. Wainwright, D.A. Schoenefeld, Determinant factorization: a new encoding scheme for spanning trees applied to the probabilistic minimum spanning tree problem, in: L.J. Eshelman (Ed.), Proceedings of the Sixth International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 1995, pp. 470–477. Paulden, Smith (bib16) 2006; 10 G. Raidl, An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem, in: Proceedings of the 2000 Congress on Evolutionary Computation CEC00, IEEE Press, La Jolla Marriott Hotel, La Jolla, California, USA, 2000, pp. 104–111. URL C.C. Palmer, A. Kershenbaum, Representing trees in genetic algorithms, in: Evolutionary Computation, 1994, Proceedings of the First IEEE Conference on IEEE World Congress on Computational Intelligence, vol. 1, 1994, pp. 379–384. 〉 Rothlauf, Goldberg, Heinzl (bib11) 2002; 10 Soak, Corne, Ahn (bib22) 2005; 10 URL Garey, Johnson (bib30) 1979 Carvalho, Ferreira, Barruncho (bib20) 2001; 5 Knowles, Corne (bib31) 2000; 4 Zhou, Gen (bib9) 1997; 30 M. Gen, G. Zhou, An approach to the degree-constrained minimum spanning tree problem using genetic algorithm, Technical report, Ashikaga Intitute of Technology, 1995. B.A. Julstrom, Encoding bounded-diameter spanning trees with permutations and with random keys, in: K. Deb, R. Poli, W. Banzhaf, H.-G. Beyer, E. Burke, P. Darwen, D. Dasgupta, D. Floreano, J. Foster, M. Harman, O. Holland, P. L. Lanzi, L. Spector, A. Tettamanzi, D. Thierens, A. Tyrrell (Eds.), Genetic and Evolutionary Computation—GECCO-2004, Part I, Vol. 3102 of Lecture Notes in Computer Science, Springer-Verlag, Seattle, WA, USA, 2004, pp. 1272–1281. Rothlauf (bib1) 2006 C. Tzschoppe, F. Rothlauf, H.-J. Pesch, The edge-set encoding revisited: On the bias of a direct representation for trees, in: K. Deb, R. Poli, W. Banzhaf, H.-G. Beyer, E. Burke, P. Darwen, D. Dasgupta, D. Floreano, J. Foster, M. Harman, O. Holland, P.L. Lanzi, L. Spector, A. Tettamanzi, D. Thierens, A. Tyrrell (Eds.), Genetic and Evolutionary Computation—GECCO-2004, Part II, Lecture Notes in Computer Science, vol. 3103, Springer-Verlag, Seattle, WA, USA, 2004, pp. 258–270. C.C. Palmer, An approach to a problem in network design using genetic algorithms (Ph.D. thesis), Brooklyn, NY, USA, 1994. Delbem, Lima, Telles (bib18) 2012; 99 T.W. de Lima, A.C.B. Delbem, F. Rothlauf, Analysis of properties of recombination operators proposed for the node-depth encoding, in: Proceedings of the 13th Annual Conference Companion on Genetic and Evolutionary Computation, GECCO '11, ACM, New York, NY, USA, 2011, pp. 137–138. Zhou, Gen (bib23) 2003; 54 G. Raidl, C. Drexel, A predecessor coding in an evolutionary algorithm for the capacitated minimum spanning tree problem, in: C. Armstrong (Ed.), Proceedings of the 2000 Genetic and Evolutionary Computation Conference, 2000, pp. 309–316. T.W. de Lima, F. Rothlauf, A.C. Delbem, The node-depth encoding: Analysis and application to the bounded-diameter minimum spanning tree problem, in: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, GECCO '08, ACM, New York, NY, USA, 2008, pp. 969–976. L. Davis, D. Orvosh, A. Cox, Y. Qiu, A genetic algorithm for survivable network design, in: Proceedings of the 5th International Conference on Genetic Algorithms, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1993, pp. 408–415. Hamming (bib29) 1980 Raidl, Julstrom (bib4) 2003; 7 B.A. Julstrom, The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem, in: GECCO '05: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, ACM Press, New York, NY, USA, 2005, pp. 585–590. . Palmer, Kershenbaum (bib15) 1995; 26 S.-M. Soak, D. Corne, A. Byung-Ha, A new encoding for the degree constrained minimum spanning tree problem., in: KES, 2004, pp. 952–958. Andrade, Resende, Zhang, Sinha, Reichmann, Doverspike, Miyazawa (bib28) 2015; 33 Prüfer (bib8) 1918; 27 J. Gottlieb, B.A. Julstrom, G.R. Raidl, F. Rothlauf, Prüfer numbers: a poor representation of spanning trees for evolutionary search, in: L. Spector, E. D. Goodman, A. Wu, W. B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. H. Garzon, E. Burke (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), Morgan Kaufmann, San Francisco, California, USA, 2001, pp. 343–350. URL Cormen, Leiserson, Rivest, Stein (bib26) 2000 Felsenstein (bib27) 2004 10.1016/j.swevo.2016.05.001_bib12 10.1016/j.swevo.2016.05.001_bib13 Soak (10.1016/j.swevo.2016.05.001_bib22) 2005; 10 10.1016/j.swevo.2016.05.001_bib14 Hamming (10.1016/j.swevo.2016.05.001_bib29) 1980 10.1016/j.swevo.2016.05.001_bib2 Prüfer (10.1016/j.swevo.2016.05.001_bib8) 1918; 27 10.1016/j.swevo.2016.05.001_bib10 10.1016/j.swevo.2016.05.001_bib6 10.1016/j.swevo.2016.05.001_bib5 Delbem (10.1016/j.swevo.2016.05.001_bib18) 2012; 99 10.1016/j.swevo.2016.05.001_bib3 Andrade (10.1016/j.swevo.2016.05.001_bib28) 2015; 33 10.1016/j.swevo.2016.05.001_bib7 Rothlauf (10.1016/j.swevo.2016.05.001_bib11) 2002; 10 Felsenstein (10.1016/j.swevo.2016.05.001_bib27) 2004 Zhou (10.1016/j.swevo.2016.05.001_bib23) 2003; 54 Cormen (10.1016/j.swevo.2016.05.001_bib26) 2000 Zhou (10.1016/j.swevo.2016.05.001_bib9) 1997; 30 Paulden (10.1016/j.swevo.2016.05.001_bib16) 2006; 10 10.1016/j.swevo.2016.05.001_bib24 10.1016/j.swevo.2016.05.001_bib25 Knowles (10.1016/j.swevo.2016.05.001_bib31) 2000; 4 Garey (10.1016/j.swevo.2016.05.001_bib30) 1979 10.1016/j.swevo.2016.05.001_bib21 Carvalho (10.1016/j.swevo.2016.05.001_bib20) 2001; 5 Rothlauf (10.1016/j.swevo.2016.05.001_bib1) 2006 Raidl (10.1016/j.swevo.2016.05.001_bib4) 2003; 7 10.1016/j.swevo.2016.05.001_bib17 Palmer (10.1016/j.swevo.2016.05.001_bib15) 1995; 26 10.1016/j.swevo.2016.05.001_bib19 |
| References_xml | – reference: F.N. Abuali, R.L. Wainwright, D.A. Schoenefeld, Determinant factorization: a new encoding scheme for spanning trees applied to the probabilistic minimum spanning tree problem, in: L.J. Eshelman (Ed.), Proceedings of the Sixth International Conference on Genetic Algorithms, Morgan Kaufmann, San Francisco, CA, 1995, pp. 470–477. 〈 – volume: 10 start-page: 108 year: 2006 end-page: 123 ident: bib16 article-title: From the dandelion code to the rainbow code publication-title: IEEE Trans. Evol. Comput. – volume: 10 start-page: 4090 year: 2005 end-page: 4093 ident: bib22 article-title: A new evolutionary algorithm for spanning-tree based communication network design publication-title: IEICE Trans. Commun. E88-B – reference: B.A. Julstrom, Encoding bounded-diameter spanning trees with permutations and with random keys, in: K. Deb, R. Poli, W. Banzhaf, H.-G. Beyer, E. Burke, P. Darwen, D. Dasgupta, D. Floreano, J. Foster, M. Harman, O. Holland, P. L. Lanzi, L. Spector, A. Tettamanzi, D. Thierens, A. Tyrrell (Eds.), Genetic and Evolutionary Computation—GECCO-2004, Part I, Vol. 3102 of Lecture Notes in Computer Science, Springer-Verlag, Seattle, WA, USA, 2004, pp. 1272–1281. – year: 2006 ident: bib1 article-title: Representations for Genetic and Evolutionary Algorithms – reference: . URL 〈 – volume: 26 start-page: 151 year: 1995 end-page: 163 ident: bib15 article-title: An approach to a problem in network design using genetic algorithms publication-title: Networks – volume: 54 start-page: 248 year: 2003 end-page: 254 ident: bib23 article-title: A genetic algorithm approach on tree-like telecommunication network design problem publication-title: J. Oper. Res. Soc. – reference: M. Gen, G. Zhou, An approach to the degree-constrained minimum spanning tree problem using genetic algorithm, Technical report, Ashikaga Intitute of Technology, 1995. – reference: T.W. de Lima, F. Rothlauf, A.C. Delbem, The node-depth encoding: Analysis and application to the bounded-diameter minimum spanning tree problem, in: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, GECCO '08, ACM, New York, NY, USA, 2008, pp. 969–976. – year: 1980 ident: bib29 article-title: Coding and Information Theory – volume: 7 start-page: 225 year: 2003 end-page: 239 ident: bib4 article-title: Edge sets publication-title: IEEE Trans. Evol. Comput. – reference: C. Tzschoppe, F. Rothlauf, H.-J. Pesch, The edge-set encoding revisited: On the bias of a direct representation for trees, in: K. Deb, R. Poli, W. Banzhaf, H.-G. Beyer, E. Burke, P. Darwen, D. Dasgupta, D. Floreano, J. Foster, M. Harman, O. Holland, P.L. Lanzi, L. Spector, A. Tettamanzi, D. Thierens, A. Tyrrell (Eds.), Genetic and Evolutionary Computation—GECCO-2004, Part II, Lecture Notes in Computer Science, vol. 3103, Springer-Verlag, Seattle, WA, USA, 2004, pp. 258–270. – year: 2004 ident: bib27 article-title: Inferring Phylogenies – reference: 〉. – reference: S.-M. Soak, D. Corne, A. Byung-Ha, A new encoding for the degree constrained minimum spanning tree problem., in: KES, 2004, pp. 952–958. – volume: 30 start-page: 91 year: 1997 end-page: 95 ident: bib9 article-title: A note on genetic algorithms for degree-constrained spanning tree problems publication-title: Networks (USA) – volume: 33 start-page: 150 year: 2015 end-page: 169 ident: bib28 article-title: A biased random-key genetic algorithm for wireless backhaul network design publication-title: Appl. Soft Comput. – reference: G. Raidl, An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem, in: Proceedings of the 2000 Congress on Evolutionary Computation CEC00, IEEE Press, La Jolla Marriott Hotel, La Jolla, California, USA, 2000, pp. 104–111. URL 〈 – reference: J. Gottlieb, B.A. Julstrom, G.R. Raidl, F. Rothlauf, Prüfer numbers: a poor representation of spanning trees for evolutionary search, in: L. Spector, E. D. Goodman, A. Wu, W. B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. H. Garzon, E. Burke (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), Morgan Kaufmann, San Francisco, California, USA, 2001, pp. 343–350. URL 〈 – volume: 5 start-page: 623 year: 2001 end-page: 630 ident: bib20 article-title: On spanning-tree recombination in evolutionary large-scale network problems—application to electrical distribution planning publication-title: IEEE Trans. Evol. Comput. – reference: 〉 – year: 2000 ident: bib26 article-title: Introduction to Algorithms – reference: . – reference: L. Davis, D. Orvosh, A. Cox, Y. Qiu, A genetic algorithm for survivable network design, in: Proceedings of the 5th International Conference on Genetic Algorithms, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1993, pp. 408–415. – year: 1979 ident: bib30 publication-title: Computers and Intractibility – reference: B.A. Julstrom, The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem, in: GECCO '05: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, ACM Press, New York, NY, USA, 2005, pp. 585–590. – reference: C.C. Palmer, An approach to a problem in network design using genetic algorithms (Ph.D. thesis), Brooklyn, NY, USA, 1994. – volume: 27 start-page: 142 year: 1918 end-page: 144 ident: bib8 article-title: Neuer beweis eines satzes uber permutationen publication-title: Archiv für Mathematik und Physik – volume: 99 start-page: 1 year: 2012 end-page: 28 ident: bib18 article-title: Efficient forest data structure for evolutionary algorithms applied to network design publication-title: IEEE Trans. Evol. Comput. – reference: G. Raidl, C. Drexel, A predecessor coding in an evolutionary algorithm for the capacitated minimum spanning tree problem, in: C. Armstrong (Ed.), Proceedings of the 2000 Genetic and Evolutionary Computation Conference, 2000, pp. 309–316. – volume: 10 start-page: 75 year: 2002 end-page: 97 ident: bib11 article-title: Network random keys publication-title: Evol. Comput. – reference: T.W. de Lima, A.C.B. Delbem, F. Rothlauf, Analysis of properties of recombination operators proposed for the node-depth encoding, in: Proceedings of the 13th Annual Conference Companion on Genetic and Evolutionary Computation, GECCO '11, ACM, New York, NY, USA, 2011, pp. 137–138. – reference: C.C. Palmer, A. Kershenbaum, Representing trees in genetic algorithms, in: Evolutionary Computation, 1994, Proceedings of the First IEEE Conference on IEEE World Congress on Computational Intelligence, vol. 1, 1994, pp. 379–384. – volume: 4 start-page: 125 year: 2000 end-page: 134 ident: bib31 article-title: A new evolutionary approach to the degree-constrained minimum spanning tree problem publication-title: IEEE Trans. Evol. Comput. – year: 2004 ident: 10.1016/j.swevo.2016.05.001_bib27 – year: 2000 ident: 10.1016/j.swevo.2016.05.001_bib26 – ident: 10.1016/j.swevo.2016.05.001_bib14 doi: 10.1145/1068009.1068108 – ident: 10.1016/j.swevo.2016.05.001_bib6 doi: 10.1145/1389095.1389279 – volume: 10 start-page: 75 issue: 1 year: 2002 ident: 10.1016/j.swevo.2016.05.001_bib11 article-title: Network random keys publication-title: Evol. Comput. doi: 10.1162/106365602317301781 – ident: 10.1016/j.swevo.2016.05.001_bib24 doi: 10.1007/b98643 – volume: 99 start-page: 1 year: 2012 ident: 10.1016/j.swevo.2016.05.001_bib18 article-title: Efficient forest data structure for evolutionary algorithms applied to network design publication-title: IEEE Trans. Evol. Comput. – year: 1980 ident: 10.1016/j.swevo.2016.05.001_bib29 – volume: 26 start-page: 151 year: 1995 ident: 10.1016/j.swevo.2016.05.001_bib15 article-title: An approach to a problem in network design using genetic algorithms publication-title: Networks doi: 10.1002/net.3230260305 – year: 1979 ident: 10.1016/j.swevo.2016.05.001_bib30 publication-title: Computers and Intractibility – volume: 10 start-page: 4090 year: 2005 ident: 10.1016/j.swevo.2016.05.001_bib22 article-title: A new evolutionary algorithm for spanning-tree based communication network design publication-title: IEICE Trans. Commun. E88-B doi: 10.1093/ietcom/e88-b.10.4090 – ident: 10.1016/j.swevo.2016.05.001_bib7 doi: 10.1145/2001858.2001936 – ident: 10.1016/j.swevo.2016.05.001_bib10 – ident: 10.1016/j.swevo.2016.05.001_bib21 doi: 10.1007/978-3-540-30132-5_128 – volume: 54 start-page: 248 issue: 3 year: 2003 ident: 10.1016/j.swevo.2016.05.001_bib23 article-title: A genetic algorithm approach on tree-like telecommunication network design problem publication-title: J. Oper. Res. Soc. doi: 10.1057/palgrave.jors.2601510 – volume: 30 start-page: 91 issue: 2 year: 1997 ident: 10.1016/j.swevo.2016.05.001_bib9 article-title: A note on genetic algorithms for degree-constrained spanning tree problems publication-title: Networks (USA) doi: 10.1002/(SICI)1097-0037(199709)30:2<91::AID-NET3>3.0.CO;2-F – ident: 10.1016/j.swevo.2016.05.001_bib12 – volume: 4 start-page: 125 issue: 2 year: 2000 ident: 10.1016/j.swevo.2016.05.001_bib31 article-title: A new evolutionary approach to the degree-constrained minimum spanning tree problem publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/4235.850653 – volume: 5 start-page: 623 issue: 6 year: 2001 ident: 10.1016/j.swevo.2016.05.001_bib20 article-title: On spanning-tree recombination in evolutionary large-scale network problems—application to electrical distribution planning publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/4235.974844 – ident: 10.1016/j.swevo.2016.05.001_bib25 – ident: 10.1016/j.swevo.2016.05.001_bib2 doi: 10.1109/ICEC.1994.349921 – volume: 33 start-page: 150 year: 2015 ident: 10.1016/j.swevo.2016.05.001_bib28 article-title: A biased random-key genetic algorithm for wireless backhaul network design publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2015.04.016 – volume: 10 start-page: 108 issue: 2 year: 2006 ident: 10.1016/j.swevo.2016.05.001_bib16 article-title: From the dandelion code to the rainbow code publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2006.871249 – year: 2006 ident: 10.1016/j.swevo.2016.05.001_bib1 – volume: 7 start-page: 225 issue: 3 year: 2003 ident: 10.1016/j.swevo.2016.05.001_bib4 article-title: Edge sets publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2002.807275 – ident: 10.1016/j.swevo.2016.05.001_bib17 – volume: 27 start-page: 142 year: 1918 ident: 10.1016/j.swevo.2016.05.001_bib8 article-title: Neuer beweis eines satzes uber permutationen publication-title: Archiv für Mathematik und Physik – ident: 10.1016/j.swevo.2016.05.001_bib5 doi: 10.1007/b98645 – ident: 10.1016/j.swevo.2016.05.001_bib19 doi: 10.1145/315891.316001 – ident: 10.1016/j.swevo.2016.05.001_bib13 – ident: 10.1016/j.swevo.2016.05.001_bib3 doi: 10.1109/CEC.2000.870282 |
| SSID | ssj0000602559 |
| Score | 2.1030772 |
| Snippet | Representation choice and the development of search operators are crucial aspects of the efficiency of Evolutionary Algorithms (EAs) in combinatorial problems.... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1 |
| SubjectTerms | Dynamic data structures Evolutionary algorithms Network design problems Tree representations |
| Title | Node-depth phylogenetic-based encoding, a spanning-tree representation for evolutionary algorithms. part I: Proposal and properties analysis |
| URI | https://dx.doi.org/10.1016/j.swevo.2016.05.001 https://www.proquest.com/docview/2834208623 |
| Volume | 31 |
| WOSCitedRecordID | wos000390739200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 2210-6502 databaseCode: AIEXJ dateStart: 20110301 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000602559 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6FlAMX3ojy0iIhLq6r2LHXDrdSJSIoCpWaQm7WxrtuUzm2cZy06m_gN_HbmFmvHYdCVQ5crMjxK54vs9_OzsxHyDtMrfA87pj2LJSmEzHX7PHINpmwQ0c64DKVDtnXkTce-9Np76jV-lnVwqxjL0n8y8te9l9NDfvA2Fg6-w_mri8KO-AzGB22YHbY3srw41RIU8isOMOwBbg28GZwkInjlTCwb6XQOibcAHeiJItMXJs2VIPLqhgp0c3A9bNich2PT9N8XpwtlvtGBnc2hhhPOEKdhWXdciDNMFNbYuvnst1Jk_4eX_C81OTYunCopCW2cgJG84WitRMZL7jxLZW5qvCqeTf25lo0KnRyaRzGatXfWol5anxMC351ldYBpBTrrHQGp5pkGIIbx_N4XQ9LA1l-oeh8GV1PsZQJB85mbMRijTwT5UJtmNCawEHtPw4WZdzifH95Ab8Zs_yYauKqL7DVmnv8JRicjEbBpD-dvM--m6hahqv7WsLlDtmxPbfnt8nOwbA__VxH-TpMzdlQ4bB6lKr1lUoyvHbrv9Gj34iCYj-Th-S-nrbQgxJuj0hLJo_Jg0oShOoR4gn5sUEfvY4-WqFvj3K6hT26jT0K2KNNiNAG9ihijw4_0Ap5FExFN8ijFfKekpNBf3L4ydSCH2YIxLEwHY6L5EyGbhR1nVCwTtdxbcEsbnVm3JVAhZkrOHgRn4WoMC2ELaXnsyiSPnDX7jPSTtJEPidUhnaopAtm0nKsyJsJmzvMYrNON4pg1NkldvWeg1B3w0dRljio0h7PA2WcAI0TdFxM_twle_VJWdkM5ubDWWXAQPPZkqcGgMCbT3xbmTsAb49LeDyR6WoZwBvAfBiYs7y4xTEvyb3Nv-IVaRf5Sr4md8N1MV_mbzRWfwEdGNab |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Node-depth+phylogenetic-based+encoding%2C+a+spanning-tree+representation+for+evolutionary+algorithms.+part+I%3A+Proposal+and+properties+analysis&rft.jtitle=Swarm+and+evolutionary+computation&rft.au=Lima%2C+Telma+Woerle+de&rft.au=Delbem%2C+Alexandre+Cl%C3%A1udio+Botazzo&rft.au=Soares%2C+Anderson+da+Silva&rft.au=Federson%2C+Fernando+Marques&rft.date=2016-12-01&rft.issn=2210-6502&rft_id=info:doi/10.1016%2Fj.swevo.2016.05.001&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2210-6502&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2210-6502&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2210-6502&client=summon |