A Genetic Algorithm Approach on Capacitated Minimum Spanning Tree Problem

For the capacitated minimum spanning tree problem (CMST), there are still no effective algorithms to solve this problem up to now. 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

[1]  Kavindra Malik,et al.  A branch and bound algorithm for the capacitated minimum spanning tree problem , 1993, Networks.

[2]  Gengui Zhou,et al.  A genetic algorithm approach on tree-like telecommunication network design problem , 2003, J. Oper. Res. Soc..

[3]  Christos H. Papadimitriou,et al.  The complexity of the capacitated tree problem , 1978, Networks.

[4]  Bezalel Gavish,et al.  Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.

[5]  Hasan Pirkul,et al.  Topological Design of Centralized Computer Networks , 1997 .

[6]  Aaron Kershenbaum,et al.  Computing capacitated minimal spanning trees efficiently , 1974, Networks.

[7]  Bezalel Gavish,et al.  Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem , 1983, JACM.

[8]  Dushyant Sharma,et al.  A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem , 2003, Oper. Res. Lett..

[9]  Aaron Kershenbaum,et al.  Centralized teleprocessing network design , 1976, Networks.

[10]  Bezalel Gavish,et al.  Augmented Lagrangean Based Algorithms for Centralized Network Design , 1985, IEEE Trans. Commun..

[11]  K. Mani Chandy,et al.  The Capacitated Minimum Spanning Tree , 1973, Networks.

[12]  Luís Gouveia,et al.  A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem , 1995, Oper. Res..

[13]  Marco Laumanns,et al.  Savings based ant colony optimization for the capacitated minimum spanning tree problem , 2006, Comput. Oper. Res..