International Journal For Multidisciplinary Research
E-ISSN: 2582-2160
•
Impact Factor: 9.24
A Widely Indexed Open Access Peer Reviewed Multidisciplinary Bi-monthly Scholarly International Journal
Home
Research Paper
Submit Research Paper
Publication Guidelines
Publication Charges
Upload Documents
Track Status / Pay Fees / Download Publication Certi.
Editors & Reviewers
View All
Join as a Reviewer
Get Membership Certificate
Current Issue
Publication Archive
Conference
Publishing Conf. with IJFMR
Upcoming Conference(s) ↓
Conferences Published ↓
DePaul-2026
IC-AIRCM-T3-2026
NSSFIGTMA-2025
SPHERE-2025
AIMAR-2025
SVGASCA-2025
ICCE-2025
Chinai-2023
PIPRDA-2023
ICMRS'23
Contact Us
Plagiarism is checked by the leading plagiarism checker
Call for Paper
Volume 8 Issue 4
July-August 2026
Indexing Partners
Graph Theoretical Analysis and Optimization of Urban Metro Rail Networks: A Case Study of Namma Metro
| Author(s) | Dr. YAMINI J, Ms. Meghana N |
|---|---|
| Country | India |
| Abstract | Urban metro rail systems are essential components of modern transportation infrastructure, and as such networks grow in scale and complexity, systematic methods for evaluating their efficiency, connectivity, and resilience become increasingly important. This paper presents a graph-theoretical framework for the analysis and optimisation of urban metro rail networks, using the Namma Metro (Bengaluru) as a case study. The network, comprising 83 stations and 82 track segments across the Purple, Green, and Yellow lines (96.1 km) is modelled as a weighted graph G = (V, E, w) with edge weights encoding travel time, distance and passenger flow. Dijkstra's algorithm is applied to determine optimal passenger routes, while degree, closeness, betweenness and eigenvector centrality measures, identify structurally critical stations. A gravity-based model estimates inter-station passenger flow, and a congestion index quantifies station-level demand concentration. A complementary coach-level analysis quantifies within-train passenger imbalance using a variance-based measure and proposes redistribution strategies to reduce it to zero. The results demonstrate that graph theory offers a rigorous and practical foundation for transportation planning, congestion mitigation, and resilience-oriented network design in rapidly growing metropolitan metro systems. |
| Keywords | Graph theory; metro rail networks; shortest path; Dijkstra's algorithm; centrality measures; congestion analysis; network robustness; Namma Metro. |
| Field | Mathematics |
| Published In | Volume 8, Issue 4, July-August 2026 |
| Published On | 2026-08-21 |
| DOI | https://doi.org/10.36948/ijfmr.2026.v08i04.86267 |
Share this

E-ISSN 2582-2160
CrossRef DOI prefix of IJFMR is 10.36948/ijfmr
All research papers published on this website are licensed under Creative Commons Attribution-ShareAlike 4.0 International License, and all rights belong to their respective authors/researchers.
Powered by Sky Research Publication and Journals