Evolutionary algorithms applied to reliable communication network design

Evolutionary algorithms applied to reliable communication network design

0.00 Avg rating0 Votes
Article ID: iaor20083114
Country: United Kingdom
Volume: 39
Issue: 7
Start Page Number: 831
End Page Number: 855
Publication Date: Oct 2007
Journal: Engineering Optimization
Authors: , ,
Keywords: design, heuristics: genetic algorithms
Abstract:

Several evolutionary algorithms (EAs) applied to a wide class of communication network design problems modelled under the generalized Steiner problem (GSP) are evaluated. In order to provide a fault-tolerant design, a solution to this problem consists of a preset number of independent paths linking each pair of potentially communicating terminal nodes. This usually requires considering intermediate non-terminal nodes (Steiner nodes), which are used to ensure path redundancy, while trying to minimize the overall cost. The GSP is an NP-hard problem for which few algorithms have been proposed. This article presents a comparative study of pure and hybrid EAs applied to the GSP, codified over MALLBA, a general purpose library for combinatorial optimization. The algorithms were tested on several GSPs, and asset efficient numerical results are reported for both serial and distributed models of the evaluated algorithms.

Reviews

Required fields are marked *. Your email address will not be published.