{"id":"https://openalex.org/W7202173104","doi":"https://doi.org/10.3390/math14203815","title":"Collaborative Attention Ant Colony Optimization for Large-Scale Traveling Salesman Problems","display_name":"Collaborative Attention Ant Colony Optimization for Large-Scale Traveling Salesman Problems","publication_year":2026,"publication_date":"2026-10-20","ids":{"openalex":"https://openalex.org/W7202173104","doi":"https://doi.org/10.3390/math14203815"},"language":"en","primary_location":{"id":"doi:10.3390/math14203815","doi":"https://doi.org/10.3390/math14203815","is_oa":true,"landing_page_url":"https://doi.org/10.3390/math14203815","pdf_url":null,"source":{"id":"https://openalex.org/S4210192031","display_name":"Mathematics","issn_l":"2227-7390","issn":["2227-7390"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["anvur-scientific","cwts-core","doaj","poland-20","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.3390/math14203815","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100459335","display_name":"Kexin Zhang","orcid":"https://orcid.org/0000-0002-1951-1439","observed_orcids":["https://orcid.org/0000-0002-1951-1439"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kexin Zhang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Shubin Liu","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shubin Liu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5146454644","display_name":"Xinyuan Zhang","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xinyuan Zhang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5146439154","display_name":"Jun Zhang","orcid":"https://orcid.org/0000-0001-7835-9871","observed_orcids":["https://orcid.org/0000-0001-7835-9871"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jun Zhang","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-7835-9871","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2600,"currency":"CHF","value_usd":3137},"apc_paid":{"value":2600,"currency":"CHF","value_usd":3137},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.50450566,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"20","first_page":"3815","last_page":"3815"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9901999831199646,"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.9901999831199646,"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.009399999864399433,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9079999923706055},{"id":"https://openalex.org/keywords/ant-colony-optimization","display_name":"ant colony optimization","score":0.9120000004768372},{"id":"https://openalex.org/keywords/local-improvement","display_name":"local improvement","score":0.42500001192092896}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8849999904632568},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.6980999708175659},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6733999848365784},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5918999910354614},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5072000026702881},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4645000100135803},{"id":"https://openalex.org/C188919014","wikidata":"https://www.wikidata.org/wiki/Q5422296","display_name":"Extremal optimization","level":4,"score":0.45660001039505005},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.43209999799728394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40299999713897705},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.39890000224113464},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3984000086784363},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.39410001039505005},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3806999921798706},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.3368000090122223},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.33180001378059387},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3248000144958496},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.31520000100135803},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.311599999666214},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.30889999866485596},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.28369998931884766},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.28200000524520874},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2782000005245209},{"id":"https://openalex.org/C184879717","wikidata":"https://www.wikidata.org/wiki/Q1374523","display_name":"Nearest neighbour algorithm","level":3,"score":0.2581999897956848},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.2531000077724457},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25209999084472656}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/math14203815","doi":"https://doi.org/10.3390/math14203815","is_oa":true,"landing_page_url":"https://doi.org/10.3390/math14203815","pdf_url":null,"source":{"id":"https://openalex.org/S4210192031","display_name":"Mathematics","issn_l":"2227-7390","issn":["2227-7390"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["anvur-scientific","cwts-core","doaj","poland-20","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics","raw_type":"journal-article"},{"id":"doi:10.20944/preprints202608.0566.v1","doi":"https://doi.org/10.20944/preprints202608.0566.v1","is_oa":true,"landing_page_url":"https://doi.org/10.20944/preprints202608.0566.v1","pdf_url":null,"source":{"id":"https://openalex.org/S6309402219","display_name":"Preprints.org","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},{"id":"pmh:oai:doaj.org/article:e7bb8d8ac35447f5b927a1f63875eeb4","doi":null,"is_oa":false,"landing_page_url":"https://doaj.org/article/e7bb8d8ac35447f5b927a1f63875eeb4","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,"listed_in":[],"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":"Mathematics, Vol 14, Iss 20, p 3815 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/math14203815","doi":"https://doi.org/10.3390/math14203815","is_oa":true,"landing_page_url":"https://doi.org/10.3390/math14203815","pdf_url":null,"source":{"id":"https://openalex.org/S4210192031","display_name":"Mathematics","issn_l":"2227-7390","issn":["2227-7390"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["anvur-scientific","cwts-core","doaj","poland-20","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1555689267","https://openalex.org/W1801849579","https://openalex.org/W1972978214","https://openalex.org/W2017708378","https://openalex.org/W2042986967","https://openalex.org/W2066356146","https://openalex.org/W2106378689","https://openalex.org/W2107941094","https://openalex.org/W2148673189","https://openalex.org/W2148948822","https://openalex.org/W2154929945","https://openalex.org/W2163428398","https://openalex.org/W2900896126","https://openalex.org/W3009304813","https://openalex.org/W3016616254","https://openalex.org/W3045206925","https://openalex.org/W3045636645","https://openalex.org/W3082119399","https://openalex.org/W3088853939","https://openalex.org/W3115222751","https://openalex.org/W3157599146","https://openalex.org/W3162281028","https://openalex.org/W4214585224","https://openalex.org/W4214849974","https://openalex.org/W4246565613","https://openalex.org/W4284694767","https://openalex.org/W4284977760","https://openalex.org/W4285392429","https://openalex.org/W4293232940","https://openalex.org/W4299796063","https://openalex.org/W4313485422","https://openalex.org/W4323543470","https://openalex.org/W4380370719","https://openalex.org/W4384008338","https://openalex.org/W4387957204","https://openalex.org/W4388416312","https://openalex.org/W7133207347","https://openalex.org/W7133213857"],"related_works":["https://openalex.org/W4389298312","https://openalex.org/W4214585224","https://openalex.org/W7166639249","https://openalex.org/W4415032795","https://openalex.org/W7215060146","https://openalex.org/W1987450220","https://openalex.org/W2371501846","https://openalex.org/W1610437755","https://openalex.org/W4389492845","https://openalex.org/W2750711431"],"abstract_inverted_index":{"Collaborative":[0],"Attention":[1],"Ant":[2,17],"Colony":[3],"Optimization":[4],"(CAACO)":[5],"integrates":[6],"a":[7,94],"deterministic":[8],"coordinate-based":[9],"attention":[10,31],"prior":[11,32],"with":[12,93],"subpath":[13,50],"decomposition,":[14],"memetic":[15],"MAX\u2013MIN":[16],"System":[18],"search,":[19,51],"and":[20,36,55,58,68,90,133],"double-bridge":[21],"perturbation":[22,56],"for":[23,97],"the":[24,60,110,130],"symmetric":[25],"Euclidean":[26],"Traveling":[27],"Salesman":[28],"Problem.":[29],"The":[30,124],"combines":[33],"coordinate-direction":[34],"compatibility":[35],"distance":[37],"information":[38],"to":[39],"guide":[40],"candidate":[41],"selection":[42],"without":[43],"model":[44],"training.":[45],"Random-offset":[46],"slicing":[47],"organizes":[48],"endpoint-constrained":[49],"while":[52],"local":[53],"improvement":[54],"refine":[57],"diversify":[59],"tour.":[61],"An":[62],"exploratory":[63],"comparison":[64],"of":[65,78,138],"Full":[66,98],"CAACO":[67,99],"CAACO-KNN":[69],"uses":[70],"30":[71],"recorded":[72],"runs":[73],"per":[74],"configuration":[75],"on":[76,100,129],"each":[77],"eight":[79,111],"EUC_2D":[80],"benchmark":[81],"instances.":[82,102],"Average":[83],"instance-level":[84],"mean":[85,96],"GAP":[86],"values":[87],"are":[88],"2.945%":[89],"3.222%,":[91],"respectively,":[92],"lower":[95],"six":[101],"A":[103],"two-sided":[104],"exact":[105],"Wilcoxon":[106],"signed-rank":[107],"test":[108],"over":[109],"instance":[112],"means":[113],"gives":[114],"p=0.0391;":[115],"four":[116],"per-instance":[117],"comparisons":[118],"remain":[119],"significant":[120],"after":[121],"Holm":[122],"correction.":[123],"results":[125],"characterize":[126],"configuration-level":[127],"performance":[128],"selected":[131],"benchmarks":[132],"motivate":[134],"further":[135],"controlled":[136],"evaluation":[137],"attention-guided":[139],"search.":[140]},"counts_by_year":[],"updated_date":"2026-11-09T13:22:03.289127","created_date":"2026-08-12T00:00:00"}