{"id":"https://openalex.org/W4408815642","doi":"https://doi.org/10.1051/ro/2025031","title":"The adaptive two-stage ant colony Simulated Annealing Algorithm for solving the Traveling Salesman Problem","display_name":"The adaptive two-stage ant colony Simulated Annealing Algorithm for solving the Traveling Salesman Problem","publication_year":2025,"publication_date":"2025-03-01","ids":{"openalex":"https://openalex.org/W4408815642","doi":"https://doi.org/10.1051/ro/2025031"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2025031","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2025031","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/forth/ro240278.pdf","source":{"id":"https://openalex.org/S4393919633","display_name":"RAIRO. Operations research","issn_l":"2804-7303","issn":["2804-7303"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.rairo-ro.org/articles/ro/pdf/forth/ro240278.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102928508","display_name":"Yingnian Wu","orcid":"https://orcid.org/0000-0001-5252-7574"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yingnian Wu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100769481","display_name":"Hao Wang","orcid":"https://orcid.org/0000-0002-1444-2657"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hao Wang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079661691","display_name":"LI Man-hua","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Manhua Li","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100586721","display_name":"Hao Tan","orcid":"https://orcid.org/0009-0007-6243-1462"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hao Tan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101252326","display_name":"Ding Wang","orcid":"https://orcid.org/0000-0003-2819-0347"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ding Wang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5113267368","display_name":"Mingde Sheng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Meiqi Sheng","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5102928508"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.1489,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.96740912,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"59","issue":"2","first_page":"1199","last_page":"1213"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.8047999739646912,"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.8047999739646912,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9492075443267822},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8270078897476196},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7968465089797974},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5312079191207886},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5116177201271057},{"id":"https://openalex.org/keywords/ant","display_name":"ANT","score":0.47190171480178833},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4324905276298523},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4143680930137634},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2803182601928711}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9492075443267822},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8270078897476196},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7968465089797974},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5312079191207886},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5116177201271057},{"id":"https://openalex.org/C97467695","wikidata":"https://www.wikidata.org/wiki/Q295802","display_name":"ANT","level":2,"score":0.47190171480178833},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4324905276298523},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4143680930137634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2803182601928711},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1051/ro/2025031","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2025031","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/forth/ro240278.pdf","source":{"id":"https://openalex.org/S4393919633","display_name":"RAIRO. Operations research","issn_l":"2804-7303","issn":["2804-7303"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1051/ro/2025031","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2025031","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/forth/ro240278.pdf","source":{"id":"https://openalex.org/S4393919633","display_name":"RAIRO. Operations research","issn_l":"2804-7303","issn":["2804-7303"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4408815642.pdf"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W163172025","https://openalex.org/W1801849579","https://openalex.org/W1985532792","https://openalex.org/W2002721235","https://openalex.org/W2024060531","https://openalex.org/W2056760934","https://openalex.org/W2148779666","https://openalex.org/W2154929945","https://openalex.org/W2211122875","https://openalex.org/W2239574596","https://openalex.org/W2277700176","https://openalex.org/W2440923501","https://openalex.org/W2604774049","https://openalex.org/W2625783081","https://openalex.org/W2754599614","https://openalex.org/W2815812568","https://openalex.org/W2915338839","https://openalex.org/W2994566040","https://openalex.org/W3103176522","https://openalex.org/W3139531072","https://openalex.org/W3162839318","https://openalex.org/W3184422695","https://openalex.org/W4387264017","https://openalex.org/W4389081836"],"related_works":["https://openalex.org/W4245157707","https://openalex.org/W2208777194","https://openalex.org/W2908391583","https://openalex.org/W2392101695","https://openalex.org/W2406404685","https://openalex.org/W2369428395","https://openalex.org/W4237535716","https://openalex.org/W2361943787","https://openalex.org/W4312532478","https://openalex.org/W1997193297"],"abstract_inverted_index":{"In":[0],"the":[1,5,11,24,35,44,56,60,66,81,92],"process":[2],"of":[3,59,68],"solving":[4,65],"Traveling":[6],"Salesman":[7],"Problem":[8],"(TSP),":[9],"both":[10],"Ant":[12,36],"Colony":[13,37],"Optimization":[14,38],"and":[15,48,72,102],"Simulated":[16,45,61,82],"Annealing":[17,46,62,83],"Algorithm":[18],"exhibit":[19],"different":[20],"limitations":[21,32],"depending":[22],"on":[23,55,88],"dataset.":[25],"This":[26],"paper":[27],"aims":[28],"to":[29,106],"address":[30],"these":[31],"by":[33],"Using":[34],"as":[39],"a":[40],"search":[41,52,57],"strategy":[42],"for":[43],"algorithm":[47,93],"designs":[49],"two":[50],"adaptive":[51],"stages":[53],"based":[54],"characteristics":[58],"algorithm.":[63,84],"Thus":[64],"problem":[67],"slow":[69],"convergence":[70,100],"speed":[71,101],"easy":[73],"getting":[74],"stuck":[75],"in":[76,80,95],"local":[77],"optimal":[78],"solutions":[79],"By":[85],"conducting":[86],"tests":[87],"various":[89],"TSPLIB":[90],"datasets,":[91],"proposed":[94],"this":[96],"article":[97],"demonstrates":[98],"improved":[99,117],"solution":[103],"quality":[104],"compared":[105],"traditional":[107],"algorithms.":[108,118],"Furthermore,":[109],"it":[110],"exhibits":[111],"certain":[112],"advantages":[113],"over":[114],"other":[115],"existing":[116]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-11T06:11:40.159057","created_date":"2025-03-26T00:00:00"}