An approach of ant algorithm for solving minimum routing cost spanning tree problem

Authors:
Nguyen Minh Hieu;PhanTan Quoc;Nguyen Duc Nghia
Affiliations:
Ha Noi University of Science and Technology, Ha Noi City, Viet Nam;Saigon University, Ho Chi Minh City, Vietnam;Ha Noi University of Science and Technology, Ha Noi City, Viet Nam
Venue:
Proceedings of the Second Symposium on Information and Communication Technology
Year:
2011

Citing 4
Cited 0

MAX-MIN Ant system

Future Generation Computer Systems
Ant Colony Optimization

Ant Colony Optimization
A fast algorithm for computing minimum routing cost spanning trees

Computer Networks: The International Journal of Computer and Telecommunications Networking
Nature-Inspired Metaheuristic Algorithms: Second Edition

Nature-Inspired Metaheuristic Algorithms: Second Edition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Minimum routing cost spanning tree problem-MRCT is one of classical problems in network designing. In this paper, we will introduce a new approach of applying, conducting implementation experiments and analyzing some aspects of using ant algorithm for MRCT problem.