A Genetic Approach for Solving Minimum Routing Cost Spanning Tree Problem - Volume 2 Number 4 (Aug. 2012) - IJMLC
  • Aug 09, 2018 News! Vol. 6, No. 4-No. 7, No. 3 has been indexed by EI(Inspec)!   [Click]
  • Aug 09, 2018 News!Good News! All papers from Volume 8, Number 3 have been indexed by Scopus!   [Click]
  • May 23, 2018 News![CFP] 2018 the annual meeting of IJMLC Editorial Board, ACMLC 2018, will be held in Ho Chi Minh, Vietnam, December 7-9, 2018   [Click]
Search
General Information
Editor-in-chief
Dr. Lin Huang
Metropolitan State University of Denver, USA
It's my honor to take on the position of editor in chief of IJMLC. We encourage authors to submit papers concerning any branch of machine learning and computing.
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.

Copyright © 2008-2018. International Journal of Machine Learning and Computing. All rights reserved.
E-mail: ijmlc@ejournal.net