doi: 10.7763/IJMLC.2012.V2.155
A Genetic Approach for Solving Minimum Routing Cost Spanning Tree Problem
Quoc Phan Tan
- Department of Information Technology of Saigon University, Ho Chi Minh city, Vietnam.
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.
Keywords
- Routing Cost Spanning Tree
- Genetic Algorithm
- Metaheuristic Algorithm
- Spanning Tree Optimization Problem
How to Cite
Quoc Phan Tan, "A Genetic Approach for Solving Minimum Routing Cost Spanning Tree Problem," International Journal of Machine Learning, vol. 2, no. 4, pp. 410-414, 2012. https://doi.org/10.7763/IJMLC.2012.V2.155
Copyright & License
Copyright © 2012 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).