Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/347891
Type: Artigo
Title: Efficient forest data structure for evolutionary algorithms applied to network design
Author: Delbem, Alexandre C. B.
Lima, Telma W. de
Telles, Guilherme P.
Abstract: The design of a network is a solution to several engineering and science problems. Several network design problems are known to be NP-hard, and population-based metaheuristics like evolutionary algorithms (EAs) have been largely investigated for such problems. Such optimization methods simultaneously generate a large number of potential solutions to investigate the search space in breadth and, consequently, to avoid local optima. Obtaining a potential solution usually involves the construction and maintenance of several spanning trees, or more generally, spanning forests. To efficiently explore the search space, special data structures have been developed to provide operations that manipulate a set of spanning trees (population). For a tree with n nodes, the most efficient data structures available in the literature require time O ( n ) to generate a new spanning tree that modifies an existing one and to store the new solution. We propose a new data structure, called node-depth-degree representation (NDDR), and we demonstrate that using this encoding, generating a new spanning forest requires average time O (√ n ). Experiments with an EA based on NDDR applied to large-scale instances of the degree-constrained minimum spanning tree problem have shown that the implementation adds small constants and lower order terms to the theoretical bound
Subject: Algoritmos evolutivos
Country: Estados Unidos
Editor: Institute of Electrical and Electronics Engineers
Rights: Fechado
Identifier DOI: 10.1109/TEVC.2011.2173579
Address: https://ieeexplore.ieee.org/document/6151100
Date Issue: 2012
Appears in Collections:IC - Artigos e Outros Documentos

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.