{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:12:14Z","timestamp":1740136334891,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,12,21]],"date-time":"2019-12-21T00:00:00Z","timestamp":1576886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,12,21]],"date-time":"2019-12-21T00:00:00Z","timestamp":1576886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"\u2019Stochastics - Theoretical and Applied Research\u2019 (STAR) in the Netherlands.","award":["0"],"award-info":[{"award-number":["0"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pers Ubiquit Comput"],"published-print":{"date-parts":[[2021,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Everyday route choices made by bicyclists are known to be more difficult to explain than vehicle routes, yet prediction of these choices is essential for guiding infrastructural investment in safe cycling. Building route choice sets is a difficult task. Even including detailed attributes such as the number of left turns, the number of speed bumps, distance and other route choice properties we still see that choice set quality measures suggest poor replication of observed paths. In this paper we study how the concept of <jats:italic>route complexity<\/jats:italic> can help generate and analyze plausible choice sets in the demand modeling process. The complexity of a given path in a graph is the minimum number of shortest paths that is required to specify that path. <jats:italic>Complexity<\/jats:italic> is a path attribute which could potentially be considered to be important for route choice in a similar way. The complexity was determined for a large set of observed routes and for routes in the generated choice sets for the corresponding origin-destination pairs. The respective distributions are shown to be significantly different so that the choice sets do not reflect the traveler preferences, this is in line with classical choice set quality indicators. Secondly, we investigate often used choice set quality methods and formulate measures that are less sensitive to small differences between routes that can be argued to be insignificant or irrelevant. Such difference may be partially due to inaccuracy in map-matching observations to dense urban road networks.<\/jats:p>","DOI":"10.1007\/s00779-019-01350-w","type":"journal-article","created":{"date-parts":[[2019,12,21]],"date-time":"2019-12-21T08:03:22Z","timestamp":1576915402000},"page":"63-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Path complexity and bicyclist route choice set quality assessment"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2858-7010","authenticated-orcid":false,"given":"Thomas","family":"Koch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luk","family":"Knapen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elenna","family":"Dugundji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,21]]},"reference":[{"key":"1350_CR1","unstructured":"Bikeprint: Download bestanden Nationale Fietstelweek 2015 en 2016 (2017). http:\/\/www.bikeprint.nl\/fietstelweek\/"},{"issue":"3","key":"1350_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1080\/18128600708685672","volume":"3","author":"PH Bovy","year":"2007","unstructured":"Bovy PH, Fiorenzo-Catalano S (2007) Stochastic route choice set generation: behavioral and probabilistic foundations. Transportmetrica 3(3):173\u2013189","journal-title":"Transportmetrica"},{"key":"1350_CR3","unstructured":"ETH-Zurich: Position data processing (2012). https:\/\/sourceforge.net\/projects\/posdap\/"},{"key":"1350_CR4","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.trb.2013.07.012","volume":"56","author":"M Fosgerau","year":"2013","unstructured":"Fosgerau M, Frejinger E, Karlstrom A (2013) A link based network route choice model with unrestricted choice set. Transp Res B 56:70\u201380. https:\/\/doi.org\/10.1016\/j.trb.2013.07.012","journal-title":"Transp Res B"},{"issue":"4","key":"1350_CR5","first-page":"332","volume":"14","author":"K Halld\u00f3rsd\u00f3ttir","year":"2014","unstructured":"Halld\u00f3rsd\u00f3ttir K, Rieser-Sch\u00fcssler N, Axhausen KW, Nielsen OA, Prato C (2014) Efficiency of choice set generation techniques for bicycle routes. European Journal of Transport and Infrastructure Research 14 (4):332\u2013348","journal-title":"European Journal of Transport and Infrastructure Research"},{"issue":"1","key":"1350_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.3328\/TL.2011.03.01.63-75","volume":"3","author":"J Hood","year":"2011","unstructured":"Hood J, Sall E, Charlton B (2011) A gps-based bicycle route choice model for San Francisco, California. Transportation Letters 3(1):63\u201375","journal-title":"Transportation Letters"},{"key":"1350_CR7","doi-asserted-by":"publisher","unstructured":"Knapen L, Hartman IBA, Bellemans T (2017) Using path decomposition enumeration to enhance route choice models. Future Generation Computer Systems pp. \u2013. https:\/\/doi.org\/10.1016\/j.future.2017.12.053. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167739X17321866","DOI":"10.1016\/j.future.2017.12.053"},{"key":"1350_CR8","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.trb.2016.04.019","volume":"90","author":"L Knapen","year":"2016","unstructured":"Knapen L, Hartman IBA, Schulz D, Bellemans T, Janssens D, Wets G (2016) Determining structural route components from gps traces. Transp Res B Methodol 90:156\u2013171","journal-title":"Transp Res B Methodol"},{"issue":"Supplement C","key":"1350_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.trb.2015.03.015","volume":"75","author":"T Mai","year":"2015","unstructured":"Mai T, Fosgerau M, Frejinger E (2015) A nested recursive logit model for route choice analysis. Transportation Research Part B: Methodological 75(Supplement C):100\u2013112. https:\/\/doi.org\/10.1016\/j.trb.2015.03.015. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0191261515000582","journal-title":"Transportation Research Part B: Methodological"},{"issue":"5","key":"1350_CR10","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0191-2615(99)00029-6","volume":"34","author":"OA Nielsen","year":"2000","unstructured":"Nielsen OA (2000) A stochastic transit assignment model considering differences in passengers utility functions. Transp Res B Methodol 34(5):377\u2013402","journal-title":"Transp Res B Methodol"},{"key":"1350_CR11","doi-asserted-by":"crossref","unstructured":"Prato C, Bekhor S (2006) Applying branch-and-bound technique to route choice set generation. Transportation Research Record: Journal of the Transportation Research Board (1985):19\u2013 28","DOI":"10.1177\/0361198106198500103"},{"key":"1350_CR12","doi-asserted-by":"crossref","unstructured":"Prato C, Bekhor S (2007) Modeling route choice behavior: How relevant is the composition of choice set?. Transportation Research Record: Journal of the Transportation Research Board (2003):64\u201373","DOI":"10.3141\/2003-09"},{"issue":"9","key":"1350_CR13","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1080\/18128602.2012.671383","volume":"9","author":"N Rieser-Sch\u00fcssler","year":"2013","unstructured":"Rieser-Sch\u00fcssler N, Balmer M, Axhausen KW (2013) Route choice sets for very high-resolution data. Transportmetrica A: Transport Science 9(9):825\u2013845","journal-title":"Transportmetrica A: Transport Science"},{"key":"1350_CR14","unstructured":"Wardenier N, Knapen L, Koch T, Dugundji E (2019) Improving bicycle route choice set generation using route complexity in GPS traces. In: TRB 2019 Annual Meeting. Transportation Research Board, Washington, D.C."}],"container-title":["Personal and Ubiquitous Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00779-019-01350-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00779-019-01350-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00779-019-01350-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,25]],"date-time":"2021-03-25T23:32:26Z","timestamp":1616715146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00779-019-01350-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,21]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["1350"],"URL":"https:\/\/doi.org\/10.1007\/s00779-019-01350-w","relation":{},"ISSN":["1617-4909","1617-4917"],"issn-type":[{"type":"print","value":"1617-4909"},{"type":"electronic","value":"1617-4917"}],"subject":[],"published":{"date-parts":[[2019,12,21]]},"assertion":[{"value":"21 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}]}}