Bees algorithm for solving minimum routing cost spanning tree problem.
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/29/3/2775Keywords:
Minimum routing cost spanning tree, bee algorithms, meta-heuristic algorithms, swarm intelligenceAbstract
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.Metrics
Metrics Loading ...
Downloads
Published
09-07-2013
How to Cite
[1]
P. T. Quoc and N. D. Nghia, “Bees algorithm for solving minimum routing cost spanning tree problem”., JCC, vol. 29, no. 3, pp. 265–276, Jul. 2013.
Issue
Section
Computer Science
License
1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.
