{"id":"https://openalex.org/W2944879678","doi":"https://doi.org/10.1016/j.procs.2019.04.054","title":"Path complexity for observed and predicted bicyclist routes","display_name":"Path complexity for observed and predicted bicyclist routes","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2944879678","doi":"https://doi.org/10.1016/j.procs.2019.04.054","mag":"2944879678"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2019.04.054","doi":"https://doi.org/10.1016/j.procs.2019.04.054","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2019.04.054","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1877050919305162/pdf","source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"volume":null,"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.sciencedirect.com/science/article/pii/S1877050919305162/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Thomas Koch","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Thomas Koch","raw_affiliation_strings":["Centrum Wiskunde en Informatica, Science Park 123, 1098XG Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centrum Wiskunde en Informatica, Science Park 123, 1098XG Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059585972","display_name":"Luk Knapen","orcid":"https://orcid.org/0000-0002-5156-0206","observed_orcids":["https://orcid.org/0000-0002-5156-0206"]},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]},{"id":"https://openalex.org/I878454856","display_name":"Hasselt University","ror":"https://ror.org/04nbhqj75","country_code":"BE","type":"education","lineage":["https://openalex.org/I878454856"]}],"countries":["BE","NL"],"is_corresponding":false,"raw_author_name":"Luk Knapen","raw_affiliation_strings":["Universiteit Hasselt, Agoralaan building D, 3590 Diepenbeek, Belgium","Vrije Universiteit, De Boelelaan 1085, 1081 HV Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universiteit Hasselt, Agoralaan building D, 3590 Diepenbeek, Belgium","institution_ids":["https://openalex.org/I878454856"]},{"raw_affiliation_string":"Vrije Universiteit, De Boelelaan 1085, 1081 HV Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050654045","display_name":"Elenna R Dugundji","orcid":"https://orcid.org/0000-0001-9277-9485","observed_orcids":["https://orcid.org/0000-0001-9277-9485"]},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Elenna Dugundji","raw_affiliation_strings":["Centrum Wiskunde en Informatica, Science Park 123, 1098XG Amsterdam, The Netherlands","Vrije Universiteit, De Boelelaan 1085, 1081 HV Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centrum Wiskunde en Informatica, Science Park 123, 1098XG Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"Vrije Universiteit, De Boelelaan 1085, 1081 HV Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1341640284"],"apc_list":null,"apc_paid":null,"fwci":1.199,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.74979424,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":"151","issue":null,"first_page":"393","last_page":"400"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10298","display_name":"Urban Transport and Accessibility","score":0.5640000104904175,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10298","display_name":"Urban Transport and Accessibility","score":0.5640000104904175,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.4124000072479248,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10370","display_name":"Traffic and Road Safety","score":0.004900000058114529,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/route-complexity","display_name":"route complexity","score":0.8999999761581421},{"id":"https://openalex.org/keywords/cycling-routes","display_name":"cycling routes","score":0.3880000114440918},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.6039999723434448},{"id":"https://openalex.org/keywords/choice-set-generation","display_name":"choice set generation","score":0.5979999899864197},{"id":"https://openalex.org/keywords/cycling-infrastructure","display_name":"cycling infrastructure","score":0.5120000243186951}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7972477674484253},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6426149606704712},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5504950284957886},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5330713391304016},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5300942063331604},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.47650113701820374},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46950316429138184},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45423808693885803},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28931403160095215},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15876713395118713},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1016/j.procs.2019.04.054","doi":"https://doi.org/10.1016/j.procs.2019.04.054","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2019.04.054","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1877050919305162/pdf","source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:cwi.nl:28863","doi":null,"is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/28863","pdf_url":"https://ir.cwi.nl/pub/28863/28863.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:cwi:oai:cwi.nl:28863","doi":null,"is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/28863","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:oai:documentserver.uhasselt.be:1942/28310","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/1942/28310","pdf_url":null,"source":{"id":"https://openalex.org/S4306401926","display_name":"Document Server@UHasselt (UHasselt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I878454856","host_organization_name":"Hasselt University","host_organization_lineage":["https://openalex.org/I878454856"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:research.vu.nl:openaire/1a864de2-976a-4992-b0ae-b7a452376cc9","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/1871.1/1a864de2-976a-4992-b0ae-b7a452376cc9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Koch, T, Knapen, L & Dugundji, E 2019, 'Path complexity for observed and predicted bicyclist routes', Procedia Computer Science, vol. 151, pp. 393-400. https://doi.org/10.1016/j.procs.2019.04.054","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:vu:oai:research.vu.nl:publications/1a864de2-976a-4992-b0ae-b7a452376cc9","doi":null,"is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/1a864de2-976a-4992-b0ae-b7a452376cc9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Procedia Computer Science, 151, 393 - 400. Elsevier BV","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/j.procs.2019.04.054","doi":"https://doi.org/10.1016/j.procs.2019.04.054","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2019.04.054","pdf_url":"https://www.sciencedirect.com/science/article/pii/S1877050919305162/pdf","source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7250000238418579},{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.5378999710083008}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2944879678.pdf","grobid_xml":"https://content.openalex.org/works/W2944879678.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W622567339","https://openalex.org/W1980702385","https://openalex.org/W2014000398","https://openalex.org/W2022106248","https://openalex.org/W2096424131","https://openalex.org/W2167889269","https://openalex.org/W2168251117","https://openalex.org/W2382908343","https://openalex.org/W7028118260"],"related_works":["https://openalex.org/W7038657405","https://openalex.org/W2996383054","https://openalex.org/W2766147025","https://openalex.org/W2945710435","https://openalex.org/W2116654669","https://openalex.org/W622567339","https://openalex.org/W618789712","https://openalex.org/W2334539932","https://openalex.org/W4392059569","https://openalex.org/W7081571929"],"abstract_inverted_index":{"Everyday":[0],"route":[1,40,90],"choices":[2,21],"made":[3],"by":[4,164],"bicyclists":[5],"are":[6],"known":[7],"to":[8,12,74,86,138,161],"be":[9,87],"more":[10],"difficult":[11],"explain":[13],"than":[14],"vehicle":[15],"routes,":[16],"yet":[17],"prediction":[18],"of":[19,39,57,68,99,104,118],"these":[20],"is":[22,64,72,79,84],"essential":[23],"for":[24,89,114,122,129],"guiding":[25],"infrastructural":[26],"investment":[27],"in":[28,50,61,92,124],"safe":[29],"cycling.":[30],"In":[31],"this":[32],"paper":[33,153],"we":[34],"study":[35],"how":[36,156],"the":[37,51,65,97,102,125,130,143,149,157],"concept":[38],"complexity":[41,56,111],"can":[42],"help":[43],"generate":[44],"and":[45,108,121,170],"analyze":[46],"plausible":[47],"choice":[48,91,127,144],"sets":[49,128,145],"demand":[52],"modeling":[53],"process.":[54],"The":[55,110,134],"a":[58,62,80,93,115],"given":[59],"path":[60,81],"graph":[63],"minimum":[66],"number":[67,98,103],"shortest":[69],"paths":[70],"that":[71,76,142],"required":[73],"specify":[75],"path.":[77],"Complexity":[78],"attribute":[82],"which":[83],"considered":[85],"important":[88],"similar":[94],"way":[95],"as":[96],"left":[100],"turns,":[101],"speed":[105],"bumps,":[106],"distance":[107],"other.":[109],"was":[112],"determined":[113],"large":[116],"set":[117],"observed":[119,158],"routes":[120,123,159,162],"generated":[126,163],"corresponding":[131],"origin-destination":[132],"pairs.":[133],"respective":[135],"distributions":[136],"seem":[137],"significantly":[139],"differ":[140],"so":[141],"do":[146],"not":[147],"reflect":[148],"traveler":[150],"preferences.":[151],"This":[152],"looks":[154],"at":[155],"compare":[160],"Breadth":[165],"First":[166],"Search":[167],"Link":[168],"Elimination":[169],"Double":[171],"Stochastic":[172],"Generation":[173],"Function":[174],"method.":[175]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2019-05-29T00:00:00"}