A New Evolutionary Algorithm for Spanning-Tree Based Communication Network Design
Summary :
A novel evolutionary algorithm is described for designing the topology of spanning tree-based communication networks. Two specific performance objectives are dealt with: the optimum communication spanning tree problem (OCSTP), and the quadratic minimum spanning tree problem (q-MST). Improved network performance is reliably obtained when using the proposed algorithm on accepted benchmark instances, in comparison with the previous best-known approaches. The same methodology can be applied straightforwardly to the design of communication networks with other objectives.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E88-B No.10 pp.4090-4093
- Publication Date
- 2005/10/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietcom/e88-b.10.4090
- Type of Manuscript
- LETTER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Sang-Moon SOAK, David CORNE, Byung-Ha AHN, "A New Evolutionary Algorithm for Spanning-Tree Based Communication Network Design" in IEICE TRANSACTIONS on Communications,
vol. E88-B, no. 10, pp. 4090-4093, October 2005, doi: 10.1093/ietcom/e88-b.10.4090.
Abstract: A novel evolutionary algorithm is described for designing the topology of spanning tree-based communication networks. Two specific performance objectives are dealt with: the optimum communication spanning tree problem (OCSTP), and the quadratic minimum spanning tree problem (q-MST). Improved network performance is reliably obtained when using the proposed algorithm on accepted benchmark instances, in comparison with the previous best-known approaches. The same methodology can be applied straightforwardly to the design of communication networks with other objectives.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.10.4090/_p
Copy
@ARTICLE{e88-b_10_4090,
author={Sang-Moon SOAK, David CORNE, Byung-Ha AHN, },
journal={IEICE TRANSACTIONS on Communications},
title={A New Evolutionary Algorithm for Spanning-Tree Based Communication Network Design},
year={2005},
volume={E88-B},
number={10},
pages={4090-4093},
abstract={A novel evolutionary algorithm is described for designing the topology of spanning tree-based communication networks. Two specific performance objectives are dealt with: the optimum communication spanning tree problem (OCSTP), and the quadratic minimum spanning tree problem (q-MST). Improved network performance is reliably obtained when using the proposed algorithm on accepted benchmark instances, in comparison with the previous best-known approaches. The same methodology can be applied straightforwardly to the design of communication networks with other objectives.},
keywords={},
doi={10.1093/ietcom/e88-b.10.4090},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - A New Evolutionary Algorithm for Spanning-Tree Based Communication Network Design
T2 - IEICE TRANSACTIONS on Communications
SP - 4090
EP - 4093
AU - Sang-Moon SOAK
AU - David CORNE
AU - Byung-Ha AHN
PY - 2005
DO - 10.1093/ietcom/e88-b.10.4090
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2005
AB - A novel evolutionary algorithm is described for designing the topology of spanning tree-based communication networks. Two specific performance objectives are dealt with: the optimum communication spanning tree problem (OCSTP), and the quadratic minimum spanning tree problem (q-MST). Improved network performance is reliably obtained when using the proposed algorithm on accepted benchmark instances, in comparison with the previous best-known approaches. The same methodology can be applied straightforwardly to the design of communication networks with other objectives.
ER -
English
