An Optimized Graph Based Implementation for Efficient Journey Planning with Public Transport in Kathmandu Valley
DOI:
https://doi.org/10.3126/injet.v2i2.78657Keywords:
Public Transport, Kathmandu Valley, Journey Planning, Graph-Based Optimization, Multi-Modal Routing, Route Optimization, Urban Mobility, Transport NetworksAbstract
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
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 International Journal on Engineering Technology

This work is licensed under a Creative Commons Attribution 4.0 International License.
This license enables reusers to distribute, remix, adapt, and build upon the material in any medium or format, so long as attribution is given to the creator. The license allows for commercial use.