Abstract
A centralized network is a network where all communication is to and from a single site. In the combinatorial optimization literature, this problem is formulated as the capacitated minimum spanning tree problem (CMST). Up to now there are still no effective algorithms to solve this problem. In this paper, we present a completely new approach by using the genetic algorithms (GAs). For the adaptation to the evolutionary process, we developed a tree-based genetic representation to code the candidate solution of the CMST problem. Numerical analysis shows the effectiveness of the proposed GA approach on the CMST problem. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Zhou, G., Cao, Z., Cao, J., & Meng, Z. (2007). A centralized network design problem with genetic algorithm approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4456 LNAI, pp. 123–132). Springer Verlag. https://doi.org/10.1007/978-3-540-74377-4_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
