Please use this identifier to cite or link to this item:
Author(s): Dalila B M M Fontes
Jose Fernando Goncalves
Issue Date: 2009
Abstract: In this work we propose a multi-population genetic algorithm for tree-shaped network design problems using random keys. Recent literature on finding optimal spanning trees suggests the use of genetic algorithms. Furthermore, random keys encoding has been proved efficient at dealing with problems where the relative order of tasks is important. Here we propose to use random keys for encoding trees. The topology of these trees is restricted, since no path from the root vertex to any other vertex may have more than a pre-defined number of arcs. In addition, the problems under consideration also exhibit the characteristic of flows. Therefore, we want to find a minimum cost tree satisfying all demand vertices and the pre-defined number of arcs. The contributions of this paper are twofold: on one hand we address a new problem, which is an extension of the well known NP-hard hop-constrained MST problem since we also consider determining arc flows such that vertices requirements are met at minimum cost and the cost functions considered include a fixed cost component and a nonlinear flow routing component; on the other hand, we propose a new genetic algorithm to efficiently find solutions to this problem.
Subject: Ciências da computação e da informação
Computer and information sciences
Scientific areas: Ciências exactas e naturais::Ciências da computação e da informação
Natural sciences::Computer and information sciences
Source: Proceedings of the International Joint Conference on Computational Intelligence
Document Type: Capítulo ou Parte de Livro
Rights: openAccess
Appears in Collections:FEP - Capítulo ou Parte de Livro

Files in This Item:
File Description SizeFormat 
50580.pdf147.14 kBAdobe PDFThumbnail

This item is licensed under a Creative Commons License Creative Commons