Publication Type
Journal Article
Version
acceptedVersion
Publication Date
7-2023
Abstract
Passenger satisfaction is extremely important for the success of a public transportation system. Many studies have shown that passenger satisfaction strongly depends on the time they have to wait at the bus stop (waiting time) to get on a bus. To be specific, user satisfaction drops faster as the waiting time increases. Therefore, service providers want to provide a bus to the waiting passengers within a threshold to keep them satisfied. It is a two-pronged problem: (a) to satisfy more passengers the transport planner may increase the frequency of the buses, and (b) in turn, the increased frequency may impact the service operational costs. To address it, we propose PASS and COST as the two variants that satisfy different optimization criteria mentioned above. The optimization goal of PASS is the number of satisfied passengers while the optimization goal of COST is the number of passengers served per unit of driving time. Consequently, PASS utilizes resources to the maximum to satisfy the highest number of passengers, while COST optimizes for both passenger satisfaction and operational costs. Accordingly, we propose two algorithms to solve PASS and COST respectively and evaluate their performance based on real passenger demand data-set.
Keywords
Optimisation, Public Transport, Scheduling, Bus Stop, COST, Data Driven Approach, Demand Constraints, Optimization Criteria, PASS, Passenger Satisfaction, Public Transportation System, Real Passenger Demand Dataset, Scheduling Bus Services, User Satisfaction, Waiting Passengers, Waiting Time, Costs, Schedules, Optimal Scheduling, Data Models, Search Problems, Genetic Algorithms, Time Frequency Analysis, Bus Schedule Optimization, Dynamic Bus Scheduling, Greedy Search, Operational Cost, Waiting Time Threshold
Discipline
Databases and Information Systems | Numerical Analysis and Scientific Computing | Transportation
Research Areas
Data Science and Engineering
Publication
IEEE Transactions on Knowledge and Data Engineering
Volume
35
Issue
7
First Page
6534
Last Page
6547
ISSN
1041-4347
Identifier
10.1109/TKDE.2022.3188243
Publisher
Institute of Electrical and Electronics Engineers
Citation
BRAHMANAGE JANAKA CHATHURANGA THILAKARATHNA; KANDAPPU, Thivya; and ZHENG, Baihua.
A data-driven approach for scheduling bus services subject to demand constraints. (2023). IEEE Transactions on Knowledge and Data Engineering. 35, (7), 6534-6547.
Available at: https://ink.library.smu.edu.sg/sis_research/7897
Copyright Owner and License
Authors
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1109/TKDE.2022.3188243
Included in
Databases and Information Systems Commons, Numerical Analysis and Scientific Computing Commons, Transportation Commons