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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Swarm and evolutionary computation Ročník 31; s. 1 - 10
Hlavní autori: Lima, Telma Woerle de, Delbem, Alexandre Cláudio Botazzo, Soares, Anderson da Silva, Federson, Fernando Marques, Junior, João Bosco Augusto London, Baalen, Jeffrey Van
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!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:2210-6502
DOI:10.1016/j.swevo.2016.05.001