Results in Control and Optimization (Mar 2024)
Innovative method to solve the minimum spanning tree problem: The Dhouib-Matrix-MSTP (DM-MSTP)
Abstract
The Minimum Spanning Tree problem aims to create a subset of a graph where all the vertices are connected with the minimum edge weights and with no cycle. In this field, an innovative method entitled Dhouib-Matrix-MSTP (DM-MSTP) is designed in this research work with a time complexity independently of the number of edges O(n*log(n)) where n is the number of vertices. DM-MSTP is a constructive algorithm based on a matrix navigation with two new lists (Min-Columns and MST-Path) in order to organize the steering flow. DM-MSTP is composed of four simple steps where the first and the fourth steps are repeated only once, whereas the second and third are reiterated (n-1). For more clarification, a step-by-step application of the proposed method is presented in details. Besides, the performance of DM-MSTP is proved through different examples from the literature including a graph with negative weighted edges and complete graphs from TSP-LIB. Moreover, with a simple modification (Min by Max) the DM-MSTP is tested on the Maximum (Largest) Spanning Tree Problem. Also, DM-MSTP is applied on eight case studies and compared to six methods developed in the literature. All these experimental results in the above different environments show that DM-MSTP can rapidly plan the shortest spanning tree with a stable performance and convivial representation of the optimal tree. Hence, DM-MSTP is developed under Python programming language using Matplotlib and Numpy standard libraries.
