An Optimized Graph Based Implementation for Efficient Journey Planning with Public Transport in Kathmandu Valley

Authors

  • Madhav Prasad Parajuli Department of Electronics and Computer Engineering, Pulchowk Campus, IOE, TU
  • Madhu Sharma Department of Electronics and Computer Engineering, Pulchowk Campus, IOE, TU
  • Sushant Chalise Department of Electronics and Computer Engineering, Pulchowk Campus, IOE, TU
  • Santosh Giri Department of Electronics and Computer Engineering, Pulchowk Campus, IOE, TU

DOI:

https://doi.org/10.3126/injet.v2i2.78657

Keywords:

Public Transport, Kathmandu Valley, Journey Planning, Graph-Based Optimization, Multi-Modal Routing, Route Optimization, Urban Mobility, Transport Networks

Abstract

Kathmandu Valley’s public transport system, serving 28% of the population with only 3% of registered vehicles, lacks centralized route information, causing inefficiencies in commuting. This paper proposes an optimized graph-based journey planning system tailored for the valley’s semi-formal transit network. The system integrates multi-modal routing algorithms, optimizing routes based on travel time, cost, transfers, and walking distance. A combination of data collection methods, including user surveys and on-site validation, informs the route recommendations. Evaluation results show that the system reduces average journey time by 18%, with 73% of users discovering more efficient routes. The findings highlight the potential for data-driven optimization in urban mobility without major infrastructure changes, offering insights applicable to other developing cities.

Downloads

Download data is not yet available.
Abstract
374
PDF
306

Downloads

Published

2025-05-19

How to Cite

Parajuli, M. P., Sharma, M., Chalise, S., & Giri, S. (2025). An Optimized Graph Based Implementation for Efficient Journey Planning with Public Transport in Kathmandu Valley. International Journal on Engineering Technology, 2(2), 296–305. https://doi.org/10.3126/injet.v2i2.78657

Issue

Section

Articles