{"id":"https://openalex.org/W2972304390","doi":"https://doi.org/10.1080/13658816.2019.1660781","title":"Accelerating the shortest-path calculation using cut nodes for problem reduction and division","display_name":"Accelerating the shortest-path calculation using cut nodes for problem reduction and division","publication_year":2019,"publication_date":"2019-09-05","ids":{"openalex":"https://openalex.org/W2972304390","doi":"https://doi.org/10.1080/13658816.2019.1660781","mag":"2972304390"},"language":"en","primary_location":{"id":"doi:10.1080/13658816.2019.1660781","is_oa":false,"landing_page_url":"https://doi.org/10.1080/13658816.2019.1660781","pdf_url":null,"source":{"id":"https://openalex.org/S4210181446","display_name":"International Journal of Geographical Information Systems","issn_l":"0269-3798","issn":["0269-3798","1362-3087"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Geographical Information Science","raw_type":"journal-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/A5100323697","display_name":"Wei Wei","orcid":"https://orcid.org/0000-0002-2239-267X"},"institutions":[{"id":"https://openalex.org/I36152291","display_name":"Henan University of Technology","ror":"https://ror.org/05sbgwt55","country_code":"CN","type":"education","lineage":["https://openalex.org/I36152291"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wei Wei","raw_affiliation_strings":["College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China"],"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I36152291"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101865876","display_name":"Weidong Yang","orcid":"https://orcid.org/0000-0003-3105-5269"},"institutions":[{"id":"https://openalex.org/I36152291","display_name":"Henan University of Technology","ror":"https://ror.org/05sbgwt55","country_code":"CN","type":"education","lineage":["https://openalex.org/I36152291"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Weidong Yang","raw_affiliation_strings":["College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China"],"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I36152291"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081481835","display_name":"Weibin Yao","orcid":null},"institutions":[{"id":"https://openalex.org/I45928872","display_name":"Alibaba Group (China)","ror":"https://ror.org/00k642b80","country_code":"CN","type":"company","lineage":["https://openalex.org/I45928872"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weibin Yao","raw_affiliation_strings":["Ali Cloud Computing Co., Ltd., Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"Ali Cloud Computing Co., Ltd., Hangzhou, China","institution_ids":["https://openalex.org/I45928872"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103079063","display_name":"Heyang Xu","orcid":"https://orcid.org/0000-0002-5135-4939"},"institutions":[{"id":"https://openalex.org/I36152291","display_name":"Henan University of Technology","ror":"https://ror.org/05sbgwt55","country_code":"CN","type":"education","lineage":["https://openalex.org/I36152291"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Heyang Xu","raw_affiliation_strings":["College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China"],"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Henan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I36152291"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101865876"],"corresponding_institution_ids":["https://openalex.org/I36152291"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.09089235,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"34","issue":"2","first_page":"272","last_page":"291"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9973000288009644,"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"}},{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8115294575691223},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6551888585090637},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5870872735977173},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5099841356277466},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49793076515197754},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4724063277244568},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4717344045639038},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4555278420448303},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45512884855270386},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4539967179298401},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39518046379089355},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.39396119117736816},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3761112093925476},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3465287685394287},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3353006839752197},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1514298915863037},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1306060254573822},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07411843538284302}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8115294575691223},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6551888585090637},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5870872735977173},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5099841356277466},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49793076515197754},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4724063277244568},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4717344045639038},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4555278420448303},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45512884855270386},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4539967179298401},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39518046379089355},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.39396119117736816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3761112093925476},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3465287685394287},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3353006839752197},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1514298915863037},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1306060254573822},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07411843538284302},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/13658816.2019.1660781","is_oa":false,"landing_page_url":"https://doi.org/10.1080/13658816.2019.1660781","pdf_url":null,"source":{"id":"https://openalex.org/S4210181446","display_name":"International Journal of Geographical Information Systems","issn_l":"0269-3798","issn":["0269-3798","1362-3087"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Geographical Information Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1508691391","https://openalex.org/W1520740947","https://openalex.org/W1559814459","https://openalex.org/W1583434898","https://openalex.org/W1999667176","https://openalex.org/W2002055996","https://openalex.org/W2009303970","https://openalex.org/W2017694061","https://openalex.org/W2019003829","https://openalex.org/W2019018557","https://openalex.org/W2027693093","https://openalex.org/W2083019227","https://openalex.org/W2104317982","https://openalex.org/W2112528278","https://openalex.org/W2113276858","https://openalex.org/W2120783268","https://openalex.org/W2130257907","https://openalex.org/W2143083884","https://openalex.org/W2150898004","https://openalex.org/W2154356512","https://openalex.org/W2164367088","https://openalex.org/W2168148394","https://openalex.org/W2200965948","https://openalex.org/W2439405256","https://openalex.org/W2558631043","https://openalex.org/W2575116237","https://openalex.org/W2790453528","https://openalex.org/W2888529960","https://openalex.org/W2914199531","https://openalex.org/W4230683892","https://openalex.org/W4238643877","https://openalex.org/W4254077791"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2368964068","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W2161960576","https://openalex.org/W4293054712","https://openalex.org/W2388654557","https://openalex.org/W2170980056","https://openalex.org/W4310124294"],"abstract_inverted_index":{"The":[0],"shortest-path":[1,23,72],"algorithm":[2,74],"is":[3,19,81,89],"one":[4],"of":[5,16,107,129],"the":[6,22,34,85,93,105,130,137,148,164,168],"most":[7,126],"important":[8],"algorithms":[9,143],"in":[10,21,33,53,136,144,163],"geographical":[11],"information":[12],"systems.":[13],"Bellman\u2019s":[14],"principle":[15],"optimization":[17],"(BPO)":[18],"implicit":[20],"problem;":[24],"that":[25],"is,":[26],"any":[27,108],"involved":[28,135],"node":[29],"must":[30],"be":[31,112,134],"located":[32],"simple":[35],"paths":[36],"between":[37],"source":[38],"and":[39,88,95,153,159],"destination":[40],"nodes.":[41,63],"Unfortunately,":[42],"BPO":[43],"has":[44],"never":[45],"been":[46],"explicitly":[47],"used":[48,90],"to":[49,58,83,91,111,133],"exclude":[50],"irrelevant":[51,62],"nodes":[52,87,131],"existing":[54,109,142],"methods,":[55],"potentially":[56],"leading":[57],"unnecessary":[59],"searches":[60],"among":[61],"To":[64],"address":[65],"this":[66],"problem,":[67],"we":[68],"propose":[69],"a":[70,78,97,118],"BPO-based":[71],"acceleration":[73],"(BSPA).":[75],"In":[76,117,167],"BSPA,":[77],"high-level":[79],"graph":[80,94],"built":[82],"locate":[84],"necessary":[86],"partition":[92],"divide":[96],"given":[98],"task":[99],"into":[100],"independent":[101],"subtasks.":[102],"This":[103],"allows":[104],"speed":[106],"method":[110],"improved":[113],"using":[114,120],"parallel":[115],"computing.":[116],"test":[119],"random":[121],"graphs,":[122],"on":[123],"average,":[124],"at":[125],"only":[127],"1.209%":[128],"need":[132],"calculation.":[138],"When":[139],"compared":[140],"with":[141],"real-world":[145],"road":[146],"networks,":[147],"BSPA":[149],"shows":[150],"faster":[151,162],"preprocessing":[152],"query":[154],"times,":[155],"being":[156],"respectively":[157],"118":[158],"463":[160],"times":[161],"best":[165],"case.":[166],"worst":[169],"case,":[170],"they":[171],"remain":[172],"slightly":[173],"faster.":[174]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}