Home > Archive > 2012 > Volume 2 Number 4 (Aug. 2012) >
IJMLC 2012 Vol.2(4): 410-414 ISSN: 2010-3700
DOI: 10.7763/IJMLC.2012.V2.155

A Genetic Approach for Solving Minimum Routing Cost Spanning Tree Problem

Quoc Phan Tan

Abstract—Minimum Routing Cost Spanning Tree (MRCT) is one of spanning tree optimization problems having several applications in network design. In general case, the problem is proved to be NP-hard. The paper uses genetic (GA) approach to solve MRCT problem. Computational experiment results show that GA approach outperforms current approximation algorithms.

Index Terms—Routing Cost Spanning Tree, Genetic Algorithm, Metaheuristic Algorithm, Spanning Tree Optimization Problem.

Quoc Phan Tan is with Department of Information Technology of Saigon University, Ho Chi Minh city, Vietnam (email: phantanquoc@gmail.com).

[PDF]

Cite: Quoc Phan Tan, "A Genetic Approach for Solving Minimum Routing Cost Spanning Tree Problem," International Journal of Machine Learning and Computing vol. 2, no. 4, pp. 410-414, 2012.

General Information

  • ISSN: 2010-3700 (Online)
  • Abbreviated Title: Int. J. Mach. Learn. Comput.
  • Frequency: Bimonthly
  • DOI: 10.18178/IJMLC
  • Editor-in-Chief: Dr. Lin Huang
  • Executive Editor:  Ms. Cherry L. Chen
  • Abstracing/Indexing: Inspec (IET), Google Scholar, Crossref, ProQuest, Electronic Journals Library.
  • E-mail: ijmlc@ejournal.net


Article Metrics