A MULTI-POPULATION GENETIC ALGORITHM FOR TREE-SHAPED NETWORK DESIGN PROBLEMS

• Type: Chapter or Part of a Book
• Date: 2009

Authors

Dalila B M M Fontes (Author) FEP; Jose Fernando Goncalves (Author) FEP

Book

Title: Proceedings of the International Joint Conference on Computational Intelligence

Pages: 177-182

ISBN: ISBN: 978-989-674-014-6

Indexing

ISI Web of Knowledge - 0 Citations

Scopus - 0 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: P-003-QH8

Abstract (EN): 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 6