Optimizing passenger before- boarding time using Queuing Theory and Dijkstra Algorithm / Nur Ariena Farhana Noor Hamizan

The train is the best alternative public transport for Malaysians to use to avoid traffic jams. However, passengers are often delayed by the lengthy queuing time at the ticket counter during rush hours. To help reduce passenger travel time before boarding during rush hour, the current study aimed to...

Full description

Saved in:
Bibliographic Details
Main Author: Noor Hamizan, Nur Ariena Farhana
Format: Thesis
Language:English
Published: 2021
Subjects:
Online Access:https://ir.uitm.edu.my/id/eprint/44416/1/44416.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-uitm-ir.44416
record_format uketd_dc
spelling my-uitm-ir.444162021-10-27T04:09:21Z Optimizing passenger before- boarding time using Queuing Theory and Dijkstra Algorithm / Nur Ariena Farhana Noor Hamizan 2021-03-29 Noor Hamizan, Nur Ariena Farhana Urban transportation Path analysis. Structural equation modeling The train is the best alternative public transport for Malaysians to use to avoid traffic jams. However, passengers are often delayed by the lengthy queuing time at the ticket counter during rush hours. To help reduce passenger travel time before boarding during rush hour, the current study aimed to minimize two items, namely counter service time for buying tickets and travel time from the ticket counter to the train platform. To achieve these objectives, Queuing Theory Problem and Shortest Path Problem (Dijkstra Algorithm) were applied. Based on the result, both objectives were successfully achieved. The minimum average counter service time was 0.88 minutes. Then, the shortest time from the ticket counter to the platform was 111 seconds. For both time frames, the minimum duration before buying tickets until arriving at the platform was 2.73 minutes. It is recommended that future research in this area compare between waiting time during rush hour and non-rush hour to identify the major problem that occurs during rush hour. This study can be further enhanced by expanding the use of the queuing theory to determine the number of optimal counters to operate at one time. 2021-03 Thesis https://ir.uitm.edu.my/id/eprint/44416/ https://ir.uitm.edu.my/id/eprint/44416/1/44416.pdf text en public degree Universiti Teknologi Mara Perlis Faculty of Computer & Mathematical Sciences
institution Universiti Teknologi MARA
collection UiTM Institutional Repository
language English
topic Urban transportation
Urban transportation
spellingShingle Urban transportation
Urban transportation
Noor Hamizan, Nur Ariena Farhana
Optimizing passenger before- boarding time using Queuing Theory and Dijkstra Algorithm / Nur Ariena Farhana Noor Hamizan
description The train is the best alternative public transport for Malaysians to use to avoid traffic jams. However, passengers are often delayed by the lengthy queuing time at the ticket counter during rush hours. To help reduce passenger travel time before boarding during rush hour, the current study aimed to minimize two items, namely counter service time for buying tickets and travel time from the ticket counter to the train platform. To achieve these objectives, Queuing Theory Problem and Shortest Path Problem (Dijkstra Algorithm) were applied. Based on the result, both objectives were successfully achieved. The minimum average counter service time was 0.88 minutes. Then, the shortest time from the ticket counter to the platform was 111 seconds. For both time frames, the minimum duration before buying tickets until arriving at the platform was 2.73 minutes. It is recommended that future research in this area compare between waiting time during rush hour and non-rush hour to identify the major problem that occurs during rush hour. This study can be further enhanced by expanding the use of the queuing theory to determine the number of optimal counters to operate at one time.
format Thesis
qualification_level Bachelor degree
author Noor Hamizan, Nur Ariena Farhana
author_facet Noor Hamizan, Nur Ariena Farhana
author_sort Noor Hamizan, Nur Ariena Farhana
title Optimizing passenger before- boarding time using Queuing Theory and Dijkstra Algorithm / Nur Ariena Farhana Noor Hamizan
title_short Optimizing passenger before- boarding time using Queuing Theory and Dijkstra Algorithm / Nur Ariena Farhana Noor Hamizan
title_full Optimizing passenger before- boarding time using Queuing Theory and Dijkstra Algorithm / Nur Ariena Farhana Noor Hamizan
title_fullStr Optimizing passenger before- boarding time using Queuing Theory and Dijkstra Algorithm / Nur Ariena Farhana Noor Hamizan
title_full_unstemmed Optimizing passenger before- boarding time using Queuing Theory and Dijkstra Algorithm / Nur Ariena Farhana Noor Hamizan
title_sort optimizing passenger before- boarding time using queuing theory and dijkstra algorithm / nur ariena farhana noor hamizan
granting_institution Universiti Teknologi Mara Perlis
granting_department Faculty of Computer & Mathematical Sciences
publishDate 2021
url https://ir.uitm.edu.my/id/eprint/44416/1/44416.pdf
_version_ 1783734718123999232