Application of Dijkstra Algorithm to Proposed Tramway of a Potential World Class University
- 1 Department of Mathematics, Covenant University, Ota, Nigeria
- 2 Department of Computer and Information Science, Covenant University, Ota, Nigeria
- 3 Department of Computer and Information Science, Covenant University, Ota, Nigeria
Abstract
Nowadays, the development of “smart cities” with a high level of quality of life is becoming a prior challenge to be addressed. In this paper, promoting the model shift in railway transportation using tram network towards more reliable, greener and in general more sustainable transportation modes in a potential world class university is proposed. “Smart mobility” in a smart city will significantly contribute to achieving the goal of a university becoming a world class university. In order to have a regular and reliable rail system on campus, we optimize the route among major stations on campus, using shortest path problem Dijkstra algorithm in conjunction with a computer software called LINDO to arrive at the optimal route. In particular, it is observed that the shortest path from the main entrance gate (Canaan land entrance gate) to the Electrical Engineering Department is of distance 0.805 km.
- Badawy, E.D. and Sargent, J.E. (2000) Trams and Streetscapes Metropolitan Melbourne 1950s-1960s: A Photographic Profile. 4th Edition, Train Hobby Publications, Melbourne, 1.
- Agarana, M.C. and Gbadeyan, J.A. (2015) Finite Difference Dynamic Analysis of Railway Bridges Supported by Pasternak Foundation under Uniform Partially Distributed Moving Railway Vehicle. International Conference on Systems Engineering and Engineering Management (IAENG), San Francisco, 21-23 October 2015, 996-1000.
- Morrison, A. (2013) The Tramways of Bogota Colombia, Electric Transport in Latin America.
- Thorup, M. (2000) On RAM priority Queues. SIAM Journal on Computing, 30, 86-109. http://dx.doi.org/10.1137/S0097539795288246
- Tram-Definition and More from the Free Merriam Webster Dictionary (n.d.).
- Urban Rail Transit; from Wikipedia, the Free Encyclopedia. https://en.wikipedia.org/wiki/Urban_rail_transit
- Ahuja, R.K., Mehlhorn, K., Orlin, J.B. and Tarjan, R.E. (1990) Faster Algorithms for the Shortest Path Problem. Journal of Association for Computing Machinery, 37, 213-223. http://dx.doi.org/10.1145/77600.77615
- Thorup, M. (1999) Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. Journal of the ACM, 46, 362-394. http://dx.doi.org/10.1145/316542.316548
- Santitham Prom-on (2013) Finding the Shortest Path Using Dijkstra’s Algorithm. King Mongkut’s University of Techology, Thonburi.
- Sunanda, D. and Pramod, P. (n.d.). Railway Route Optimization System Using Dijkstra Method. International Journal on Recent and Innovation Trends in Computing and Communication, 2, 3435-3440.
- Dijkstra’s Algorithm from Wikipedia, the Free Encyclopedia
- www.shutterstock.com/s/tram/sear.html
- Agarana, M.C. and Olokunde, T.O. (2015) Optimization of Healthcare Pathways in Covenant University Health Centre using Linear Programing Model. Far East Journal of Applied Mathematics, 91, 215-228.
- Guglielminetti, J.-P.L. (2001) Freight Transport Planning: An Optimisation Model for the Swiss Transport Research Conference. Institute of Transportation and Planning (ITEP), 1-3.