Abstract
The task to find Minimum Routing Cost Spanning Tree (MRCST) can be found in many network design problems. In general cases, the MRCST problem is proved to be NP-hard. This paper proposes an algorithm tosolve MRCST problem based on the schema of bee algorithm. The computationa lexperiment results show that our proposed algorithm outperforms the Wong's algorithm, population-basedmeta-heuristics like Max-Min Ant System (MMAS), Genetic Algorithm (GA), Artificial Bee Colony algorithm (ABC), and other well-known heuristic algorithms. The cost to get this result is the large number of spanning trees examined by our algorithm compared to other methods, e.g., 16000 times and 1.7 times more than that of Wong's algorithm and ABC algorithm on average, respectively.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
