Peruse Of Traffic In Educational Premises Using Max-Flow Min-Cut Theorem

Main Article Content

Shankar D. Ugale
Anjali Nanaware
Arundhati Vaishnav
Dr. Madhukar Palve
Kirti Takale
Dr. Vineeta Basotia

Abstract

Traffic congestion is a growing problem in urban areas around the world, and educational institutions are not immune. This research paper investigates the application of the Ford-Fulkerson algorithm to minimize traffic congestion in Samarth Vidya Sankul, Talegaon Dabhade City. The Ford-Fulkerson algorithm is a powerful tool for solving maximum flow problems in networks, and it can be effectively applied to traffic management scenarios. This paper presents a case study of Samarth Vidya Sankul, utilizing the algorithm to identify bottlenecks and optimize traffic flow within the school premises. The findings of this research can be valuable for improving traffic management not only in Samarth Vidya Sankul but also in other educational institutions and similar settings

Downloads

Download data is not yet available.

Article Details

How to Cite
Shankar D. Ugale, Anjali Nanaware, Arundhati Vaishnav, Dr. Madhukar Palve, Kirti Takale, & Dr. Vineeta Basotia. (2024). Peruse Of Traffic In Educational Premises Using Max-Flow Min-Cut Theorem. Educational Administration: Theory and Practice, 30(4), 1325–1332. https://doi.org/10.53555/kuey.v30i4.1663
Section
Articles
Author Biographies

Shankar D. Ugale

Research Scholar, Department of Mathematics, Shri JJT University, Rajasthan, India

Anjali Nanaware

Student, Nutan Maharashtra Institute of Engineering and Technology, Pune, India

Arundhati Vaishnav

Student, Nutan Maharashtra Institute of Engineering and Technology, Pune, India

Dr. Madhukar Palve

Assistant Professor, Prof.Ramkrishna More Arts, Commerce and Science College Pune, India

Kirti Takale

Research Scholar, Department of Mathematics, Shri JJT University, Rajasthan, India

Dr. Vineeta Basotia

Associate Professor, Department of Mathematics, Shri JJT University, Rajasthan, India