Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Telecommunications network design algorithms
Telecommunications network design algorithms
An effective genetic algorithm approach to the quadratic minimum spanning tree problem
Computers and Operations Research
Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
Journal of the ACM (JACM)
Genetic Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Savings based ant colony optimization for the capacitated minimum spanning tree problem
Computers and Operations Research
Operations Research Letters
Hi-index | 0.00 |
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.