{"id":"https://openalex.org/W2154110454","doi":"https://doi.org/10.1145/1543834.1543969","title":"Hybrid simulated annealing algorithm based on adaptive cooling schedule for TSP","display_name":"Hybrid simulated annealing algorithm based on adaptive cooling schedule for TSP","publication_year":2009,"publication_date":"2009-06-12","ids":{"openalex":"https://openalex.org/W2154110454","doi":"https://doi.org/10.1145/1543834.1543969","mag":"2154110454"},"language":"en","primary_location":{"id":"doi:10.1145/1543834.1543969","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1543834.1543969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation","raw_type":"proceedings-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/A5114488845","display_name":"Yi Liu","orcid":"https://orcid.org/0009-0003-2492-8970"},"institutions":[{"id":"https://openalex.org/I196699116","display_name":"Wuhan University of Technology","ror":"https://ror.org/03fe7t173","country_code":"CN","type":"education","lineage":["https://openalex.org/I196699116"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yi Liu","raw_affiliation_strings":["Wuhan University of Technology, Wuhan, China"],"affiliations":[{"raw_affiliation_string":"Wuhan University of Technology, Wuhan, China","institution_ids":["https://openalex.org/I196699116"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011707621","display_name":"Shengwu Xiong","orcid":"https://orcid.org/0000-0002-4006-7029"},"institutions":[{"id":"https://openalex.org/I196699116","display_name":"Wuhan University of Technology","ror":"https://ror.org/03fe7t173","country_code":"CN","type":"education","lineage":["https://openalex.org/I196699116"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shengwu Xiong","raw_affiliation_strings":["Wuhan University of Technology, wuhan, China"],"affiliations":[{"raw_affiliation_string":"Wuhan University of Technology, wuhan, China","institution_ids":["https://openalex.org/I196699116"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100599492","display_name":"Hongbing Liu","orcid":"https://orcid.org/0000-0002-4839-6054"},"institutions":[{"id":"https://openalex.org/I196699116","display_name":"Wuhan University of Technology","ror":"https://ror.org/03fe7t173","country_code":"CN","type":"education","lineage":["https://openalex.org/I196699116"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hongbing Liu","raw_affiliation_strings":["Wuhan University of Technology, wuhan, China"],"affiliations":[{"raw_affiliation_string":"Wuhan University of Technology, wuhan, China","institution_ids":["https://openalex.org/I196699116"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5114488845"],"corresponding_institution_ids":["https://openalex.org/I196699116"],"apc_list":null,"apc_paid":null,"fwci":0.6471,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.73754532,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"895","last_page":"898"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9959999918937683,"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.9959999918937683,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9937000274658203,"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.9933000206947327,"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/simulated-annealing","display_name":"Simulated annealing","score":0.7945460081100464},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6380722522735596},{"id":"https://openalex.org/keywords/adaptive-simulated-annealing","display_name":"Adaptive simulated annealing","score":0.6276837587356567},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5605902671813965},{"id":"https://openalex.org/keywords/annealing","display_name":"Annealing (glass)","score":0.5346433520317078},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4698713421821594},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.4243539869785309},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41486090421676636},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4108269214630127},{"id":"https://openalex.org/keywords/materials-science","display_name":"Materials science","score":0.22499078512191772},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21431559324264526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13171422481536865}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7945460081100464},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6380722522735596},{"id":"https://openalex.org/C46714192","wikidata":"https://www.wikidata.org/wiki/Q4680763","display_name":"Adaptive simulated annealing","level":3,"score":0.6276837587356567},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5605902671813965},{"id":"https://openalex.org/C2777855556","wikidata":"https://www.wikidata.org/wiki/Q4339544","display_name":"Annealing (glass)","level":2,"score":0.5346433520317078},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4698713421821594},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.4243539869785309},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41486090421676636},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4108269214630127},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.22499078512191772},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21431559324264526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13171422481536865},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1543834.1543969","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1543834.1543969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1500804564","https://openalex.org/W1503369191","https://openalex.org/W1598333137","https://openalex.org/W2024060531","https://openalex.org/W2042986967","https://openalex.org/W2046948610","https://openalex.org/W2051719061","https://openalex.org/W2054706926","https://openalex.org/W2084792706","https://openalex.org/W2339500526","https://openalex.org/W2915913997","https://openalex.org/W4298110920"],"related_works":["https://openalex.org/W2361943787","https://openalex.org/W2367577090","https://openalex.org/W2067511169","https://openalex.org/W2017461631","https://openalex.org/W2388574609","https://openalex.org/W2382715009","https://openalex.org/W2369250120","https://openalex.org/W2370946617","https://openalex.org/W2146159707","https://openalex.org/W2363104929"],"abstract_inverted_index":{"The":[0,90,108],"traveling":[1],"salesman":[2],"problem":[3,61],"is":[4,56,88,94],"one":[5],"of":[6,36,53],"the":[7,15,31,34,46,50,68,70,103,113],"most":[8],"notoriously":[9],"intractable":[10],"NP-complete":[11],"optimization":[12],"problems.":[13],"Over":[14],"last":[16],"10":[17],"years,":[18],"simulated":[19,54,76,105,124],"annealing":[20,55,77,106,125],"and":[21,49,62,83,100,127],"tabu":[22,41,80],"search":[23,42,72,81],"have":[24],"emerged":[25],"as":[26],"an":[27,64],"effective":[28],"algorithm":[29,93,115,126],"for":[30,67],"TSP.":[32],"However,":[33],"quality":[35],"solutions":[37,131],"found":[38],"by":[39],"using":[40],"approach":[43,73],"depends":[44],"on":[45,75,96],"initial":[47],"solution":[48],"iteration":[51],"process":[52],"slow.":[57],"To":[58],"overcome":[59],"this":[60],"provide":[63],"efficient":[65],"methodology":[66],"TSP,":[69],"heuristic":[71],"based":[74],"which":[78],"combining":[79],"strategy":[82],"two":[84],"neighborhood":[85],"perturbation":[86],"factor":[87],"developed.":[89],"proposed":[91,114],"hybrid":[92],"tested":[95],"standard":[97],"benchmark":[98],"sets":[99],"compared":[101,121],"with":[102,122],"conventional":[104,123],"algorithm.":[107],"computational":[109],"results":[110],"show":[111],"that":[112],"has":[116],"significantly":[117],"better":[118],"convergence":[119],"speed":[120],"can":[128],"obtain":[129],"high-quality":[130],"within":[132],"reasonable":[133],"computing":[134],"times.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}