Designing communication network topologies using steady-state genetic algorithms

This letter presents the application of steady state genetic algorithms (SSGA) to minimize the total installation cost of a communication network by optimally designing the topology layout and assigning the corresponding capacities (TDCA problem). This highly constrained optimization problem is show...

Full description

Bibliographic Details
Main Authors: Sayoud, H., Takahashi, K., Vaillant, B.
Format: Article
Language:English
Published: 2001
Subjects:
Online Access:http://shdl.mmu.edu.my/2695/
http://shdl.mmu.edu.my/2695/1/1936.pdf
_version_ 1848790125829423104
author Sayoud, H.
Takahashi, K.
Vaillant, B.
author_facet Sayoud, H.
Takahashi, K.
Vaillant, B.
author_sort Sayoud, H.
building MMU Institutional Repository
collection Online Access
description This letter presents the application of steady state genetic algorithms (SSGA) to minimize the total installation cost of a communication network by optimally designing the topology layout and assigning the corresponding capacities (TDCA problem). This highly constrained optimization problem is shown to be better solved using GA's. A binary representation of links between node pairs is developed and tested on a network of 20 nodes. Improved results, both in terms of network cost, performance and computation speed, are obtained when comparing with existing heuristic approaches.
first_indexed 2025-11-14T18:07:39Z
format Article
id mmu-2695
institution Multimedia University
institution_category Local University
language English
last_indexed 2025-11-14T18:07:39Z
publishDate 2001
recordtype eprints
repository_type Digital Repository
spelling mmu-26952014-02-13T02:41:20Z http://shdl.mmu.edu.my/2695/ Designing communication network topologies using steady-state genetic algorithms Sayoud, H. Takahashi, K. Vaillant, B. TK5101-6720 Telecommunication. Including telegraphy, telephone, radio, radar, television This letter presents the application of steady state genetic algorithms (SSGA) to minimize the total installation cost of a communication network by optimally designing the topology layout and assigning the corresponding capacities (TDCA problem). This highly constrained optimization problem is shown to be better solved using GA's. A binary representation of links between node pairs is developed and tested on a network of 20 nodes. Improved results, both in terms of network cost, performance and computation speed, are obtained when comparing with existing heuristic approaches. 2001-03 Article NonPeerReviewed text en http://shdl.mmu.edu.my/2695/1/1936.pdf Sayoud, H. and Takahashi, K. and Vaillant, B. (2001) Designing communication network topologies using steady-state genetic algorithms. IEEE Communications Letters, 5 (3). pp. 113-115. ISSN 10897798 http://dx.doi.org/10.1109/4234.913157 doi:10.1109/4234.913157 doi:10.1109/4234.913157
spellingShingle TK5101-6720 Telecommunication. Including telegraphy, telephone, radio, radar, television
Sayoud, H.
Takahashi, K.
Vaillant, B.
Designing communication network topologies using steady-state genetic algorithms
title Designing communication network topologies using steady-state genetic algorithms
title_full Designing communication network topologies using steady-state genetic algorithms
title_fullStr Designing communication network topologies using steady-state genetic algorithms
title_full_unstemmed Designing communication network topologies using steady-state genetic algorithms
title_short Designing communication network topologies using steady-state genetic algorithms
title_sort designing communication network topologies using steady-state genetic algorithms
topic TK5101-6720 Telecommunication. Including telegraphy, telephone, radio, radar, television
url http://shdl.mmu.edu.my/2695/
http://shdl.mmu.edu.my/2695/
http://shdl.mmu.edu.my/2695/
http://shdl.mmu.edu.my/2695/1/1936.pdf