최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기韓國ITS學會 論文誌 = The journal of the Korea Institute of Intelligent Transportation Systems, v.17 no.3, 2018년, pp.72 - 86
전인우 (서울시립대학교 공간정보공학과) , 남현우 (서울시립대학교 공간정보공학과) , 전철민 (서울시립대학교 공간정보공학과)
Schedule-based public transit routing algorithm computes a single route that calculated minimum travel time using the departure and arrival times for each stop according to vehicle operation plan. However, additional factors such as transfer resistance and alternative route choice are not reflected ...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
Arbex R. O. and da Cunha C. B.(2015), "Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm," Transportation Research, vol. 81, pp.355-376.
Cionini A., D'Angelo G., D'Emidio M., Frigioni D., Giannakopoulou K., Paraskevopoulos A. and Zaroliagis C.(2014), "Engineering graph-based models for dynamic timetable information systems," In OASIcs-OpenAccess Series in Informatics, vol. 42, pp.46-61.
Delling D., Dibbelt J., Pajor T. and Werneck R. F.(2015), "Public transit labeling," In International Symposium on Experimental Algorithms, Springer, pp.273-285.
Delling D., Pajor T. and Werneck R. F.(2012), "Round-based public transit routing," Proceedings of the Meeting on Algorithm Engineering & Expermiments, Kyoto, Japan, pp.130-140.
Dibbelt J., Pajor T., Strasser B. and Wagner D.(2013), In International Symposium on Experimental Algorithms, Springer, pp.43-54.
Garcia-Martinez A., Cascajo R., Jara-Diaz S. R., Chowdhury S. and Monzon A.(2018), "Transfer penalties in multimodal public transport networks," Transportation Research Part A: Policy and Practice.
Guo J. and Jia L.(2017), "A new algorithm for finding the K shortest paths in a time-schedule network with constraints on arcs," Journal of Algorithms & Computational Technology, vol. 11, no. 2, pp.170-177.
Hu X. and Chiu Y. C.(2015), "A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation," International Journal of Transportation Science and Technology, vol. 4, no. 4, pp.371-394.
Kim E. C. and Kim T. H.(2009), "K-path Algorithm for a Transfer of the Mobility Handicapped," Seoul Studies, vol. 10, no. 2, pp.147-159.
Madkour A., Aref W. G., Rehman F. U., Rahman M. A. and Basalamah S.(2017), A survey of shortest-path algorithms. arXiv preprint arXiv:1705.02044.
Park B. H. and Oh S. J.(2001), "Effects of Transfer Penalty in the Public Transit Assignment," Social Economy & Policy Studies, vol. 17, no. 2, pp.65-92.
Park H. C., Kim Y. S., Kang S. P. and Ko S. Y.(2012), "A Study of Diffenrence Between Intramodal and Intermodal Transfer Penalties," Proceedings of the KOR-KST Conference, vol. 66, pp.555-560.
Pyrga E., Schulz F., Wagner D. and Zaroliagis C.(2008), "Efficient models for timetable information in public transportation systems," Journal of Experimental Algorithmics, vol. 12, pp.1-39.
Strasser B. and Wagner D.(2014), "Connection scan accelerated," In 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, pp.125-137.
Wang S., Yang Y., Hu X., Li J. and Xu B.(2016), "Solving the K-shortest paths problem in timetable-based public transportation systems," Journal of Intelligent Transportation Systems, vol. 20, no. 5, pp.413-427.
Witt S.(2015), "Trip-Based Public Transit Routing," In Algorithms-ESA 2015, Berlin, Heidelberg, Springer, pp.1025-1036.
Yang S. J.(2017), A study on Route Choice Modeling in Rapid Transit Network Considering Transfer Penalty and Angular Cost, Master thesis, Korea National University of Transportation, Seoul, Korea.
Yoo G. S.(2015), "Transfer penalty estimation with transit trips from smartcard data in Seoul, Korea," KSCE Journal of Civil Engineering, vol. 19, no. 4, pp.1108-1116.
Yoo H.(2017), A Study for Improving the Convenience of Transfer in Urban Railway : Cases of the Airport Railroad, Master thesis, Korea National University of Transportation, Seoul, Korea.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
출판사/학술단체 등이 한시적으로 특별한 프로모션 또는 일정기간 경과 후 접근을 허용하여, 출판사/학술단체 등의 사이트에서 이용 가능한 논문
※ AI-Helper는 부적절한 답변을 할 수 있습니다.