Digital data networks design using genetic algorithms

Chao Hsien Chu, G. Premkumar, Hsinghua Chou

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

Communication networks have witnessed significant growth in the last decade due to the dramatic growth in the use of Internet. The reliability and service quality requirements of modern data communication networks and the large investments in communications infrastructure have made it critical to design optimized networks that meet the performance parameters. Digital Data Service (DDS) is a popular communication service that provides users with a digital connection. The design of a DDS network is a special case of the classic Steiner-tree problem of finding the minimum cost tree connecting a set of nodes, using Steiner nodes. Since it is a combinatorial optimization problem several heuristic algorithms have been developed including Tabu search, and branch and cut algorithm. In this paper, a new approach using genetic algorithms (GAs) is proposed to solve the problem. The results from GA are compared with the Tabu search method. The results indicate that GA performs as well as Tabu search in terms of solution quality but has lower computation time. However, reducing the number of iterations in Tabu search makes it faster than GA and comparable in solution quality with GA.

Original languageEnglish (US)
Pages (from-to)140-158
Number of pages19
JournalEuropean Journal of Operational Research
Volume127
Issue number1
DOIs
StatePublished - Nov 16 2000

Fingerprint

Network Design
Tabu search
Tabu Search
Genetic algorithms
Genetic Algorithm
Communication Networks
Telecommunication networks
Steiner Tree Problem
Branch-and-cut
Service Quality
Data Communication
Communication
Combinatorial optimization
Heuristic algorithms
Vertex of a graph
Combinatorial Optimization Problem
Search Methods
Heuristic algorithm
Infrastructure
Genetic algorithm

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this

Chu, Chao Hsien ; Premkumar, G. ; Chou, Hsinghua. / Digital data networks design using genetic algorithms. In: European Journal of Operational Research. 2000 ; Vol. 127, No. 1. pp. 140-158.
@article{e13e671ec26c4450826f3a79c5ee762c,
title = "Digital data networks design using genetic algorithms",
abstract = "Communication networks have witnessed significant growth in the last decade due to the dramatic growth in the use of Internet. The reliability and service quality requirements of modern data communication networks and the large investments in communications infrastructure have made it critical to design optimized networks that meet the performance parameters. Digital Data Service (DDS) is a popular communication service that provides users with a digital connection. The design of a DDS network is a special case of the classic Steiner-tree problem of finding the minimum cost tree connecting a set of nodes, using Steiner nodes. Since it is a combinatorial optimization problem several heuristic algorithms have been developed including Tabu search, and branch and cut algorithm. In this paper, a new approach using genetic algorithms (GAs) is proposed to solve the problem. The results from GA are compared with the Tabu search method. The results indicate that GA performs as well as Tabu search in terms of solution quality but has lower computation time. However, reducing the number of iterations in Tabu search makes it faster than GA and comparable in solution quality with GA.",
author = "Chu, {Chao Hsien} and G. Premkumar and Hsinghua Chou",
year = "2000",
month = "11",
day = "16",
doi = "10.1016/S0377-2217(99)00329-X",
language = "English (US)",
volume = "127",
pages = "140--158",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "1",

}

Digital data networks design using genetic algorithms. / Chu, Chao Hsien; Premkumar, G.; Chou, Hsinghua.

In: European Journal of Operational Research, Vol. 127, No. 1, 16.11.2000, p. 140-158.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Digital data networks design using genetic algorithms

AU - Chu, Chao Hsien

AU - Premkumar, G.

AU - Chou, Hsinghua

PY - 2000/11/16

Y1 - 2000/11/16

N2 - Communication networks have witnessed significant growth in the last decade due to the dramatic growth in the use of Internet. The reliability and service quality requirements of modern data communication networks and the large investments in communications infrastructure have made it critical to design optimized networks that meet the performance parameters. Digital Data Service (DDS) is a popular communication service that provides users with a digital connection. The design of a DDS network is a special case of the classic Steiner-tree problem of finding the minimum cost tree connecting a set of nodes, using Steiner nodes. Since it is a combinatorial optimization problem several heuristic algorithms have been developed including Tabu search, and branch and cut algorithm. In this paper, a new approach using genetic algorithms (GAs) is proposed to solve the problem. The results from GA are compared with the Tabu search method. The results indicate that GA performs as well as Tabu search in terms of solution quality but has lower computation time. However, reducing the number of iterations in Tabu search makes it faster than GA and comparable in solution quality with GA.

AB - Communication networks have witnessed significant growth in the last decade due to the dramatic growth in the use of Internet. The reliability and service quality requirements of modern data communication networks and the large investments in communications infrastructure have made it critical to design optimized networks that meet the performance parameters. Digital Data Service (DDS) is a popular communication service that provides users with a digital connection. The design of a DDS network is a special case of the classic Steiner-tree problem of finding the minimum cost tree connecting a set of nodes, using Steiner nodes. Since it is a combinatorial optimization problem several heuristic algorithms have been developed including Tabu search, and branch and cut algorithm. In this paper, a new approach using genetic algorithms (GAs) is proposed to solve the problem. The results from GA are compared with the Tabu search method. The results indicate that GA performs as well as Tabu search in terms of solution quality but has lower computation time. However, reducing the number of iterations in Tabu search makes it faster than GA and comparable in solution quality with GA.

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

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

U2 - 10.1016/S0377-2217(99)00329-X

DO - 10.1016/S0377-2217(99)00329-X

M3 - Article

AN - SCOPUS:0012806972

VL - 127

SP - 140

EP - 158

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -