{"id":"https://openalex.org/W2474026513","doi":"https://doi.org/10.1080/10798587.2016.1196926","title":"A hybrid Genetic-Ant Colony Optimization Algorithm for the Optimal Path Selection","display_name":"A hybrid Genetic-Ant Colony Optimization Algorithm for the Optimal Path Selection","publication_year":2016,"publication_date":"2016-06-20","ids":{"openalex":"https://openalex.org/W2474026513","doi":"https://doi.org/10.1080/10798587.2016.1196926","mag":"2474026513"},"language":"en","primary_location":{"id":"doi:10.1080/10798587.2016.1196926","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10798587.2016.1196926","pdf_url":null,"source":{"id":"https://openalex.org/S40639465","display_name":"Intelligent Automation & Soft Computing","issn_l":"1079-8587","issn":["1079-8587","2326-005X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"Intelligent Automation & Soft Computing","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/A5109448683","display_name":"Jiping Liu","orcid":"https://orcid.org/0000-0001-9275-3250"},"institutions":[{"id":"https://openalex.org/I4210114963","display_name":"Chinese Academy of Surveying and Mapping","ror":"https://ror.org/02j693n47","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210114963"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiping Liu","raw_affiliation_strings":["Research Center of Government GIS, Chinese Academy of Surveying and Mapping, Haidian District, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Center of Government GIS, Chinese Academy of Surveying and Mapping, Haidian District, Beijing, China","institution_ids":["https://openalex.org/I4210114963"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102333475","display_name":"Shenghua Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210114963","display_name":"Chinese Academy of Surveying and Mapping","ror":"https://ror.org/02j693n47","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210114963"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shenghua Xu","raw_affiliation_strings":["Research Center of Government GIS, Chinese Academy of Surveying and Mapping, Haidian District, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Center of Government GIS, Chinese Academy of Surveying and Mapping, Haidian District, Beijing, China","institution_ids":["https://openalex.org/I4210114963"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102913126","display_name":"Fuhao Zhang","orcid":"https://orcid.org/0009-0007-5702-7553"},"institutions":[{"id":"https://openalex.org/I4210114963","display_name":"Chinese Academy of Surveying and Mapping","ror":"https://ror.org/02j693n47","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210114963"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Fuhao Zhang","raw_affiliation_strings":["Research Center of Government GIS, Chinese Academy of Surveying and Mapping, Haidian District, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Center of Government GIS, Chinese Academy of Surveying and Mapping, Haidian District, Beijing, China","institution_ids":["https://openalex.org/I4210114963"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041154596","display_name":"Liang Wang","orcid":"https://orcid.org/0000-0003-2839-0832"},"institutions":[{"id":"https://openalex.org/I4210114963","display_name":"Chinese Academy of Surveying and Mapping","ror":"https://ror.org/02j693n47","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210114963"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Liang Wang","raw_affiliation_strings":["Research Center of Government GIS, Chinese Academy of Surveying and Mapping, Haidian District, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Center of Government GIS, Chinese Academy of Surveying and Mapping, Haidian District, Beijing, China","institution_ids":["https://openalex.org/I4210114963"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210114963"],"apc_list":null,"apc_paid":null,"fwci":0.4972,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.71701148,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"23","issue":"2","first_page":"235","last_page":"242"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9918000102043152,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9918000102043152,"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/T11106","display_name":"Data Management and Algorithms","score":0.9843999743461609,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9711999893188477,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8652265071868896},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7895307540893555},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.696235716342926},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6081336736679077},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5165216326713562},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48759928345680237},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.44633162021636963},{"id":"https://openalex.org/keywords/ant","display_name":"ANT","score":0.44271954894065857},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4372757077217102},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.41030627489089966},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3528887927532196},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.27426767349243164},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.057516396045684814},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.03887146711349487}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8652265071868896},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7895307540893555},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.696235716342926},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6081336736679077},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5165216326713562},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48759928345680237},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.44633162021636963},{"id":"https://openalex.org/C97467695","wikidata":"https://www.wikidata.org/wiki/Q295802","display_name":"ANT","level":2,"score":0.44271954894065857},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4372757077217102},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.41030627489089966},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3528887927532196},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.27426767349243164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.057516396045684814},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.03887146711349487}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10798587.2016.1196926","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10798587.2016.1196926","pdf_url":null,"source":{"id":"https://openalex.org/S40639465","display_name":"Intelligent Automation & Soft Computing","issn_l":"1079-8587","issn":["1079-8587","2326-005X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"Intelligent Automation & Soft Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1029093600","https://openalex.org/W1631888268","https://openalex.org/W1748133846","https://openalex.org/W1894314511","https://openalex.org/W1968313721","https://openalex.org/W1974099929","https://openalex.org/W1977269390","https://openalex.org/W1997822129","https://openalex.org/W2003282559","https://openalex.org/W2006819808","https://openalex.org/W2012691739","https://openalex.org/W2013205100","https://openalex.org/W2018002617","https://openalex.org/W2019150015","https://openalex.org/W2024449335","https://openalex.org/W2026221530","https://openalex.org/W2026733661","https://openalex.org/W2056347680","https://openalex.org/W2061413575","https://openalex.org/W2068878490","https://openalex.org/W2071099748","https://openalex.org/W2079384354","https://openalex.org/W2081372912","https://openalex.org/W2082878954","https://openalex.org/W2095286273","https://openalex.org/W2107941094","https://openalex.org/W2112994798","https://openalex.org/W2117473144","https://openalex.org/W2552070334","https://openalex.org/W3103565931","https://openalex.org/W3145839677","https://openalex.org/W4200411312","https://openalex.org/W4243477301"],"related_works":["https://openalex.org/W3021058566","https://openalex.org/W2057510374","https://openalex.org/W2124203806","https://openalex.org/W972901047","https://openalex.org/W4283452610","https://openalex.org/W2355403488","https://openalex.org/W2358428808","https://openalex.org/W2350529693","https://openalex.org/W2142018123","https://openalex.org/W2101933861"],"abstract_inverted_index":{"AbstractThe":[0],"shortest":[1],"path":[2,40,50,81],"problem":[3,52],"lies":[4],"at":[5],"the":[6,14,38,48,64,73,79,99,104,109,114],"heart":[7],"of":[8,85],"network":[9,70],"flows":[10],"that":[11,103],"seeks":[12],"for":[13,47,68],"paths":[15],"with":[16],"minimum":[17],"cost":[18],"from":[19],"source":[20],"node":[21,24],"to":[22,37],"sink":[23],"in":[25],"networks.":[26],"This":[27],"paper":[28],"presents":[29],"a":[30],"hybrid":[31],"genetic-ant":[32],"colony":[33],"optimization":[34],"algorithmic":[35],"approach":[36],"optimal":[39,49,80],"selection":[41,51,82],"problem.":[42],"First,":[43],"some":[44,56],"existing":[45],"solutions":[46],"are":[53,60],"analyzed,":[54],"and":[55,58,93,112],"shortages":[57],"flaws":[59],"pointed":[61],"out.":[62],"Second,":[63],"data":[65],"organization":[66],"method":[67],"road":[69],"based":[71],"on":[72],"graph":[74],"theory":[75],"is":[76,96],"proposed.":[77],"Furthermore,":[78],"algorithm":[83,106],"integrated":[84],"sinusoidal":[86],"probability":[87],"transfer":[88],"rules,":[89],"pheromone":[90],"update":[91],"strategy":[92],"dual":[94],"population":[95],"presented.":[97],"Finally,":[98],"experimental":[100],"results":[101],"show":[102],"proposed":[105],"speeds":[107],"up":[108],"convergence":[110],"rate":[111],"improves":[113],"efficiency.":[115]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}