Applying Kruskal’s Algorithm in Supply Chain Management for Cost-Effective Network Optimization


Year : 2025 | Volume : 03 | Issue : 01 | Page : 49-54
    By

    Pooja Pandya,

  • Gunja Dave,

  • Nirali,

  1. Assistant Professor, Department of Computer Application, Noble University, Junagadh, Gujarat, India
  2. Assistant Professor, Department of Computer Application, Noble University, Junagadh, Gujarat, India
  3. Assistant Professor, Department of Computer Application, Noble University, Junagadh, Gujarat, India

Abstract

document.addEventListener(‘DOMContentLoaded’,function(){frmFrontForm.scrollToID(‘frm_container_abs_175074’);});Edit Abstract & Keyword

Transportation route optimization and cost reduction are major difficulties in today’s dynamic and complicated supply chain systems. To produce economical and effective network designs, this study investigates the use of Kruskal’s algorithm for supply chain network optimization. The algorithm guarantees that all supply chain nodes, including delivery hubs, warehouses, and distribution centers, relate to the lowest possible total transportation cost by building the minimum spanning tree (MST). The study shows how Kruskal’s algorithm systematically chooses the most economical routes, resulting in notable cost savings and improved operational effectiveness. This study demonstrates the algorithm’s ease of use, scalability, and adaptability through real-world examples and comparative analysis, making it a useful tool for supply chain management. The results highlight how crucial it is to gather precise data and consider other elements like delivery schedules and capacity limitations in order to guarantee thorough optimization. All things considered, this study highlights Kruskal’s algorithm as a crucial tool for developing effective, economical supply chain networks.

Keywords: Kruskal’s algorithm, supply chain optimization, minimum spanning tree (MST), transportation cost reduction, cost-effective supply chain, graph theory in supply chain, supply chain network optimization, algorithmic optimization, supply chain management, transportation routes

[This article belongs to International Journal of Algorithms Design and Analysis Review (ijadar)]

How to cite this article:
Pooja Pandya, Gunja Dave, Nirali. Applying Kruskal’s Algorithm in Supply Chain Management for Cost-Effective Network Optimization. International Journal of Algorithms Design and Analysis Review. 2025; 03(01):49-54.
How to cite this URL:
Pooja Pandya, Gunja Dave, Nirali. Applying Kruskal’s Algorithm in Supply Chain Management for Cost-Effective Network Optimization. International Journal of Algorithms Design and Analysis Review. 2025; 03(01):49-54. Available from: https://journals.stmjournals.com/ijadar/article=2025/view=0


document.addEventListener(‘DOMContentLoaded’,function(){frmFrontForm.scrollToID(‘frm_container_ref_175074’);});Edit

References

  1. El Filali A, Ben Lahmer EH, El Filali S. Machine learning techniques for supply chain management: a systematic literature review. J Syst Manage Sci. 2022; 12 (2): 79–136. doi: 10.33168/JSMS.2022. 0205.
  2. Prasad TV, Saleem A, Srinivas K, Srinivas C. Supply chain management—modeling and algorithms: a review. Int J Mech Eng. 2017; 8 (3): 191–197.
  3. Wenzel H, Smit D, Sardesai S. A literature review on machine learning in supply chain management. In: Kersten W, Blecker T, Ringle CM, editors. Artificial Intelligence and Digital Transformation in Supply Chain Management: Innovative Approaches for Supply Chains. Proceedings of the Hamburg International Conference of Logistics (HICL), Vol. 27. Berlin, Germany: epubli GmbH; 2019. pp. 413–441.
  4. Packowski J. Lean Supply Chain Planning: The New Supply Chain Management Paradigm for Process Industries to Master Today’s VUCA World. Boca Raton, FL, USA: CRC Press; 2013.
  5. Saleh A, Watson R. Business excellence in a volatile, uncertain, complex and ambiguous environment (BEVUCA). TQM J. 2017; 29 (5): 705–724.
  6. Akpan NP, Iwok IA. A minimum spanning tree approach of solving a transportation problem. Int J Math Stat Invention. 2017; 5 (3): 9–18.
  7. Krajewska MA, Kopfer H. Transportation planning in freight forwarding companies: tabu search algorithm for the integrated operational transportation planning problem. Eur J Oper Res. 2009;197(2):741-51. doi: 10.1016/j.ejor.2008.06.042.
  8. Aljanabi KB, Jasim AN. An approach for solving transportation problem using modified Kruskal’s algorithm. Int J Sci Res. 2015; 4 (7): 2426–2429.
  9. Zhou T, Xie L, Zou C, Tian Y. Research on supply chain efficiency optimization algorithm based on reinforcement learning. Adv Continuous Discrete Models. 2024; 2024 (1): 51.
  10. Beheshtinia MA, Feizollahy P, Fathi M. Supply chain optimization considering sustainability aspects. Sustainability. 2021; 13 (21): 11873.
Regular Issue Subscription Original Research
Volume 03
Issue 01
Received 20/12/2024
Accepted 22/01/2025
Published 21/02/2025
Publication Time 63 Days
163

async function fetchCitationCount(doi) {
let apiUrl = `https://api.crossref.org/works/${doi}`;
try {
let response = await fetch(apiUrl);
let data = await response.json();
let citationCount = data.message[“is-referenced-by-count”];
document.getElementById(“citation-count”).innerText = `Citations: ${citationCount}`;
} catch (error) {
console.error(“Error fetching citation count:”, error);
document.getElementById(“citation-count”).innerText = “Citations: Data unavailable”;
}
}
fetchCitationCount(“10.37591/IJADAR.v03i01.0”);

Loading citations…