A Survey of Two Optimization Methods to Solve a Modified Minimal Spanning Tree Problem in Undirected Tree Graph
AL-Rafidain Journal of Computer Sciences and Mathematics,
2011, Volume 8, Issue 1, Pages 117-134
AbstractThe paper tackled a survey of two optimization methods to study spanning tree problem by modifying the spanning tree problem to generate all of possible solutions in undirected tree graph with simulated annealing algorithm and ant colony optimization algorithm. These algorithms are two of the optimization methods to find optimal solution from many of solutions in search space. A program is written in MATLAB 6.5 language to simulate these two algorithms with spanning tree problem. The experimental results in this paper show the effectiveness and easy implementation of each algorithm to find optimal solution, and to perform significantly better than the manual method.
- Article View: 70
- PDF Download: 80