Telecommunications network design - Comparison of alternative approaches

G. Premkumar, Chao Hsien Chu, Hsinghua Chou

Research output: Contribution to journalArticle

10 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)483-505
Number of pages23
JournalDecision Sciences
Volume31
Issue number2
StatePublished - Mar 1 2000

Fingerprint

Telecommunication networks
Genetic algorithms
Ion exchange
Heuristic methods
Mathematical models
Telecommunication network
Network design
Genetic algorithm

All Science Journal Classification (ASJC) codes

  • Business, Management and Accounting(all)
  • Strategy and Management
  • Information Systems and Management
  • Management of Technology and Innovation

Cite this

Premkumar, G. ; Chu, Chao Hsien ; Chou, Hsinghua. / Telecommunications network design - Comparison of alternative approaches. In: Decision Sciences. 2000 ; Vol. 31, No. 2. pp. 483-505.
@article{bcba8e7796144ced9e3657bedf29bd30,
title = "Telecommunications network design - Comparison of alternative approaches",
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.",
author = "G. Premkumar and Chu, {Chao Hsien} and Hsinghua Chou",
year = "2000",
month = "3",
day = "1",
language = "English (US)",
volume = "31",
pages = "483--505",
journal = "Decision Sciences",
issn = "0011-7315",
publisher = "Wiley-Blackwell",
number = "2",

}

Telecommunications network design - Comparison of alternative approaches. / Premkumar, G.; Chu, Chao Hsien; Chou, Hsinghua.

In: Decision Sciences, Vol. 31, No. 2, 01.03.2000, p. 483-505.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Telecommunications network design - Comparison of alternative approaches

AU - Premkumar, G.

AU - Chu, Chao Hsien

AU - Chou, Hsinghua

PY - 2000/3/1

Y1 - 2000/3/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0034379276&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034379276&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0034379276

VL - 31

SP - 483

EP - 505

JO - Decision Sciences

JF - Decision Sciences

SN - 0011-7315

IS - 2

ER -