Simulation of the shortest routes in the Accra Metropolis
| dc.contributor.author | Ampomah-Amoako, Emmanuel | |
| dc.date.accessioned | 2011-08-11T23:04:13Z | |
| dc.date.accessioned | 2023-04-20T12:47:17Z | |
| dc.date.available | 2011-08-11T23:04:13Z | |
| dc.date.available | 2023-04-20T12:47:17Z | |
| dc.date.issued | 2011-08-11 | |
| dc.description.abstract | The shortest path models were reviewed and Dijkstra's Algorithm was selected to simulate the shortest distances in the Accra Metropolis. The distances between 116 locations in the Metropolis were measured and their position vectors relative to the King Tackie Tawiah Overhead were formulated. A Fortran 90 program was prepared using Dijkstra's Algorithm. The distances and position vectors were used to prepare an input deck for the Fortran 90 program. The program runs actively on a Pentium IV computer. Recommendations on integrating the software into the current scheme of planning were made. | en_US |
| dc.description.sponsorship | KNUST | en_US |
| dc.identifier.uri | https://ir.knust.edu.gh/handle/123456789/837 | |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | 4966; | |
| dc.title | Simulation of the shortest routes in the Accra Metropolis | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- KNUST Library.pdf
- Size:
- 7.09 KB
- Format:
- Adobe Portable Document Format
- Description: