{"id":"https://openalex.org/W3119769279","doi":"https://doi.org/10.1155/2021/2963092","title":"The Path Optimization Algorithm of Car Navigation System considering Node Attributes under Time-Invariant Network","display_name":"The Path Optimization Algorithm of Car Navigation System considering Node Attributes under Time-Invariant Network","publication_year":2021,"publication_date":"2021-01-04","ids":{"openalex":"https://openalex.org/W3119769279","doi":"https://doi.org/10.1155/2021/2963092","mag":"3119769279"},"language":"en","primary_location":{"id":"doi:10.1155/2021/2963092","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2021/2963092","pdf_url":"https://downloads.hindawi.com/journals/misy/2021/2963092.pdf","source":{"id":"https://openalex.org/S152111507","display_name":"Mobile Information Systems","issn_l":"1574-017X","issn":["1574-017X","1875-905X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mobile Information Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://downloads.hindawi.com/journals/misy/2021/2963092.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101505775","display_name":"Zhu Dan-dan","orcid":null},"institutions":[{"id":"https://openalex.org/I136765683","display_name":"Tianjin University of Technology","ror":"https://ror.org/00zbe0w13","country_code":"CN","type":"education","lineage":["https://openalex.org/I136765683"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Dan-dan Zhu","raw_affiliation_strings":["Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin 300384, China"],"raw_orcid":"https://orcid.org/0000-0001-7692-8719","affiliations":[{"raw_affiliation_string":"Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin 300384, China","institution_ids":["https://openalex.org/I136765683"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100663027","display_name":"Junqing Sun","orcid":null},"institutions":[{"id":"https://openalex.org/I136765683","display_name":"Tianjin University of Technology","ror":"https://ror.org/00zbe0w13","country_code":"CN","type":"education","lineage":["https://openalex.org/I136765683"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jun-qing Sun","raw_affiliation_strings":["Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin 300384, China"],"raw_orcid":"https://orcid.org/0000-0003-0176-3870","affiliations":[{"raw_affiliation_string":"Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin 300384, China","institution_ids":["https://openalex.org/I136765683"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101505775"],"corresponding_institution_ids":["https://openalex.org/I136765683"],"apc_list":{"value":2550,"currency":"USD","value_usd":2550},"apc_paid":{"value":2550,"currency":"USD","value_usd":2550},"fwci":1.1134,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.75538395,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"2021","issue":null,"first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987000226974487,"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.9987000226974487,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9922999739646912,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8275800943374634},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.819159984588623},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6821435689926147},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5396246314048767},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5125100612640381},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5087319016456604},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.489928662776947},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.45646846294403076},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45031148195266724},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.4283679127693176},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16466447710990906},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1169063150882721},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09353458881378174},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08073914051055908}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8275800943374634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.819159984588623},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6821435689926147},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5396246314048767},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5125100612640381},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5087319016456604},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.489928662776947},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.45646846294403076},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45031148195266724},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.4283679127693176},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16466447710990906},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1169063150882721},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09353458881378174},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08073914051055908},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1155/2021/2963092","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2021/2963092","pdf_url":"https://downloads.hindawi.com/journals/misy/2021/2963092.pdf","source":{"id":"https://openalex.org/S152111507","display_name":"Mobile Information Systems","issn_l":"1574-017X","issn":["1574-017X","1875-905X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mobile Information Systems","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:338864bb9d70479e91dba3a543b9d3f0","is_oa":false,"landing_page_url":"https://doaj.org/article/338864bb9d70479e91dba3a543b9d3f0","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mobile Information Systems, Vol 2021 (2021)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1155/2021/2963092","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2021/2963092","pdf_url":"https://downloads.hindawi.com/journals/misy/2021/2963092.pdf","source":{"id":"https://openalex.org/S152111507","display_name":"Mobile Information Systems","issn_l":"1574-017X","issn":["1574-017X","1875-905X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mobile Information Systems","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.8199999928474426}],"awards":[{"id":"https://openalex.org/G5309966344","display_name":null,"funder_award_id":"2014YQ120351","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8863418517","display_name":"\u57fa\u4e8e\u591a\u81ea\u4e3b\u4f53\u7684\u96c6\u88c5\u7bb1\u591a\u5f0f\u8054\u8fd0\u534f\u8c03\u4e0e\u534f\u540c\u4f18\u5316\u7814\u7a76","funder_award_id":"71501141","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3119769279.pdf","grobid_xml":"https://content.openalex.org/works/W3119769279.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W2091244149","https://openalex.org/W2133962014","https://openalex.org/W2169528473","https://openalex.org/W2387412354","https://openalex.org/W2391446487","https://openalex.org/W2497712405","https://openalex.org/W2604821153","https://openalex.org/W2738294059","https://openalex.org/W2898360688","https://openalex.org/W2915814342","https://openalex.org/W2934525760","https://openalex.org/W2964735285","https://openalex.org/W2971981774","https://openalex.org/W3007423657","https://openalex.org/W3013518474","https://openalex.org/W3034038218","https://openalex.org/W3150252750","https://openalex.org/W6982403305"],"related_works":["https://openalex.org/W2990531685","https://openalex.org/W2886722595","https://openalex.org/W4405632291","https://openalex.org/W2761711678","https://openalex.org/W2170980056","https://openalex.org/W2375661673","https://openalex.org/W4402599120","https://openalex.org/W2379804627","https://openalex.org/W4221129498","https://openalex.org/W4310124294"],"abstract_inverted_index":{"Vehicle":[0],"path":[1,38,55],"planning":[2,39,56],"plays":[3],"a":[4,23,96,134],"key":[5],"role":[6],"in":[7,58],"the":[8,16,27,36,53,62,67,71,75,84,87,91,104,110,112,115,126,130,139,142,151,154,167],"car":[9],"navigation":[10],"system.":[11],"In":[12,48],"actual":[13],"urban":[14],"traffic,":[15],"time":[17,29,65,80,127],"spent":[18],"at":[19],"intersections":[20],"accounts":[21],"for":[22],"large":[24],"proportion":[25],"of":[26,86,114,129,141,153],"total":[28],"and":[30,121,124,132,173],"cannot":[31],"be":[32],"ignored.":[33],"Therefore,":[34],"studying":[35],"shortest":[37],"problem":[40,57],"considering":[41],"node":[42,69,73,79],"attributes":[43],"has":[44,170],"important":[45],"practical":[46],"significance.":[47],"this":[49],"article,":[50],"we":[51,89,122,149],"study":[52],"vehicle":[54],"time-invariant":[59],"networks,":[60],"with":[61,157],"minimum":[63],"travel":[64],"from":[66],"starting":[68],"to":[70,108,137],"destination":[72],"as":[74],"optimization":[76],"goal":[77],"(including":[78],"cost).":[81],"Based":[82],"on":[83,103],"characteristics":[85],"problem,":[88],"construct":[90],"mathematical":[92],"model.":[93],"We":[94],"propose":[95],"Reverse":[97],"Order":[98],"Labeling":[99],"Algorithm":[100],"(ROLA)":[101],"based":[102],"traditional":[105],"Dijkstra":[106],"algorithm":[107,117,169],"solve":[109],"problem;":[111],"correctness":[113],"proposed":[116,155,168],"is":[118],"proved":[119],"theoretically,":[120],"analyse":[123],"give":[125],"complexity":[128],"ROLA":[131,156],"design":[133],"calculation":[135],"example":[136],"verify":[138],"effectiveness":[140],"algorithm.":[143],"Finally,":[144],"through":[145],"extensive":[146],"simulation":[147],"experiments,":[148],"compare":[150],"performance":[152],"several":[158],"other":[159],"existing":[160],"algorithms.":[161],"The":[162],"experimental":[163],"results":[164],"show":[165],"that":[166],"good":[171],"stability":[172],"high":[174],"efficiency.":[175]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}