Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
Nowadays, most of heavy transportation company, would like to refer the computerize systems to obtain the information of the shortest path for the delivery. The problem statement of this project is about the planning route for heavy transportation is essential for effective delivery system in transp...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2017
|
| Subjects: | |
| Online Access: | https://ir.uitm.edu.my/id/eprint/69257/1/69257.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Nowadays, most of heavy transportation company, would like to refer the computerize systems to obtain the information of the shortest path for the delivery. The problem statement of this project is about the planning route for heavy transportation is essential for effective delivery system in transportation system in order to recommend the shortest path or route for deliver the load. Therefore, Heavy Transportation Shortest Route using Dijkstra’s Algorithm (HETRO) has been developed as solution due to the problems. The major objective of this project is to develop a computerize system using Dijkstra’s algorithm to find the shortest path for heavy transportation to deliver the goods in more efficient way to save cost and fast delivery. The technique used in getting the requirements is by interviewing the company project manager of the company to get the problem statements. The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. The result findings for this project is the recommended shortest path for the drivers to deliver the goods from one destination to another. |
|---|