Telecommunications Network Design: Comparison of Alternative Approaches

Publication Type

Journal Article

Publication Date

2000

Abstract

The design and development of the network infrastructure to support mission-critical applications has become a critical and-complex activity. This study explores the use of genetic algorithms (GA) for network design in the context of degree-constrained minimal spanning tree (DCMST) problem; compares for small networks the performance of GA with a mathematical model that provides optimal solutions; and for larger networks, compares GA's performance with two heuristic methods—edge exchange and primal algorithm. Two performance measures, solution quality and computation time, are used for evaluation. The algorithms are evaluated on a wide variety of network sizes with both static and dynamic degree constraints on the network nodes. The results indicate that GA provides optimal solutions for small networks. For larger networks it provides better solution quality compared to edge exchange and primal method, but is worse than the two methods in computation time.

Keywords

Degree-constrained Minimum Spanning Tree, Genetic Algorithms, Network Design, Network Modelling, Telecommunications

Discipline

Computer Sciences | Digital Communications and Networking

Research Areas

Information Systems and Management

Publication

Decision Sciences

Volume

31

Issue

2

First Page

483

Last Page

506

ISSN

1540-5915

Identifier

10.1111/j.1540-5915.2000.tb01631.x

Publisher

Wiley

Additional URL

http://dx.doi.org/10.1111/j.1540-5915.2000.tb01631.x

Link to Full Text

Share

COinS