A Clustering-based Approach for Reorganizing Bus Route on Bus Rapid Transit System

Dinda Sabila Nadinta, I. Surjandari, Enrico Laoh
{"title":"A Clustering-based Approach for Reorganizing Bus Route on Bus Rapid Transit System","authors":"Dinda Sabila Nadinta, I. Surjandari, Enrico Laoh","doi":"10.1109/ICSSSM.2019.8887689","DOIUrl":null,"url":null,"abstract":"The passengers of transit-oriented public transportation have experienced growth. Reorganizing public transportation routes must be proposed in order to adapt to the increasing number of passengers. This research aims to reorganize bus routes by clustering bus stops on every route of transit-oriented public transportation route in order to meet the customer demand and suit the planned routes with the actual condition in its operation. Data sets for this research were provided by TransJakarta, a bus rapid transit (BRT) system in Jakarta, Indonesia. Using K-Means clustering algorithms, it is found that the optimal cluster is 15 clusters with several bus stops contained in it that adjusted and balanced with the number of passengers on each bus stops so that there is no inefficiency of utility or overcapacity. Elbow method is used to determine the optimal number of clusters in this research. This research can provide insight to transit-oriented public transportation in Indonesia by performing reorganizing bus routes with the new clusters of bus routes, it is expected to be able to meet the demands of each bus stops and load balancing can occur on every bus route that leads to increase the customer satisfaction and the number of public transportation users continues to increase.","PeriodicalId":442421,"journal":{"name":"2019 16th International Conference on Service Systems and Service Management (ICSSSM)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 16th International Conference on Service Systems and Service Management (ICSSSM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSSSM.2019.8887689","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The passengers of transit-oriented public transportation have experienced growth. Reorganizing public transportation routes must be proposed in order to adapt to the increasing number of passengers. This research aims to reorganize bus routes by clustering bus stops on every route of transit-oriented public transportation route in order to meet the customer demand and suit the planned routes with the actual condition in its operation. Data sets for this research were provided by TransJakarta, a bus rapid transit (BRT) system in Jakarta, Indonesia. Using K-Means clustering algorithms, it is found that the optimal cluster is 15 clusters with several bus stops contained in it that adjusted and balanced with the number of passengers on each bus stops so that there is no inefficiency of utility or overcapacity. Elbow method is used to determine the optimal number of clusters in this research. This research can provide insight to transit-oriented public transportation in Indonesia by performing reorganizing bus routes with the new clusters of bus routes, it is expected to be able to meet the demands of each bus stops and load balancing can occur on every bus route that leads to increase the customer satisfaction and the number of public transportation users continues to increase.
基于聚类的快速公交线路重组方法
以公共交通为导向的公共交通乘客数量有所增长。必须提出重组公共交通路线,以适应不断增加的乘客数量。本研究的目的是通过在公交导向的公共交通路线的每条路线上聚集公交站点来重组公交路线,以满足顾客的需求,使规划的路线与实际运行情况相适应。本研究的数据集由印度尼西亚雅加达的快速公交(BRT)系统TransJakarta提供。使用K-Means聚类算法,发现最优聚类是包含若干公交站点的15个聚类,这些聚类根据每个公交站点的乘客数量进行调整和平衡,从而不存在效用低效率和产能过剩问题。本研究采用肘部法确定最优聚类数。本研究可以通过对新的公交线路集群进行公交线路重组,为印尼公交导向的公共交通提供见解,预计能够满足每个公交站点的需求,并在每条公交线路上实现负载平衡,从而提高客户满意度,公共交通用户数量不断增加。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信