{"id":"https://openalex.org/W2900524635","doi":"https://doi.org/10.1109/apcap.2018.8538211","title":"Dynamic Path Planning Based on an Improved Ant Colony Optimization with Genetic Algorithm","display_name":"Dynamic Path Planning Based on an Improved Ant Colony Optimization with Genetic Algorithm","publication_year":2018,"publication_date":"2018-08-01","ids":{"openalex":"https://openalex.org/W2900524635","doi":"https://doi.org/10.1109/apcap.2018.8538211","mag":"2900524635"},"language":"en","primary_location":{"id":"doi:10.1109/apcap.2018.8538211","doi":"https://doi.org/10.1109/apcap.2018.8538211","is_oa":false,"landing_page_url":"https://doi.org/10.1109/apcap.2018.8538211","pdf_url":null,"source":{"id":"https://openalex.org/S4306418581","display_name":"IEEE Asia-Pacific Conference on Antennas and Propagation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Asia-Pacific Conference on Antennas and Propagation (APCAP)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5039080094","display_name":"Ming\u2010Gong Lee","orcid":"https://orcid.org/0000-0001-9405-2247","observed_orcids":["https://orcid.org/0000-0001-9405-2247"]},"institutions":[{"id":"https://openalex.org/I59460038","display_name":"Chung Hua University","ror":"https://ror.org/01yzz0f51","country_code":"TW","type":"education","lineage":["https://openalex.org/I59460038"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Ming-Gong Lee","raw_affiliation_strings":["Leisure and Recreation Management, Chung Hua University, Hsinchu"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Leisure and Recreation Management, Chung Hua University, Hsinchu","institution_ids":["https://openalex.org/I59460038"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101553990","display_name":"Kun-Ming Yu","orcid":"https://orcid.org/0000-0001-8706-3490","observed_orcids":["https://orcid.org/0000-0001-8706-3490"]},"institutions":[{"id":"https://openalex.org/I59460038","display_name":"Chung Hua University","ror":"https://ror.org/01yzz0f51","country_code":"TW","type":"education","lineage":["https://openalex.org/I59460038"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Kun-Ming Yu","raw_affiliation_strings":["Computer Science and Information Engineering, Chung Hua University, Hsinchu"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Information Engineering, Chung Hua University, Hsinchu","institution_ids":["https://openalex.org/I59460038"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I59460038"],"apc_list":null,"apc_paid":null,"fwci":1.1543,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.84969174,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.0026000000070780516,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"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/T11500","display_name":"Evacuation and Crowd Dynamics","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/3311","display_name":"Safety Research"},"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/dynamic-path-planning","display_name":"dynamic path planning","score":0.9330000281333923},{"id":"https://openalex.org/keywords/ant-colony-optimization","display_name":"ant colony optimization","score":0.8190000057220459},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.7360000014305115},{"id":"https://openalex.org/keywords/hybrid-metaheuristic-algorithm","display_name":"hybrid metaheuristic","score":0.7540000081062317},{"id":"https://openalex.org/keywords/tourist-route-planning","display_name":"tourism route planning","score":0.4399999976158142},{"id":"https://openalex.org/keywords/parameter-tuning","display_name":"parameter tuning","score":0.6019999980926514},{"id":"https://openalex.org/keywords/travel-time-and-distance","display_name":"travel time and distance","score":0.6259999871253967}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8308287858963013},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6414874792098999},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6350283622741699},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5664623975753784},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.49979686737060547},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4744606614112854},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.44578421115875244},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4403437674045563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37389281392097473},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2814582586288452},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.16079837083816528},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13525348901748657},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.09541603922843933},{"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.1109/apcap.2018.8538211","doi":"https://doi.org/10.1109/apcap.2018.8538211","is_oa":false,"landing_page_url":"https://doi.org/10.1109/apcap.2018.8538211","pdf_url":null,"source":{"id":"https://openalex.org/S4306418581","display_name":"IEEE Asia-Pacific Conference on Antennas and Propagation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Asia-Pacific Conference on Antennas and Propagation (APCAP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2770249846","https://openalex.org/W4417528972","https://openalex.org/W3136602734","https://openalex.org/W4390682108","https://openalex.org/W4318147604","https://openalex.org/W2016926863","https://openalex.org/W3003249335","https://openalex.org/W4389777061","https://openalex.org/W2373172898","https://openalex.org/W4362664520"],"abstract_inverted_index":{"A":[0,186],"study":[1,69],"by":[2,32,58,113,152],"using":[3,33],"Adaptable":[4],"Ant":[5,96,162],"Colony":[6,97,163],"Optimization":[7,98,164],"Algorithm":[8,99],"(AACO)":[9],"to":[10,42,55,71,76,155],"solve":[11],"the":[12,25,37,44,51,86,91,114,125,130,137,156,173,179],"path":[13,46],"arrangement":[14,47],"problem":[15],"has":[16],"been":[17],"given":[18],"in":[19,82,199],"[1].":[20],"This":[21],"algorithm":[22,93],"can":[23,149],"determine":[24,43],"priority":[26],"of":[27,85,104,117,136,175,181,189],"visit":[28],"for":[29,48,202],"different":[30],"attractions,":[31],"travel":[34],"time":[35],"and":[36,66,80,88,111,120,140,158,193],"distance":[38],"between":[39],"two":[40],"attractions":[41,176],"optimal":[45,78],"visitors.":[49],"Though,":[50],"probability":[52,147],"function":[53,61],"seems":[54],"be":[56,150],"determined":[57],"some":[59,145],"exponential":[60],"with":[62,166],"fixed":[63,167],"powers":[64],"\u03b1":[65,79,139],"\u03b2,":[67],"this":[68],"tries":[70],"apply":[72],"GA":[73],"(Genetic":[74],"algorithm)":[75],"find":[77],"\u03b2":[81,141],"each":[83],"determination":[84],"probability,":[87],"we":[89],"name":[90],"new":[92],"as":[94],"Improved":[95],"(IAACO).":[100],"The":[101,134],"numerical":[102],"outputs":[103],"IAACO":[105,153,182],"show":[106],"that":[107,123,144],"it":[108],"outperforms":[109],"AACO":[110,157],"ACO":[112,159],"total":[115],"number":[116,174],"desire":[118],"values":[119],"solid":[121],"points,":[122],"means":[124],"rendered":[126,151,195],"spots":[127],"are":[128,177],"among":[129],"most":[131],"wantto-visit":[132],"places.":[133],"variation":[135],"parameters":[138,168],"also":[142],"shows":[143,171,183],"best":[146],"functions":[148],"compared":[154],"(the":[160],"original":[161],"Algorithm)":[165],"only.":[169],"It":[170],"when":[172],"many,":[178],"performance":[180],"better":[184],"results.":[185],"selectable":[187],"choice":[188],"places":[190],"is":[191,197],"possible":[192],"their":[194],"route":[196],"illustrated":[198],"Google":[200],"Map":[201],"users'":[203],"reference.":[204]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3}],"updated_date":"2026-10-05T09:50:58.205359","created_date":"2018-11-29T00:00:00"}