A Survey of Two Optimization Methods to Solve a Modified Minimal Spanning Tree Problem in Undirected Tree Graph | Zendy

Isra Natheer Alkallak | Zendy; Ruqaya Sha’ban | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Survey of Two Optimization Methods to Solve a Modified Minimal Spanning Tree Problem in Undirected Tree Graph

Author(s) -

Isra Natheer Alkallak,

Ruqaya Sha’ban

Publication year - 2011

Publication title -

maǧallaẗ al-rāfidayn li-ʿulūm al-ḥāsibāt wa-al-riyāḍiyyāẗ/al-rafidain journal for computer sciences and mathematics

Language(s) - English

Resource type - Journals

eISSN - 2311-7990

pISSN - 1815-4816

DOI - 10.33899/csmj.2011.163613

Subject(s) - spanning tree , minimum spanning tree , computer science , distributed minimum spanning tree , gomory–hu tree , k minimum spanning tree , simulated annealing , kruskal's algorithm , mathematical optimization , euclidean minimum spanning tree , ant colony optimization algorithms , matlab , tree (set theory) , graph , algorithm , k ary tree , mathematics , theoretical computer science , tree structure , binary tree , combinatorics , operating system

The 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research