For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A New Evolutionary Algorithm for Spanning-Tree Based Communication Network Design
Sang-Moon SOAK David CORNE Byung-Ha AHN
IEICE TRANSACTIONS on Communications
Publication Date: 2005/10/01
Print ISSN: 0916-8516
Type of Manuscript: LETTER
optimum communication spanning tree problem, quadratic minimum spanning tree problem, evolutionary algorithm, genetic representation method,
Full Text: PDF>>
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.