{"id":"https://openalex.org/W2742930698","doi":"https://doi.org/10.1007/978-3-319-61994-1_13","title":"Research on the Shortest Path of Two Places in Urban Based on Improved Ant Colony Algorithm","display_name":"Research on the Shortest Path of Two Places in Urban Based on Improved Ant Colony Algorithm","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2742930698","doi":"https://doi.org/10.1007/978-3-319-61994-1_13","mag":"2742930698"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-61994-1_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-61994-1_13","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5027743371","display_name":"Yanjuan Hu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210152006","display_name":"Jilin Agricultural University","ror":"https://ror.org/05dmhhd41","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210152006"]},{"id":"https://openalex.org/I194450716","display_name":"Jilin University","ror":"https://ror.org/00js3aw79","country_code":"CN","type":"education","lineage":["https://openalex.org/I194450716"]},{"id":"https://openalex.org/I4385474403","display_name":"Changchun University of Technology","ror":"https://ror.org/052pakb34","country_code":null,"type":"education","lineage":["https://openalex.org/I4385474403"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yanjuan Hu","raw_affiliation_strings":["College of Biological and Agricultural Engineering, Jilin University, Changchun, China","Mechatronic Engineering, Changchun University of Technology, Changchun, China"],"affiliations":[{"raw_affiliation_string":"College of Biological and Agricultural Engineering, Jilin University, Changchun, China","institution_ids":["https://openalex.org/I4210152006","https://openalex.org/I194450716"]},{"raw_affiliation_string":"Mechatronic Engineering, Changchun University of Technology, Changchun, China","institution_ids":["https://openalex.org/I4385474403"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103206327","display_name":"Luquan Ren","orcid":"https://orcid.org/0000-0002-8728-7176"},"institutions":[{"id":"https://openalex.org/I194450716","display_name":"Jilin University","ror":"https://ror.org/00js3aw79","country_code":"CN","type":"education","lineage":["https://openalex.org/I194450716"]},{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]},{"id":"https://openalex.org/I4210152006","display_name":"Jilin Agricultural University","ror":"https://ror.org/05dmhhd41","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210152006"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Luquan Ren","raw_affiliation_strings":["Beihang University, Beijing, China","College of Biological and Agricultural Engineering, Jilin University, Changchun, China"],"affiliations":[{"raw_affiliation_string":"Beihang University, Beijing, China","institution_ids":["https://openalex.org/I82880672"]},{"raw_affiliation_string":"College of Biological and Agricultural Engineering, Jilin University, Changchun, China","institution_ids":["https://openalex.org/I4210152006","https://openalex.org/I194450716"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112801393","display_name":"Hongwei Zhao","orcid":null},"institutions":[{"id":"https://openalex.org/I4210152006","display_name":"Jilin Agricultural University","ror":"https://ror.org/05dmhhd41","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210152006"]},{"id":"https://openalex.org/I194450716","display_name":"Jilin University","ror":"https://ror.org/00js3aw79","country_code":"CN","type":"education","lineage":["https://openalex.org/I194450716"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hongwei Zhao","raw_affiliation_strings":["College of Biological and Agricultural Engineering, Jilin University, Changchun, China"],"affiliations":[{"raw_affiliation_string":"College of Biological and Agricultural Engineering, Jilin University, Changchun, China","institution_ids":["https://openalex.org/I4210152006","https://openalex.org/I194450716"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103141895","display_name":"Yao Wang","orcid":"https://orcid.org/0000-0003-1391-0145"},"institutions":[{"id":"https://openalex.org/I121691239","display_name":"Beihua University","ror":"https://ror.org/013jjp941","country_code":"CN","type":"education","lineage":["https://openalex.org/I121691239"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yao Wang","raw_affiliation_strings":["College of Mechanical Engineering, Beihua University, Jilin City, China"],"affiliations":[{"raw_affiliation_string":"College of Mechanical Engineering, Beihua University, Jilin City, China","institution_ids":["https://openalex.org/I121691239"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5027743371"],"corresponding_institution_ids":["https://openalex.org/I194450716","https://openalex.org/I4210152006","https://openalex.org/I4385474403"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3342,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51000465,"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":"131","last_page":"138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9837999939918518,"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.9837999939918518,"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.9745000004768372,"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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.97079998254776,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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.8788217306137085},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8040361404418945},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7583842277526855},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.666799008846283},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6417710185050964},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6336398720741272},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5827813744544983},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.559458315372467},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5561213493347168},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5509355664253235},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5394846200942993},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5024137496948242},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.4334127604961395},{"id":"https://openalex.org/keywords/geographic-information-system","display_name":"Geographic information system","score":0.42283254861831665},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.38300400972366333},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14173313975334167},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.10618641972541809},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10017856955528259},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06428703665733337}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8788217306137085},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8040361404418945},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7583842277526855},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.666799008846283},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6417710185050964},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6336398720741272},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5827813744544983},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.559458315372467},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5561213493347168},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5509355664253235},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5394846200942993},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5024137496948242},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.4334127604961395},{"id":"https://openalex.org/C41856607","wikidata":"https://www.wikidata.org/wiki/Q483130","display_name":"Geographic information system","level":2,"score":0.42283254861831665},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.38300400972366333},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14173313975334167},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.10618641972541809},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10017856955528259},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06428703665733337},{"id":"https://openalex.org/C62649853","wikidata":"https://www.wikidata.org/wiki/Q199687","display_name":"Remote sensing","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},{"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-61994-1_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-61994-1_13","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.8199999928474426}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2212092323","https://openalex.org/W2331356768","https://openalex.org/W2352937370","https://openalex.org/W2359038450","https://openalex.org/W2370967961","https://openalex.org/W2385603967"],"related_works":["https://openalex.org/W2357391150","https://openalex.org/W2161960576","https://openalex.org/W2366342492","https://openalex.org/W2030169809","https://openalex.org/W2156431668","https://openalex.org/W2354846196","https://openalex.org/W2388051136","https://openalex.org/W2371371223","https://openalex.org/W1992129517","https://openalex.org/W2144050074"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}