Computational Technology Resources - CCP

Keywords: smart card, k-shortest path algorithm, Seoul, transit assignment.

Summary

Most research on public transportation trip paths has been based on assumptions and theoretical paths instead of real ones because of the lack of real survey data. However, Korea has very elaborate transit trip data, and smart card records. Real passenger paths can be found by using smart card data.

Multi-modal public transportation usage analysis, including transfer usage, is essential for simulating public transportation passenger behaviour, which should be conducted using paths as well. This work described in this paper shows alternative paths in a complex networkby assigning transit trips using a stochastic method and the Seoul Metropolitan Area smart card record. Transfer restrictions and loop restrictions were added to the algorithm based on Santos [1].

The algorithm suggested in this paper to find the k-shortest path consists of two major steps. First, by the generation of the shortest path tree by solving the shortest path problem with a multi-source and a single destination, and then to determine the k-shortest paths based on the shortest path tree. In step 1, the shortest path problem can be solved using multi-source and a single destination by formulating the problem as a linear program, and then solving the problem by using a commercial optimization solver CPLEX 12.1. Step 2 is to find the k- where the shortest paths are under conditions where the loop is not allowed, and the number of transfers can be four at most.

The suggested algorithm in this paper is appropriate for large scale transit complex networks since the algorithm gives reasonable alternative paths in a short amount of computation time, and reflects the realistic characteristics of public transportation with a loopless path and a number of rational transfers.

References

1: J.L. Santos, "k-Shortest Path Algorithms", Universidade de Coimbra, Preprint Number 07-07, 2007.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £110 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 98 PROCEEDINGS OF THE FIRST INTERNATIONAL CONFERENCE ON RAILWAY TECHNOLOGY: RESEARCH, DEVELOPMENT AND MAINTENANCE Edited by: J. Pombo Paper 181 Finding a Real Passenger Path in a Complex Transit Network Using a Smart Card Record J. Min, J. Park, S. Oh and M. Sohn Green Transportation & Logistics Institute, Korea Railroad Research Institute, Uiwang, Korea doi:10.4203/ccp.98.181 purchase the full-text of this paper Full Bibliographic Reference for this paper J. Min, J. Park, S. Oh, M. Sohn, "Finding a Real Passenger Path in a Complex Transit Network Using a Smart Card Record", in J. Pombo, (Editor), "Proceedings of the First International Conference on Railway Technology: Research, Development and Maintenance", Civil-Comp Press, Stirlingshire, UK, Paper 181, 2012. doi:10.4203/ccp.98.181 Keywords: smart card, k-shortest path algorithm, Seoul, transit assignment. Summary Most research on public transportation trip paths has been based on assumptions and theoretical paths instead of real ones because of the lack of real survey data. However, Korea has very elaborate transit trip data, and smart card records. Real passenger paths can be found by using smart card data. Multi-modal public transportation usage analysis, including transfer usage, is essential for simulating public transportation passenger behaviour, which should be conducted using paths as well. This work described in this paper shows alternative paths in a complex networkby assigning transit trips using a stochastic method and the Seoul Metropolitan Area smart card record. Transfer restrictions and loop restrictions were added to the algorithm based on Santos [1]. The algorithm suggested in this paper to find the k-shortest path consists of two major steps. First, by the generation of the shortest path tree by solving the shortest path problem with a multi-source and a single destination, and then to determine the k-shortest paths based on the shortest path tree. In step 1, the shortest path problem can be solved using multi-source and a single destination by formulating the problem as a linear program, and then solving the problem by using a commercial optimization solver CPLEX 12.1. Step 2 is to find the k- where the shortest paths are under conditions where the loop is not allowed, and the number of transfers can be four at most. The suggested algorithm in this paper is appropriate for large scale transit complex networks since the algorithm gives reasonable alternative paths in a short amount of computation time, and reflects the realistic characteristics of public transportation with a loopless path and a number of rational transfers. References 1 J.L. Santos, "k-Shortest Path Algorithms", Universidade de Coimbra, Preprint Number 07-07, 2007. purchase the full-text of this paper (price £20) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £110 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions