{"id":"https://openalex.org/W2553671390","doi":"https://doi.org/10.1109/apnoms.2016.7737288","title":"Finding realistic shortest path in road networks with lane changing and turn restriction","display_name":"Finding realistic shortest path in road networks with lane changing and turn restriction","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2553671390","doi":"https://doi.org/10.1109/apnoms.2016.7737288","mag":"2553671390"},"language":"en","primary_location":{"id":"doi:10.1109/apnoms.2016.7737288","is_oa":false,"landing_page_url":"https://doi.org/10.1109/apnoms.2016.7737288","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","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/A5101958751","display_name":"Oanh Tran Thi Kim","orcid":"https://orcid.org/0000-0002-2669-7294"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Oanh Tran Thi Kim","raw_affiliation_strings":["Department of Computer Science and Engineering, Kyung Hee University, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Kyung Hee University, Korea","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065922715","display_name":"VanDung Nguyen","orcid":"https://orcid.org/0000-0002-3940-3929"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"VanDung Nguyen","raw_affiliation_strings":["Department of Computer Science and Engineering, Kyung Hee University, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Kyung Hee University, Korea","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103721481","display_name":"Seung Il Moon","orcid":null},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Seung Il Moon","raw_affiliation_strings":["Department of Computer Science and Engineering, Kyung Hee University, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Kyung Hee University, Korea","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034052371","display_name":"Choong Seon Hong","orcid":"https://orcid.org/0000-0003-3484-7333"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Choong Seon Hong","raw_affiliation_strings":["Department of Computer Science and Engineering, Kyung Hee University, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Kyung Hee University, Korea","institution_ids":["https://openalex.org/I35928602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101958751"],"corresponding_institution_ids":["https://openalex.org/I35928602"],"apc_list":null,"apc_paid":null,"fwci":0.5179,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.6602865,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"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.9997000098228455,"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.9997000098228455,"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.9977999925613403,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8056784868240356},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.7031172513961792},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6880495548248291},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6394221186637878},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5919398069381714},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4643704295158386},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.43338584899902344},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.424981951713562},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.42332765460014343},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41308173537254333},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.338260293006897},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24734383821487427},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.24470672011375427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21438992023468018},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17505386471748352},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.15371137857437134},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10917389392852783},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08089160919189453}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8056784868240356},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.7031172513961792},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6880495548248291},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6394221186637878},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5919398069381714},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4643704295158386},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.43338584899902344},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.424981951713562},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.42332765460014343},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41308173537254333},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.338260293006897},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24734383821487427},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.24470672011375427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21438992023468018},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17505386471748352},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.15371137857437134},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10917389392852783},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08089160919189453},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/apnoms.2016.7737288","is_oa":false,"landing_page_url":"https://doi.org/10.1109/apnoms.2016.7737288","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1508691391","https://openalex.org/W1991924366","https://openalex.org/W2065714066","https://openalex.org/W2308115879","https://openalex.org/W6698180076"],"related_works":["https://openalex.org/W2388410942","https://openalex.org/W2156431668","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2018146256","https://openalex.org/W2040572217","https://openalex.org/W2022506245","https://openalex.org/W191849398","https://openalex.org/W2767202586","https://openalex.org/W1966110800"],"abstract_inverted_index":{"Most":[0],"existing":[1],"work":[2],"on":[3,9,38,71,84,105],"path":[4,19,141,186,191],"computation":[5],"has":[6],"been":[7],"focused":[8],"the":[10,17,39,72,74,79,85,139],"shortest-path":[11],"problem,":[12],"which":[13],"is":[14,60,98,180],"to":[15,46,52,103,124,127,135,170],"find":[16,136],"optimal":[18,29],"between":[20],"an":[21,28,90],"origin":[22],"and":[23,41,54,92,151],"destination":[24],"pair.":[25],"To":[26],"get":[27],"route,":[30],"they":[31],"usually":[32],"consider":[33],"travel":[34],"time":[35,77],"moving":[36,82],"forward":[37,83],"road":[40,75,86,107,110],"distance":[42],"from":[43],"a":[44,47,56,121,172,184,189],"source":[45],"target":[48],"as":[49],"crucial":[50],"factors":[51],"value":[53],"select":[55],"path.":[57,147,175],"However,":[58],"it":[59,97],"not":[61,99,137,181],"sufficient":[62],"for":[63,192],"real":[64,122],"life":[65],"traffic.":[66,128],"Firstly,":[67],"when":[68],"we":[69,133],"drive":[70],"road,":[73],"driving":[76],"includes":[78],"duration":[80],"of":[81],"section,":[87],"going":[88],"through":[89],"intersection":[91],"performing":[93],"lane":[94,149],"changes.":[95],"Secondly,":[96],"possible,":[100],"in":[101,120,130,156],"practice,":[102],"go":[104],"any":[106],"section.":[108],"Some":[109],"sections":[111],"have":[112],"restricted":[113,119],"rules.":[114],"Turn":[115],"restrictions":[116,153],"are":[117,154,167],"commonly":[118],"network":[123],"reduce":[125],"disruption":[126],"Therefore,":[129],"our":[131,157,178],"work,":[132],"direct":[134],"only":[138,182],"shortest":[140,174],"but":[142,187],"also":[143,188],"realistic":[144,173],"or":[145],"feasible":[146],"Both":[148],"changes":[150],"turn":[152],"considered":[155,169],"work.":[158],"Simulation":[159],"results":[160],"show":[161],"that":[162],"two":[163],"these":[164],"additional":[165],"constraints":[166],"necessarily":[168],"achieve":[171],"In":[176],"addition,":[177],"proposal":[179],"giving":[183],"practical":[185],"satisfied":[190],"each":[193],"individual":[194],"car.":[195]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}