{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:22:36Z","timestamp":1761805356652,"version":"build-2065373602"},"reference-count":20,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2017,8,26]],"date-time":"2017-08-26T00:00:00Z","timestamp":1503705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Swiss National Science Foundation","doi-asserted-by":"publisher","award":["200021_159234"],"award-info":[{"award-number":["200021_159234"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>For the simulation of public transport, next to a schedule, knowledge of the public transport routes is required. While the schedules are becoming available, the precise network routes often remain unknown and must be reconstructed. For large-scale networks, however, a manual reconstruction becomes unfeasible. This paper presents a route reconstruction algorithm, which requires only the sequence and positions of the public transport stops and the street network. It uses an abstract graph to calculate the least-cost path from a route\u2019s first to its last stop, with the constraint that the path must contain a so-called link candidate for every stop of the route\u2019s stop sequence. The proposed algorithm is implemented explicitly for large-scale, real life networks. The algorithm is able to handle multiple lines and modes, to combine them at the same stop location (e.g., train and bus lines coming together at a train station), to automatically reconstruct missing links in the network, and to provide intelligent and efficient feedback if apparent errors occur. GPS or OSM tracks of the lines can be used to improve results, if available. The open-source algorithm has been tested for Zurich for mapping accuracy. In summary, the new algorithm and its MATSim-based implementation is a powerful, tested tool to reconstruct public transport network routes for large-scale systems.<\/jats:p>","DOI":"10.3390\/ijgi6090268","type":"journal-article","created":{"date-parts":[[2017,8,28]],"date-time":"2017-08-28T12:08:37Z","timestamp":1503922117000},"page":"268","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Public Transit Route Mapping for Large-Scale Multimodal Networks"],"prefix":"10.3390","volume":"6","author":[{"given":"Flavio","family":"Poletti","sequence":"first","affiliation":[{"name":"TEAMverkehr.zug AG, 6330 Cham, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5506-0682","authenticated-orcid":false,"given":"Patrick","family":"B\u00f6sch","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Verkehrsplanung und Transportsysteme (IVT), ETH Zurich, 8093 Zurich, Switzerland"}]},{"given":"Francesco","family":"Ciari","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Verkehrsplanung und Transportsysteme (IVT), ETH Zurich, 8093 Zurich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3331-1318","authenticated-orcid":false,"given":"Kay","family":"Axhausen","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Verkehrsplanung und Transportsysteme (IVT), ETH Zurich, 8093 Zurich, Switzerland"}]}],"member":"1968","published-online":{"date-parts":[[2017,8,26]]},"reference":[{"key":"ref_1","unstructured":"Menendez, M., Ortigosa, J., Amb\u00fchl, L., Axhausen, K.W., Ciari, F., B\u00f6sch, P., Geroliminis, N., and Zheng, N. (2016). NetCap: Intermodale Strecken-\/Linien- und Netzleistungsf\u00e4higkeit, Schlussbericht SVI 2004\/032, IVT ETH Z\u00fcrich und LUTS EPF Lausanne. Schriftenreihe 1563."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Loder, A., Amb\u00fchl, L., Menendez, M., and Axhausen, K.W. (2016). Empirics of Multimodal Traffic Networks\u2014Using the 3D Macroscopic Fundamental Diagram, IVT, ETH Zurich. Arbeitsberichte Verkehrs- und Raumplanung 1225.","DOI":"10.1016\/j.trc.2017.06.009"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.trc.2014.03.004","article-title":"A three-dimensional macroscopic fundamental diagram for mixed bi-modal urban networks","volume":"42","author":"Geroliminis","year":"2014","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.trb.2015.10.008","article-title":"Modeling and optimization of multimodal urban networks with limited parking and dynamic pricing","volume":"83","author":"Zheng","year":"2016","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_5","unstructured":"HaCon (2016, October 26). Hafas. Available online: http:\/\/www.hacon.de\/hafas\/."},{"key":"ref_6","unstructured":"Google (2016, October 26). What is GTFS?. Available online: https:\/\/developers.google.com\/transit\/gtfs\/."},{"key":"ref_7","unstructured":"Transitland (2016, October 26). Feed Registry. Available online: https:\/\/transit.land\/feed-registry\/."},{"key":"ref_8","unstructured":"Open Street Map (2016, October 26). The Free Wiki World Map. Available online: https:\/\/www.openstreetmap.org\/."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.trc.2007.05.002","article-title":"Current map-matching algorithms for transport applications: State-of-the art and future research directions","volume":"15","author":"Quddus","year":"2007","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"62","DOI":"10.3141\/2537-07","article-title":"Map-Matching Algorithm for Applications in Multimodal Transportation Network Modeling","volume":"2537","author":"Perrine","year":"2015","journal-title":"Transp. Res. Rec."},{"key":"ref_11","unstructured":"B\u00f6sch, P.M., and Ciari, F. (2015, January 15\u201317). A multi-modal network for MATSim. Proceedings of the 15th Swiss Transport Research Conference, Ascona, Switzerland."},{"key":"ref_12","unstructured":"Ordonez, S., and Erath, A. (2011). Semi-Automatic Tool for Map-Matching Bus Routes on High-Resolution Navigation Networks, Institut f\u00fcr Verkehrsplanung und Transportsysteme, Eidgen\u00f6ssische Technische Hochschule Z\u00fcrich. Technical Report."},{"key":"ref_13","unstructured":"Brosi, P. (2014). Real-Time Movement Visualization of Public Transit Data. [Master\u2019s Thesis, University of Freiburg]."},{"key":"ref_14","unstructured":"Geops (2016, October 26). Mapping Public Transit Networks, 2014. Available online: http:\/\/geops.de\/blog\/mapping-public-transit-networks?language=en."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.trc.2012.01.002","article-title":"Match bus stops to a digital road network by the shortest path model","volume":"22","author":"Li","year":"2012","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_16","unstructured":"MATSim Project (2016, October 14). PT2MATSim. Available online: https:\/\/github.com\/matsim-org\/pt2matsim."},{"key":"ref_17","unstructured":"Horni, A., Nagel, K., and Axhausen, K.W. (2016). The Multi-Agent Transportation Simulation MATSim, Ubiquity."},{"key":"ref_18","unstructured":"Poletti, F. (2016). Public Transit Mapping on Multi-Modal Networks in MATSim. [Master Thesis, IVT, ETH Zurich]."},{"key":"ref_19","unstructured":"SBB (2016, October 26). Offizielles Kursbuch: Fahrplandaten\u2014Download der \u00f6ffentlichen Fahrplansammlung der Schweiz. Available online: http:\/\/www.fahrplanfelder.ch\/de\/fahrplandaten.html."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1109\/34.232073","article-title":"Comparing images using the Hausdorff distance","volume":"15","author":"Huttenlocher","year":"1993","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/6\/9\/268\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:43:22Z","timestamp":1760208202000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/6\/9\/268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,26]]},"references-count":20,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2017,9]]}},"alternative-id":["ijgi6090268"],"URL":"https:\/\/doi.org\/10.3390\/ijgi6090268","relation":{},"ISSN":["2220-9964"],"issn-type":[{"type":"electronic","value":"2220-9964"}],"subject":[],"published":{"date-parts":[[2017,8,26]]}}}