Minimization of traveling time for courier services using Floyd-Warshall algorithm (case study in Seremban 3) / Nur Haifa Nadhira Mohd Hisham, Norfatehah Hairuddin and Wan Nur Amira Natasya Wan Anuar

The existence of online shopping increased the demand of courier services. Due to this demand, there may be a delay in delivering consignments to customers. Thus, distributors might take time to deliver the consignments to customers and will probably go beyond their own working hours. This problem l...

Full description

Saved in:
Bibliographic Details
Main Authors: Mohd Hisham, Nur Haifa Nadhira, Hairuddin, Norfatehah, Wan Anuar, Wan Nur Amira Natasya
Format: Student Project
Language:English
Published: 2023
Subjects:
Online Access:https://ir.uitm.edu.my/id/eprint/82641/1/82641.pdf
https://ir.uitm.edu.my/id/eprint/82641/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uitm.ir.82641
record_format eprints
spelling my.uitm.ir.826412023-08-15T05:14:09Z https://ir.uitm.edu.my/id/eprint/82641/ Minimization of traveling time for courier services using Floyd-Warshall algorithm (case study in Seremban 3) / Nur Haifa Nadhira Mohd Hisham, Norfatehah Hairuddin and Wan Nur Amira Natasya Wan Anuar Mohd Hisham, Nur Haifa Nadhira Hairuddin, Norfatehah Wan Anuar, Wan Nur Amira Natasya Mathematical statistics. Probabilities The existence of online shopping increased the demand of courier services. Due to this demand, there may be a delay in delivering consignments to customers. Thus, distributors might take time to deliver the consignments to customers and will probably go beyond their own working hours. This problem leads to a lack of coherence in the delivery process where the distributor has difficulty determining an appropriate delivery route that is as short as possible. Furthermore, other problems may also contribute to the delay in the delivery process such as high traffic jams. Hence, this gives the motivation to this study in finding the minimum travel time from the courier office to the receivers. Next, to establish the shortest path based on the minimum travel time from the courier office to the receivers and finally, to compare the service between current practice by the courier service and the proposed method used in the study. The time distance and sequence matrices were built based on the data collected from Google Maps and interviews were conducted at the local courier office. This study focused on Floyd-Warshall algorithm in finding the shortest path to deliver the consignment with the least travel time. A Floyd-Warshall algorithm is implemented after both matrices have been completed. An algorithm was run in software called Toolkit for Oracle (TORA). As for the result, the shortest path for the courier was obtained. By using the proposed algorithm, courier services may find the shortest traveling time possible. In conclusion, the courier service can reduce up to 8.3%, 30%, and 21.25% of their travel time for each zone. 2023 Student Project NonPeerReviewed text en https://ir.uitm.edu.my/id/eprint/82641/1/82641.pdf Minimization of traveling time for courier services using Floyd-Warshall algorithm (case study in Seremban 3) / Nur Haifa Nadhira Mohd Hisham, Norfatehah Hairuddin and Wan Nur Amira Natasya Wan Anuar. (2023) [Student Project] (Unpublished)
institution Universiti Teknologi Mara
building Tun Abdul Razak Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Mara
content_source UiTM Institutional Repository
url_provider http://ir.uitm.edu.my/
language English
topic Mathematical statistics. Probabilities
spellingShingle Mathematical statistics. Probabilities
Mohd Hisham, Nur Haifa Nadhira
Hairuddin, Norfatehah
Wan Anuar, Wan Nur Amira Natasya
Minimization of traveling time for courier services using Floyd-Warshall algorithm (case study in Seremban 3) / Nur Haifa Nadhira Mohd Hisham, Norfatehah Hairuddin and Wan Nur Amira Natasya Wan Anuar
description The existence of online shopping increased the demand of courier services. Due to this demand, there may be a delay in delivering consignments to customers. Thus, distributors might take time to deliver the consignments to customers and will probably go beyond their own working hours. This problem leads to a lack of coherence in the delivery process where the distributor has difficulty determining an appropriate delivery route that is as short as possible. Furthermore, other problems may also contribute to the delay in the delivery process such as high traffic jams. Hence, this gives the motivation to this study in finding the minimum travel time from the courier office to the receivers. Next, to establish the shortest path based on the minimum travel time from the courier office to the receivers and finally, to compare the service between current practice by the courier service and the proposed method used in the study. The time distance and sequence matrices were built based on the data collected from Google Maps and interviews were conducted at the local courier office. This study focused on Floyd-Warshall algorithm in finding the shortest path to deliver the consignment with the least travel time. A Floyd-Warshall algorithm is implemented after both matrices have been completed. An algorithm was run in software called Toolkit for Oracle (TORA). As for the result, the shortest path for the courier was obtained. By using the proposed algorithm, courier services may find the shortest traveling time possible. In conclusion, the courier service can reduce up to 8.3%, 30%, and 21.25% of their travel time for each zone.
format Student Project
author Mohd Hisham, Nur Haifa Nadhira
Hairuddin, Norfatehah
Wan Anuar, Wan Nur Amira Natasya
author_facet Mohd Hisham, Nur Haifa Nadhira
Hairuddin, Norfatehah
Wan Anuar, Wan Nur Amira Natasya
author_sort Mohd Hisham, Nur Haifa Nadhira
title Minimization of traveling time for courier services using Floyd-Warshall algorithm (case study in Seremban 3) / Nur Haifa Nadhira Mohd Hisham, Norfatehah Hairuddin and Wan Nur Amira Natasya Wan Anuar
title_short Minimization of traveling time for courier services using Floyd-Warshall algorithm (case study in Seremban 3) / Nur Haifa Nadhira Mohd Hisham, Norfatehah Hairuddin and Wan Nur Amira Natasya Wan Anuar
title_full Minimization of traveling time for courier services using Floyd-Warshall algorithm (case study in Seremban 3) / Nur Haifa Nadhira Mohd Hisham, Norfatehah Hairuddin and Wan Nur Amira Natasya Wan Anuar
title_fullStr Minimization of traveling time for courier services using Floyd-Warshall algorithm (case study in Seremban 3) / Nur Haifa Nadhira Mohd Hisham, Norfatehah Hairuddin and Wan Nur Amira Natasya Wan Anuar
title_full_unstemmed Minimization of traveling time for courier services using Floyd-Warshall algorithm (case study in Seremban 3) / Nur Haifa Nadhira Mohd Hisham, Norfatehah Hairuddin and Wan Nur Amira Natasya Wan Anuar
title_sort minimization of traveling time for courier services using floyd-warshall algorithm (case study in seremban 3) / nur haifa nadhira mohd hisham, norfatehah hairuddin and wan nur amira natasya wan anuar
publishDate 2023
url https://ir.uitm.edu.my/id/eprint/82641/1/82641.pdf
https://ir.uitm.edu.my/id/eprint/82641/
_version_ 1775626463931793408
score 13.214268