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:

書目詳細資料
主要作者:	Ahmad Nezer, Nurul Aqilah
格式:	Thesis
語言:	English
出版:	2017
主題:	Instruments and machines Online data processing Mobile computing Computer software Software measurement Database management
在線閱讀:	https://ir.uitm.edu.my/id/eprint/69257/1/69257.pdf
標簽:	添加標簽沒有標簽, 成為第一個標記此記錄!

id	my-uitm-ir.69257
record_format	uketd_dc
spelling	my-uitm-ir.692572022-10-27T05:04:17Z Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer 2017-01 Ahmad Nezer, Nurul Aqilah Instruments and machines Electronic Computers. Computer Science Online data processing Mobile computing Computer software Development. UML (Computer science) Software measurement Database management Web-based user interfaces. User interfaces (Computer systems) 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. 2017-01 Thesis https://ir.uitm.edu.my/id/eprint/69257/ https://ir.uitm.edu.my/id/eprint/69257/1/69257.pdf text en public degree Universiti Teknologi MARA, Terengganu Faculty of Computer and Mathematical Sciences Sulong, Suhana
institution	Universiti Teknologi MARA
collection	UiTM Institutional Repository
language	English
advisor	Sulong, Suhana
topic	Instruments and machines Instruments and machines Online data processing Mobile computing Computer software Instruments and machines Software measurement Database management Instruments and machines
spellingShingle	Instruments and machines Instruments and machines Online data processing Mobile computing Computer software Instruments and machines Software measurement Database management Instruments and machines Ahmad Nezer, Nurul Aqilah Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
description	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.
format	Thesis
qualification_level	Bachelor degree
author	Ahmad Nezer, Nurul Aqilah
author_facet	Ahmad Nezer, Nurul Aqilah
author_sort	Ahmad Nezer, Nurul Aqilah
title	Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
title_short	Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
title_full	Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
title_fullStr	Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
title_full_unstemmed	Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
title_sort	heavy transportation shortest route using dijkstra’s algorithm (hetro) / nurul aqilah ahmad nezer
granting_institution	Universiti Teknologi MARA, Terengganu
granting_department	Faculty of Computer and Mathematical Sciences
publishDate	2017
url	https://ir.uitm.edu.my/id/eprint/69257/1/69257.pdf
_version_	1783735858870878208

Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

相似書籍