{"id":"https://openalex.org/W2032158203","doi":"https://doi.org/10.1145/2567688.2567691","title":"Efficient and Effective Route Planning in Road Networks with Probabilistic Data using Skyline Paths","display_name":"Efficient and Effective Route Planning in Road Networks with Probabilistic Data using Skyline Paths","publication_year":2014,"publication_date":"2014-03-21","ids":{"openalex":"https://openalex.org/W2032158203","doi":"https://doi.org/10.1145/2567688.2567691","mag":"2032158203"},"language":"en","primary_location":{"id":"doi:10.1145/2567688.2567691","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2567688.2567691","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st IKDD Conference on Data Sciences","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/A5050352955","display_name":"Arzoo Katiyar","orcid":null},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Arzoo Katiyar","raw_affiliation_strings":["Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103014125","display_name":"Arnab Bhattacharya","orcid":"https://orcid.org/0000-0001-7331-0788"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Arnab Bhattacharya","raw_affiliation_strings":["Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045840846","display_name":"Shubhadip Mitra","orcid":null},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Shubhadip Mitra","raw_affiliation_strings":["Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050352955"],"corresponding_institution_ids":["https://openalex.org/I94234084"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.1028297,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"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":1.0,"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.9891999959945679,"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.9797000288963318,"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/skyline","display_name":"Skyline","score":0.8438026905059814},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6970072388648987},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6873650550842285},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5955864787101746},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5508272647857666},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5480709671974182},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5445168614387512},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5319117903709412},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.47749894857406616},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.471052885055542},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4459786117076874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35846492648124695},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22526824474334717},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.21311619877815247},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20039182901382446},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10140529274940491},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10101419687271118},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07960182428359985}],"concepts":[{"id":"https://openalex.org/C2780757406","wikidata":"https://www.wikidata.org/wiki/Q465837","display_name":"Skyline","level":2,"score":0.8438026905059814},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6970072388648987},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6873650550842285},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5955864787101746},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5508272647857666},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5480709671974182},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5445168614387512},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5319117903709412},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.47749894857406616},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.471052885055542},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4459786117076874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35846492648124695},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22526824474334717},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.21311619877815247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20039182901382446},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10140529274940491},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10101419687271118},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07960182428359985},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2567688.2567691","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2567688.2567691","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1st IKDD Conference on Data Sciences","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7900000214576721,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1549128498","https://openalex.org/W1829285201","https://openalex.org/W1968282315","https://openalex.org/W2025741632","https://openalex.org/W2112821905","https://openalex.org/W2126455549","https://openalex.org/W2134644026","https://openalex.org/W2165137405","https://openalex.org/W2170188482","https://openalex.org/W2221612594"],"related_works":["https://openalex.org/W2383519316","https://openalex.org/W3088868185","https://openalex.org/W2377950158","https://openalex.org/W4385575076","https://openalex.org/W4310271105","https://openalex.org/W2356287045","https://openalex.org/W2367364991","https://openalex.org/W2350354796","https://openalex.org/W2357176080","https://openalex.org/W2531277291"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,83,202],"study":[4],"the":[5,22,30,33,49,61,67,73,77,85,95,104,117,121,126,130,133,141,147,157,171,176,209,216,227,247,250,256,265,270,276],"problem":[6,54,78],"of":[7,17,40,69,102,112,136,144,175,180,272,283],"effective":[8],"route":[9,52],"search":[10],"in":[11,42,152,189],"road":[12,192,251],"networks.":[13],"Given":[14],"a":[15,27,43,80,109,190,204,219,224,242],"pair":[16],"source":[18,31,131,158,217],"and":[19,65,88,138,159,173],"destination":[20,34,148,160],"locations,":[21],"aim":[23],"is":[24,195,229],"to":[25,32,58,94,132,146,197,206,218,226,264,269,281],"find":[26],"path":[28,63,105,114,213],"from":[29,72,129,140,215,223],"that":[35,164,255],"visits":[36],"k":[37,74,177],"different":[38,178],"types":[39,179],"sites":[41,122,181],"particular":[44],"order":[45,174],"as":[46,156],"prescribed":[47],"by":[48,231,240,279],"user.":[50],"The":[51,99,211,235],"planning":[53],"has":[55,79],"two":[56,96],"objectives":[57],"optimize:":[59],"minimize":[60],"total":[62],"length":[64],"maximize":[66],"probability":[68,271],"getting":[70],"served":[71],"sites.":[75],"Since":[76,188],"multi-objective":[81],"nature,":[82],"utilize":[84],"skyline":[86,91],"setting":[87],"retrieve":[89],"all":[90],"paths":[92,119,128],"according":[93],"aggregated":[97],"attributes.":[98],"na\u00efve":[100],"way":[101],"determining":[103],"lengths":[106],"can":[107,123],"involve":[108],"large":[110,191],"number":[111],"shortest":[113,118,127,200,212],"computations.":[115],"Although":[116],"between":[120],"be":[124,150],"pre-computed,":[125],"first":[134],"type":[135,143],"site":[137,145,220,225],"those":[139],"last":[142],"cannot":[149],"computed":[151],"an":[153,261],"offline":[154],"manner":[155],"are":[161,165,182,238],"arbitrary":[162],"points":[163,237],"available":[166],"only":[167,260],"at":[168,185],"runtime.":[169],"Similarly,":[170],"choice":[172],"also":[183],"specified":[184],"runtime":[186],"only.":[187],"network,":[193],"it":[194],"prohibitory":[196],"compute":[198],"many":[199],"paths,":[201],"employ":[203],"heuristic":[205,258],"approximately":[207],"solve":[208],"problem.":[210],"computation":[214],"(and":[221],"similarly,":[222],"destination)":[228],"approximated":[230],"introducing":[232],"reference":[233,236],"points.":[234],"chosen":[239],"employing":[241],"grid-based":[243],"partitioning":[244],"method":[245],"on":[246],"space":[248],"underlying":[249],"network.":[252],"We":[253],"show":[254],"above":[257],"introduces":[259],"additive":[262],"error":[263],"distance":[266],"but":[267],"not":[268],"service":[273],"while":[274],"reducing":[275],"running":[277],"times":[278],"up":[280],"orders":[282],"magnitude.":[284]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}