@article{Hassan_Hassan_2016, title={Cairo Public Transport Route Finder – A Pilot System}, volume={4}, url={https://online-journals.org/index.php/i-jes/article/view/6542}, DOI={10.3991/ijes.v4i4.6542}, abstractNote={Aiming to facilitate the choice of transport links leading from a starting location to a destination in greater Cairo, we propose in this work a public transportation mobile (android) application to assist users of public transport. The system is a pilot application that considers the public mini-buses network in three areas of Cairo, and builds the database of the mini-bus network verified on the ground. From this database, the transportation network graph consisting of nodes and possible links between them is constructed. Upon request, the system then identifies the series of public transport possible, calculates the shortest path between the two chosen locations, and displays the bus, or series of buses, and the routes to the user, ordered by distance. The specialized algorithm Dijkstra was implemented to find the shortest route.}, number={4}, journal={International Journal of Recent Contributions from Engineering, Science & IT (iJES)}, author={Hassan, Khaled Ahmed Ahmed Mohamed and Hassan, Ghada Nasr}, year={2016}, month={Dec.}, pages={pp. 26–32} }