{"id":"https://openalex.org/W2778714078","doi":"https://doi.org/10.1145/3139958.3140033","title":"Inferring the Parametric Weight of a Bicriteria Routing Model from Trajectories","display_name":"Inferring the Parametric Weight of a Bicriteria Routing Model from Trajectories","publication_year":2017,"publication_date":"2017-11-07","ids":{"openalex":"https://openalex.org/W2778714078","doi":"https://doi.org/10.1145/3139958.3140033","mag":"2778714078"},"language":"en","primary_location":{"id":"doi:10.1145/3139958.3140033","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3139958.3140033","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007427666","display_name":"Johannes Oehrlein","orcid":"https://orcid.org/0000-0003-0478-4298"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Johannes Oehrlein","raw_affiliation_strings":["University of Bonn"],"affiliations":[{"raw_affiliation_string":"University of Bonn","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034209052","display_name":"Benjamin Niedermann","orcid":"https://orcid.org/0000-0001-6638-7250"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Benjamin Niedermann","raw_affiliation_strings":["University of Bonn"],"affiliations":[{"raw_affiliation_string":"University of Bonn","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049298894","display_name":"Jan\u2010Henrik Haunert","orcid":"https://orcid.org/0000-0001-8005-943X"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jan-Henrik Haunert","raw_affiliation_strings":["University of Bonn"],"affiliations":[{"raw_affiliation_string":"University of Bonn","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5007427666"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":null,"apc_paid":null,"fwci":0.3698,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.60215276,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.9839000105857849,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6666262745857239},{"id":"https://openalex.org/keywords/global-positioning-system","display_name":"Global Positioning System","score":0.6291934251785278},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.5892889499664307},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5873986482620239},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5800284743309021},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5787697434425354},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5399868488311768},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5123873353004456},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4846940338611603},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.46019768714904785},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4564003050327301},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.44883060455322266},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40037381649017334},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33525350689888},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23030757904052734},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1766996681690216},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07704538106918335}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6666262745857239},{"id":"https://openalex.org/C60229501","wikidata":"https://www.wikidata.org/wiki/Q18822","display_name":"Global Positioning System","level":2,"score":0.6291934251785278},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.5892889499664307},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5873986482620239},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5800284743309021},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5787697434425354},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5399868488311768},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5123873353004456},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4846940338611603},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.46019768714904785},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4564003050327301},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.44883060455322266},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40037381649017334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33525350689888},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23030757904052734},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1766996681690216},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07704538106918335},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3139958.3140033","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3139958.3140033","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W96330011","https://openalex.org/W181973986","https://openalex.org/W578585133","https://openalex.org/W1561688952","https://openalex.org/W1870538541","https://openalex.org/W1979994878","https://openalex.org/W2011039300","https://openalex.org/W2031674781","https://openalex.org/W2033969525","https://openalex.org/W2076072499","https://openalex.org/W2076106676","https://openalex.org/W2082288635","https://openalex.org/W2085248615","https://openalex.org/W2126140499","https://openalex.org/W2139922600","https://openalex.org/W2262197264","https://openalex.org/W2404199818","https://openalex.org/W2563269705","https://openalex.org/W2573698050"],"related_works":["https://openalex.org/W4312143452","https://openalex.org/W2018691209","https://openalex.org/W4247364272","https://openalex.org/W3162200841","https://openalex.org/W3133151256","https://openalex.org/W2586280620","https://openalex.org/W2132920749","https://openalex.org/W2101108574","https://openalex.org/W2805505483","https://openalex.org/W2334071950"],"abstract_inverted_index":{"Finding":[0,52],"a":[1,8,11,53,60,84,89,102],"shortest":[2],"path":[3],"between":[4,56],"two":[5],"nodes":[6],"in":[7,16],"graph":[9],"is":[10,59,81],"well-studied":[12],"problem":[13],"whose":[14],"applicability":[15],"practice":[17],"crucially":[18],"relies":[19],"on":[20],"the":[21,24,30,36,96],"choice":[22],"of":[23,33,41,78,92,105],"applied":[25],"cost":[26,37],"function.":[27],"Especially,":[28],"for":[29,88],"key":[31],"application":[32],"vehicle":[34],"routing":[35],"function":[38],"may":[39],"consist":[40],"more":[42],"than":[43],"one":[44],"optimization":[45],"criterion":[46],"(e.g.,":[47],"distance,":[48],"travel":[49],"time,":[50],"etc.).":[51],"good":[54],"balance":[55,72,85],"these":[57],"criteria":[58],"challenging":[61],"and":[62],"essential":[63],"task.":[64],"We":[65],"present":[66],"an":[67],"approach":[68,80],"that":[69,71,95],"learns":[70],"from":[73],"existing":[74],"GPS-tracks.":[75],"The":[76],"core":[77],"our":[79],"to":[82,110],"find":[83],"factor":[86],"\u03b1":[87],"given":[90],"set":[91],"GPS-tracks":[93],"such":[94],"tracks":[97],"can":[98],"be":[99],"decomposed":[100],"into":[101],"minimum":[103],"number":[104],"optimal":[106],"paths":[107],"with":[108],"respect":[109],"\u03b1.":[111]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}