{"id":"https://openalex.org/W4386013667","doi":"https://doi.org/10.1145/3611450.3611465","title":"A solution of TSP based on the improved ant colony optimization","display_name":"A solution of TSP based on the improved ant colony optimization","publication_year":2023,"publication_date":"2023-07-21","ids":{"openalex":"https://openalex.org/W4386013667","doi":"https://doi.org/10.1145/3611450.3611465"},"language":"en","primary_location":{"id":"doi:10.1145/3611450.3611465","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3611450.3611465","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3611450.3611465?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 3rd International Conference on Artificial Intelligence, Automation and Algorithms","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3611450.3611465?download=true","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021910740","display_name":"H. W. de Nie","orcid":"https://orcid.org/0009-0008-7079-2177"},"institutions":[{"id":"https://openalex.org/I114117164","display_name":"University of Science and Technology Liaoning","ror":"https://ror.org/03grx7119","country_code":"CN","type":"education","lineage":["https://openalex.org/I114117164"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hengyu Nie","raw_affiliation_strings":["School of Electronic Information and Engineering, University of Science and Technology Liaoning, China"],"raw_orcid":"https://orcid.org/0009-0008-7079-2177","affiliations":[{"raw_affiliation_string":"School of Electronic Information and Engineering, University of Science and Technology Liaoning, China","institution_ids":["https://openalex.org/I114117164"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057736306","display_name":"Meijuan Li","orcid":"https://orcid.org/0000-0002-0838-4470"},"institutions":[{"id":"https://openalex.org/I114117164","display_name":"University of Science and Technology Liaoning","ror":"https://ror.org/03grx7119","country_code":"CN","type":"education","lineage":["https://openalex.org/I114117164"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Meijuan Li","raw_affiliation_strings":["School of Electronic Information and Engineering, University of Science and Technology Liaoning, China"],"raw_orcid":"https://orcid.org/0000-0002-0838-4470","affiliations":[{"raw_affiliation_string":"School of Electronic Information and Engineering, University of Science and Technology Liaoning, China","institution_ids":["https://openalex.org/I114117164"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042738920","display_name":"Xuebo Chen","orcid":"https://orcid.org/0000-0001-6799-7667"},"institutions":[{"id":"https://openalex.org/I114117164","display_name":"University of Science and Technology Liaoning","ror":"https://ror.org/03grx7119","country_code":"CN","type":"education","lineage":["https://openalex.org/I114117164"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuebo Chen","raw_affiliation_strings":["School of Electronic Information and Engineering, University of Science and Technology Liaoning, China"],"raw_orcid":"https://orcid.org/0000-0001-6799-7667","affiliations":[{"raw_affiliation_string":"School of Electronic Information and Engineering, University of Science and Technology Liaoning, China","institution_ids":["https://openalex.org/I114117164"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109631883","display_name":"Zaihui Cui","orcid":"https://orcid.org/0009-0007-8035-9548"},"institutions":[{"id":"https://openalex.org/I41147446","display_name":"Anshan Normal University","ror":"https://ror.org/04s5wwh39","country_code":"CN","type":"education","lineage":["https://openalex.org/I41147446"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zaihui Cui","raw_affiliation_strings":["School of Artificial Intelligence, Anshan Normal University, China"],"raw_orcid":"https://orcid.org/0009-0007-8035-9548","affiliations":[{"raw_affiliation_string":"School of Artificial Intelligence, Anshan Normal University, China","institution_ids":["https://openalex.org/I41147446"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5241,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.58254615,"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":"100","last_page":"105"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.998199999332428,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.998199999332428,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.984000027179718,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.98089998960495,"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/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8534631729125977},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7929209470748901},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7283647060394287},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6172411441802979},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5981881618499756},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5192489624023438},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5124073624610901},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.44529396295547485},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4296985864639282},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4180348515510559},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3220350742340088},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18871834874153137}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8534631729125977},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7929209470748901},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7283647060394287},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6172411441802979},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5981881618499756},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5192489624023438},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5124073624610901},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.44529396295547485},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4296985864639282},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4180348515510559},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3220350742340088},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18871834874153137},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"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.1145/3611450.3611465","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3611450.3611465","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3611450.3611465?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 3rd International Conference on Artificial Intelligence, Automation and Algorithms","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3611450.3611465","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3611450.3611465","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3611450.3611465?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 3rd International Conference on Artificial Intelligence, Automation and Algorithms","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4386013667.pdf"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1552810675","https://openalex.org/W2154929945","https://openalex.org/W2267986866","https://openalex.org/W2464532456","https://openalex.org/W2793329764","https://openalex.org/W2897297690","https://openalex.org/W3033300795","https://openalex.org/W3114186192","https://openalex.org/W3119365255","https://openalex.org/W3207816861","https://openalex.org/W4224222848","https://openalex.org/W4226398453","https://openalex.org/W6631638067","https://openalex.org/W6639553786","https://openalex.org/W6697634807","https://openalex.org/W6770912433"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W1611875833","https://openalex.org/W4245157707","https://openalex.org/W1547053391","https://openalex.org/W2208777194","https://openalex.org/W2908391583","https://openalex.org/W2392101695","https://openalex.org/W1521781013","https://openalex.org/W1997193297","https://openalex.org/W2462483068"],"abstract_inverted_index":{"In":[0,87,112],"recent":[1],"years,":[2],"self-driving":[3],"delivery":[4],"vehicles":[5,18],"have":[6],"been":[7],"used":[8,127],"more":[9,11],"and":[10,64,80,150],"widely.":[12],"The":[13,45],"route":[14],"planning":[15],"of":[16,60,76,109,147,155,161],"courier":[17,30],"can":[19],"be":[20],"abstracted":[21],"as":[22],"the":[23,29,58,74,93,101,107,110,114,117,130,134,145,148,151,156,159],"traveling":[24],"salesman":[25],"problem":[26],"(TSP).":[27],"For":[28],"vehicle":[31],"path":[32,162],"optimization":[33,40,48,96],"problem,":[34],"an":[35],"improved":[36],"population-based":[37],"ant":[38,46],"colony":[39,47],"algorithm":[41,49,56,102,120,157],"(IPACO)":[42],"is":[43,51,98,126,165],"proposed.":[44],"(ACO)":[50],"a":[52],"swarm":[53],"intelligent":[54],"bionic":[55],"with":[57,67],"advantages":[59],"positive":[61],"feedback,":[62],"robustness,":[63],"easy":[65,81],"combination":[66],"other":[68],"algorithms,":[69],"but":[70],"it":[71],"also":[72],"has":[73],"problems":[75],"low":[77],"solution":[78],"accuracy":[79],"to":[82,89,105,128,143],"fall":[83],"into":[84],"local":[85,95],"optimality.":[86],"order":[88],"avoid":[90],"these":[91],"problems,":[92],"2-opt":[94],"operator":[97],"combined":[99],"in":[100],"search":[103],"process":[104],"improve":[106],"diversity":[108],"population.":[111],"addition,":[113],"property":[115],"that":[116],"simulated":[118],"annealing":[119],"probabilistically":[121],"accepts":[122],"relatively":[123],"poor":[124],"solutions":[125],"optimize":[129],"optimal":[131],"ants":[132],"during":[133],"iterative":[135],"process.":[136],"Finally,":[137],"some":[138],"TSPLIB":[139],"examples":[140],"are":[141],"selected":[142],"verify":[144],"performance":[146],"algorithm,":[149],"fast":[152],"adaptation":[153],"capability":[154],"under":[158],"change":[160],"node":[163],"weights":[164],"verified":[166],"by":[167],"simulation.":[168]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}