{"id":"https://openalex.org/W2293400123","doi":"https://doi.org/10.1145/2820783.2820835","title":"An arc orienteering algorithm to find the most scenic path on a large-scale road network","display_name":"An arc orienteering algorithm to find the most scenic path on a large-scale road network","publication_year":2015,"publication_date":"2015-11-03","ids":{"openalex":"https://openalex.org/W2293400123","doi":"https://doi.org/10.1145/2820783.2820835","mag":"2293400123"},"language":"en","primary_location":{"id":"doi:10.1145/2820783.2820835","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2820783.2820835","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd 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/A5100358936","display_name":"Ying L\u00fc","orcid":"https://orcid.org/0000-0002-4206-231X"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ying Lu","raw_affiliation_strings":["University of Southern California, Los Angeles, CA"],"affiliations":[{"raw_affiliation_string":"University of Southern California, Los Angeles, CA","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012068017","display_name":"Cyrus Shahabi","orcid":"https://orcid.org/0000-0001-9118-0681"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cyrus Shahabi","raw_affiliation_strings":["University of Southern California, Los Angeles, CA"],"affiliations":[{"raw_affiliation_string":"University of Southern California, Los Angeles, CA","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100358936"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":null,"apc_paid":null,"fwci":3.1589,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.92781762,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"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":0.9991000294685364,"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.9991000294685364,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9769999980926514,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9609000086784363,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"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/orienteering","display_name":"Orienteering","score":0.7603890895843506},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7226952314376831},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5003631114959717},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49037671089172363},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4785347878932953},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.44084393978118896},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.42404115200042725},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40645790100097656},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37735626101493835},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3697863519191742},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23581695556640625},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19311866164207458},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17652156949043274}],"concepts":[{"id":"https://openalex.org/C513932644","wikidata":"https://www.wikidata.org/wiki/Q29358","display_name":"Orienteering","level":2,"score":0.7603890895843506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7226952314376831},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5003631114959717},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49037671089172363},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4785347878932953},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.44084393978118896},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.42404115200042725},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40645790100097656},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37735626101493835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3697863519191742},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23581695556640625},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19311866164207458},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17652156949043274},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2820783.2820835","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2820783.2820835","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7200000286102295,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320327336","display_name":"Vlaamse regering","ror":null},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W143506948","https://openalex.org/W207577498","https://openalex.org/W1543003006","https://openalex.org/W1956693573","https://openalex.org/W1969579058","https://openalex.org/W1972853209","https://openalex.org/W1999883971","https://openalex.org/W2001532028","https://openalex.org/W2002834785","https://openalex.org/W2008196645","https://openalex.org/W2014979043","https://openalex.org/W2018139583","https://openalex.org/W2030740234","https://openalex.org/W2038926730","https://openalex.org/W2041916017","https://openalex.org/W2043512910","https://openalex.org/W2052970971","https://openalex.org/W2061651455","https://openalex.org/W2069775569","https://openalex.org/W2078705393","https://openalex.org/W2081863845","https://openalex.org/W2085543268","https://openalex.org/W2096786991","https://openalex.org/W2113873983","https://openalex.org/W2118269922","https://openalex.org/W2121804177","https://openalex.org/W2147954430","https://openalex.org/W2149173084","https://openalex.org/W2171901130","https://openalex.org/W3104298487"],"related_works":["https://openalex.org/W4249387127","https://openalex.org/W1543810005","https://openalex.org/W4393610368","https://openalex.org/W4393731121","https://openalex.org/W327165017","https://openalex.org/W2356214734","https://openalex.org/W2394169628","https://openalex.org/W4254102998","https://openalex.org/W2381702286","https://openalex.org/W2392643114"],"abstract_inverted_index":{"Traditional":[0],"route":[1],"planning":[2],"problems":[3],"mainly":[4],"focus":[5],"on":[6,34,193,215],"finding":[7],"the":[8,12,24,30,35,41,59,65,68,91,106,121,136,143,151,171,179,182,198],"shortest":[9],"path":[10,27,39,69],"considering":[11],"travel":[13,43],"distance":[14],"or":[15,46,80],"time.":[16],"In":[17],"this":[18,167],"paper,":[19],"we":[20,169],"aim":[21],"to":[22,63,105,134],"find":[23],"most":[25,31,137],"scenic":[26,72,138],"that":[28],"offers":[29],"beautiful":[32],"sceneries":[33],"arcs":[36],"of":[37,67,75,90,110,124,184,202],"a":[38,50,55,88,98,155,164,175],"while":[40],"total":[42],"cost":[44,78],"(distance":[45,79],"time)":[47],"is":[48,54,62,97],"within":[49,117,212],"user-specified":[51],"budget.":[52],"This":[53],"challenging":[56],"problem":[57,83],"as":[58,87,154,174],"optimization":[60,102],"objective":[61],"maximize":[64],"value":[66],"(i.e.,":[70],"its":[71,77],"value)":[73],"instead":[74],"minimizing":[76],"time).":[81],"The":[82],"can":[84,207],"be":[85],"formulated":[86],"variant":[89],"Arc":[92],"Orienteering":[93],"Problem":[94],"(AOP),":[95],"which":[96,159,206],"well-known":[99],"NP-hard":[100],"combinatorial":[101],"problem.":[103,140],"Due":[104],"fast":[107],"response-time":[108],"requirements":[109],"interactive":[111],"mobile":[112],"and":[113,120,189,200],"online":[114],"applications":[115],"(e.g.,":[116],"300":[118,213],"milliseconds)":[119],"large":[122],"scale":[123],"real-world":[125,195],"road":[126,139,152,172],"networks,":[127],"existing":[128,144],"heuristic":[129],"algorithms":[130],"for":[131,146],"AOP":[132,147],"fail":[133],"solve":[135],"Therefore,":[141],"unlike":[142],"approaches":[145],"where":[148],"they":[149],"treat":[150,170],"network":[153,173,220],"traditional":[156],"graph":[157],"in":[158,166],"all-pair":[160],"distances":[161],"are":[162],"pre-computed":[163],"priori,":[165],"work,":[168],"spatial":[176,185,190],"network,":[177],"utilizing":[178],"techniques":[180],"from":[181],"field":[183],"database:":[186],"ellipse":[187],"pruning":[188],"indexing.":[191],"Experiments":[192],"two":[194],"datasets":[196,217],"demonstrate":[197],"efficiency":[199],"accuracy":[201,211],"our":[203],"proposed":[204],"algorithms,":[205],"achieve":[208],"over":[209],"95%":[210],"milliseconds":[214],"large-scale":[216],"(over":[218],"100K":[219],"nodes).":[221]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}