Estimasi Tujuan Penumpang Menggunakan Predictive Model dengan Data Smart Card
Abstract
Bus Rapid Transit (BRT) is one of the main choices of public transportation that supports mobility of Jakarta community. As one of the main choices of public transportation, BRT should provide good service and always improve its performance. Needs for moving or mobility will cause a problem if the moving itself is heading at the same area and at the same time. That will cause some problems which are often faced in urban areas such as traffic and delay. To overcome those problems there needs to be a strategy to build good public transportation planning, besides need to know individual travel patterns to overcome problems and improve BRT service. In case to realize those plans needs to be built origin-destination (O-D) matrix. O-D matrix is a matrix that each cell is an amount of trip from the source(row) to the destination (column). O-D matrix is beneficial for analysis, design and public transportation management. O-D matrix also provides useful information like amount of trip between 2 different locations, that can be utilized as fundamental information for decision making for three levels of strategic management (long term planning), tactic (service adjustment and network development), and operational (scheduling, passenger statistic, and performance indicator). To build O-D matrix is required a predictive model that can be measured to predict passenger destination. The predictive model will be build using classification algorithms such as Decision Tree and K-Nearest Neighbor (KNN).
Downloads
References
T. Wen, C. Cai, L. Gardner, S. T. Waller, V. Dixit, and F. Chen, “Estimation of sparse O–D matrix accounting for demand volatility,” IET Intell. Transp. Syst., 2018.
C. Sun, L. Cheng, X. Luan, Q. Tu, and J. Ma, “Subnetwork origin-destination matrix estimation considering network topology,” Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal Southeast Univ. (Natural Sci. Ed., 2017.
M. Bagchi and P. R. White, “What role for smart-card data from bus systems?,” Proc.Inst. Civ. Eng. - Munic. Eng., 2009.
W. Wang, J. Attanucci, and N. Wilson, “Bus Passenger Origin-Destination Estimation and Related Analyses Using Automated Data Collection Systems,” J. Public Transp., 2015.
S. Tao, J. Corcoran, I. Mateo-Babiano, and D. Rohde, “Exploring Bus Rapid Transit passenger travel behaviour using big data,” Appl. Geogr., 2014.
T. Li, D. Sun, P. Jing, and K. Yang, “Smart card data mining of public transport destination: A literature review,” Information (Switzerland). 2018.
O. J. Ibarra-Rojas, F. Delgado, R. Giesen, and J. C. Muñoz, “Planning, operation, and control of bus transport systems: A literature review,” Transportation Research Part B: Methodological. 2015.
Widyawan, B. Prakasa, D. W. Putra, S. S. Kusumawardani, B. T. Y. Widhiyanto, and F. Habibie, “Big data analytic for estimation of origin-destination matrix in Bus Rapid Transit system,” in Proceeding - 2017 3rd International Conference on Science and Technology-Computer, ICST 2017, 2017.
J. J. Barry, R. Newhouser, A. Rahbee, and S. Sayeda, “Origin and Destination Estimation in New York City with Automated Fare System Data,” Transp. Res. Rec. J. Transp. Res. Board, 2007.
J. Zhao, A. Rahbee, and N. H. M. Wilson, “Estimating a rail passenger trip origin-
destination matrix using automatic data collection systems,” Comput. Civ. Infrastruct. Eng., 2007.
C. Manasseh and R. Sengupta, “Predicting driver destination using machine learning
techniques,” in IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC, 2013.
L. H. Tran, M. Catasta, L. K. McDowell, and K. Aberer, “Next Place Prediction using Mobile Data,” Proc. Mob. Data Chall. Work. (MDC 2012), 2012.
A. Lo Duca, C. Bacciu, and A. Marchetti, “A K-nearest neighbor classifier for ship
route prediction,” in OCEANS 2017 - Aberdeen, 2017.
V. Roşca, E. Onica, P. Diac, and C. Amariei, “Predicting Destinations by Nearest Neighbor Search on Training Vessel Routes,” 2018.
U. Al-Faruqi, “Survey Paper : Future Service in Industry 5 . 0,” vol. 02, no. 01, pp. 67–79, 2019.