The minimum spanning tree problem consists of finding a minimum cost spanning tree in an undirected graph in various types of networks. Minimum weight spanning tree visits all vertices that are in the similar associated part as the beginning node. In this investigation, we examine the various techniques for solving a Generalized Minimum Weight Spanning Tree Problem. Also, we present the An Approach for Solving Minimum Spanning Tree Problem and Transportation Problem Using Modified Ant Colony Algorithm. Different methodologies have been made in the composition for dealing with transportation on finding an initial basic feasible solution and the rest to find the optimal solution to the TP. Northwest, Least Cost, and Vogel’s Approximation techniques are created to find an initial basic feasible solution whereas the Modified Distribution (MODI) Method and Stepping Stone Method is designed to find an optimal solution to the TP. In this examination, we propose a heuristic method known as the Modified Ant Colony Optimization Algorithm, which is based on Ant Colony Algorithm (ACA) procedure has demonstrated to provide near-optimal solutions to a reasonable degree of satisfaction to large scale TPs. In this novel approach, the degree of satisfaction of the optimal solution has been improved by modifying ACA with the incorporation of the transition Rule and Pheromone Update Rule. The algorithmic approach proposed by this study is less complicated compared to the well-known meta-heuristic algorithms in the literature. In the end, we represent the conclusion we illustrate the proposed method using a case to study.