Application of Kruskal’s algorithm in finding basic feasible solutions for transportation problems
| dc.contributor.author | Ekanayake, E. M. T. D. K. | |
| dc.contributor.author | Ekanayake, E. M. U. S. B. K. | |
| dc.contributor.author | Rodrigo, W. N. P. | |
| dc.date.accessioned | 2024-10-29T04:38:12Z | |
| dc.date.available | 2024-10-29T04:38:12Z | |
| dc.date.issued | 2024-11-01 | |
| dc.description.abstract | Transportation problems (TPs) are prevalent in logistics and operational research optimization challenges. The structure of the transportation problem consists of multiple shipping routes connecting various sources to different destinations, with the objective of minimizing the overall transportation cost. The literature describes the development of many traditional methods to address transportation problems. Some methods, such as the Stepping Stone Method and the Modified Distribution Method (MODI), are intended to find an optimal solution to TP, while the Northwest, Least Cost, and Vogel’s Approximation techniques are concentrated on identifying a basic feasible solution. The proposed algorithm was based on a graphical method and has proven to provide initial basic feasible solutions to a reasonable degree of satisfaction, regardless of the scale of TPs. The modified Kruskal’s algorithm was adjusted to select edges that minimize transportation costs, subject to the constraints imposed by the demands and supply chains. This includes sorting the edges in ascending order of their cost and adding them to the solution iteratively until all nodes are connected and the constraints are satisfied. This study suggested an algorithmic approach simpler than the well-known heuristic algorithms. | |
| dc.identifier.citation | Proceedings of the Postgraduate Institute of Science Research Congress (RESCON) -2024, University of Peradeniya, P. 76 | |
| dc.identifier.issn | 3051-4622 | |
| dc.identifier.uri | https://ir.lib.pdn.ac.lk/handle/20.500.14444/2721 | |
| dc.language.iso | en | |
| dc.publisher | Postgraduate Institute of Science (PGIS), University of Peradeniya, Sri Lanka | |
| dc.relation.ispartofseries | Volume 11 | |
| dc.subject | Initial basic feasible solution | |
| dc.subject | Kruskal’s algorithm | |
| dc.subject | Minimum spanning tree | |
| dc.subject | Transportation problems | |
| dc.title | Application of Kruskal’s algorithm in finding basic feasible solutions for transportation problems | |
| dc.type | Article |