{"id":"https://openalex.org/W2779924809","doi":"https://doi.org/10.1155/2017/2056501","title":"Routing Optimization Algorithms Based on Node Compression in Big Data Environment","display_name":"Routing Optimization Algorithms Based on Node Compression in Big Data Environment","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2779924809","doi":"https://doi.org/10.1155/2017/2056501","mag":"2779924809"},"language":"en","primary_location":{"id":"doi:10.1155/2017/2056501","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2017/2056501","pdf_url":"http://downloads.hindawi.com/journals/sp/2017/2056501.pdf","source":{"id":"https://openalex.org/S166774750","display_name":"Scientific Programming","issn_l":"1058-9244","issn":["1058-9244","1875-919X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Scientific Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"http://downloads.hindawi.com/journals/sp/2017/2056501.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021020061","display_name":"Lifeng Yang","orcid":"https://orcid.org/0000-0002-4722-2204"},"institutions":[{"id":"https://openalex.org/I4210160657","display_name":"Yunnan Open University","ror":"https://ror.org/04egk7864","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210160657"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lifeng Yang","raw_affiliation_strings":["School of Continuing Education, Yunnan Open University, Yunnan, China"],"affiliations":[{"raw_affiliation_string":"School of Continuing Education, Yunnan Open University, Yunnan, China","institution_ids":["https://openalex.org/I4210160657"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035410483","display_name":"Liangming Chen","orcid":"https://orcid.org/0000-0002-8898-810X"},"institutions":[{"id":"https://openalex.org/I139660479","display_name":"Central South University","ror":"https://ror.org/00f1zfq44","country_code":"CN","type":"education","lineage":["https://openalex.org/I139660479"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Liangming Chen","raw_affiliation_strings":["School of Software, Central South University, Hunan, China"],"affiliations":[{"raw_affiliation_string":"School of Software, Central South University, Hunan, China","institution_ids":["https://openalex.org/I139660479"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049245470","display_name":"Ningwei Wang","orcid":"https://orcid.org/0000-0003-1567-3091"},"institutions":[{"id":"https://openalex.org/I139660479","display_name":"Central South University","ror":"https://ror.org/00f1zfq44","country_code":"CN","type":"education","lineage":["https://openalex.org/I139660479"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ningwei Wang","raw_affiliation_strings":["School of Software, Central South University, Hunan, China"],"affiliations":[{"raw_affiliation_string":"School of Software, Central South University, Hunan, China","institution_ids":["https://openalex.org/I139660479"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039343813","display_name":"Zhifang Liao","orcid":"https://orcid.org/0000-0002-5525-904X"},"institutions":[{"id":"https://openalex.org/I139660479","display_name":"Central South University","ror":"https://ror.org/00f1zfq44","country_code":"CN","type":"education","lineage":["https://openalex.org/I139660479"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhifang Liao","raw_affiliation_strings":["School of Software, Central South University, Hunan, China"],"affiliations":[{"raw_affiliation_string":"School of Software, Central South University, Hunan, China","institution_ids":["https://openalex.org/I139660479"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5039343813"],"corresponding_institution_ids":["https://openalex.org/I139660479"],"apc_list":{"value":1800,"currency":"USD","value_usd":1800},"apc_paid":{"value":1800,"currency":"USD","value_usd":1800},"fwci":0.1869,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.49716356,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"2017","issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9889000058174133,"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.9889000058174133,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9757999777793884,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.7935104966163635},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7191136479377747},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.715004026889801},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7039045691490173},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5684551000595093},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5596722364425659},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5563499331474304},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4780481457710266},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4637961983680725},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.45225831866264343},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4383963346481323},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.423453152179718},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24095332622528076},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20481085777282715},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.12991857528686523},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07416334748268127}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.7935104966163635},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7191136479377747},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.715004026889801},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7039045691490173},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5684551000595093},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5596722364425659},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5563499331474304},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4780481457710266},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4637961983680725},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.45225831866264343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4383963346481323},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.423453152179718},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24095332622528076},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20481085777282715},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.12991857528686523},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07416334748268127},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1155/2017/2056501","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2017/2056501","pdf_url":"http://downloads.hindawi.com/journals/sp/2017/2056501.pdf","source":{"id":"https://openalex.org/S166774750","display_name":"Scientific Programming","issn_l":"1058-9244","issn":["1058-9244","1875-919X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Scientific Programming","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:b4c886580a6246b0be8d54e7bdc65954","is_oa":true,"landing_page_url":"https://doaj.org/article/b4c886580a6246b0be8d54e7bdc65954","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scientific Programming, Vol 2017 (2017)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1155/2017/2056501","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2017/2056501","pdf_url":"http://downloads.hindawi.com/journals/sp/2017/2056501.pdf","source":{"id":"https://openalex.org/S166774750","display_name":"Scientific Programming","issn_l":"1058-9244","issn":["1058-9244","1875-919X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Scientific Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2779924809.pdf","grobid_xml":"https://content.openalex.org/works/W2779924809.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1888833873","https://openalex.org/W1970225139","https://openalex.org/W2053757807","https://openalex.org/W2169528473","https://openalex.org/W2280304536","https://openalex.org/W2339909701","https://openalex.org/W2529246705","https://openalex.org/W2745483335","https://openalex.org/W2760669341"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2523719706","https://openalex.org/W4293054712","https://openalex.org/W2368964068","https://openalex.org/W2198982833","https://openalex.org/W2358094779","https://openalex.org/W2366342492","https://openalex.org/W2030169809","https://openalex.org/W2161960576","https://openalex.org/W2597144308"],"abstract_inverted_index":{"Shortest":[0],"path":[1,21,29,47,124],"problem":[2,22,61],"has":[3],"been":[4],"a":[5,31,49,131,141],"classic":[6],"issue.":[7],"Even":[8],"more":[9,65],"so":[10],"difficulties":[11],"remain":[12],"involving":[13,116,146],"large":[14,117],"data":[15,104,148],"environment.":[16],"Current":[17],"research":[18],"on":[19,25,48,113],"shortest":[20,28,46],"mainly":[23],"focuses":[24],"seeking":[26],"the":[27,35,43,123,127,138,159],"from":[30,126],"starting":[32,128],"point":[33,129],"to":[34,84,121,136],"destination,":[36],"with":[37,158],"both":[38],"vertices":[39],"already":[40],"given;":[41],"but":[42],"researches":[44],"of":[45,109,134,152],"limited":[50,53,142],"time":[51],"and":[52,87,106,150],"nodes":[54,135],"passing":[55],"through":[56,130],"are":[57],"few,":[58],"yet":[59],"such":[60],"could":[62],"not":[63],"be":[64,156],"common":[66],"in":[67,102,119],"real":[68],"life.":[69],"In":[70,82],"this":[71,80],"paper":[72],"we":[73,92],"propose":[74,94],"several":[75],"time-dependent":[76],"optimization":[77,110],"algorithms":[78,111],"for":[79,99],"problem.":[81],"regard":[83],"traditional":[85],"backtracking":[86,97],"different":[88,147],"node":[89,114],"compression":[90,115],"methods,":[91],"first":[93],"an":[95],"improved":[96],"algorithm":[98,161],"one":[100],"condition":[101],"big":[103],"environment":[105],"three":[107],"types":[108],"based":[112],"data,":[118],"order":[120],"realize":[122],"selection":[125],"given":[132],"set":[133],"reach":[137],"end":[139],"within":[140],"time.":[143],"Consequently,":[144],"problems":[145],"volume":[149],"complexity":[151],"network":[153],"structure":[154],"can":[155],"solved":[157],"appropriate":[160],"adopted.":[162]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}