Article ID: | iaor20041039 |
Country: | United Kingdom |
Volume: | 54 |
Issue: | 3 |
Start Page Number: | 248 |
End Page Number: | 254 |
Publication Date: | Mar 2003 |
Journal: | Journal of the Operational Research Society |
Authors: | Gen M., Zhou G. |
Keywords: | networks |
In the context of telecommunications networks, the networks terminals involve certain constraints that are either related with the performance of the corresponding network or with the availability of some classes of devices. In this paper, we discuss a tree-like telecommunication network design problem with the constraint limiting the number of terminals. First, this problem is formulated as a leaf-constrained minimum spanning tree (lc-MST). Then we develop a tree-based genetic representation to encode the candidate solutions of the lc-MST problem. Compared with the existing heuristic algorithm, the numerical results show the high effectiveness of the proposed GA approach on this problem.