{"id":"https://openalex.org/W3192874972","doi":"https://doi.org/10.1109/ssp49050.2021.9513782","title":"Simulated Annealing: a Review and a New Scheme","display_name":"Simulated Annealing: a Review and a New Scheme","publication_year":2021,"publication_date":"2021-07-11","ids":{"openalex":"https://openalex.org/W3192874972","doi":"https://doi.org/10.1109/ssp49050.2021.9513782","mag":"3192874972"},"language":"en","primary_location":{"id":"doi:10.1109/ssp49050.2021.9513782","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssp49050.2021.9513782","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Statistical Signal Processing Workshop (SSP)","raw_type":"proceedings-article"},"type":"review","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/20.500.11820/3f3d1556-ec37-40de-a856-2fc812d00b46","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085457077","display_name":"Thomas Guilmeau","orcid":"https://orcid.org/0000-0002-8484-6550"},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210107720","display_name":"CentraleSup\u00e9lec","ror":"https://ror.org/019tcpt25","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I4210107720"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Thomas Guilmeau","raw_affiliation_strings":["CentraleSup\u00e9lec, Inria, CVN, Universit\u00e9 Paris-Saclay, Gif-sur-Yvette, France"],"affiliations":[{"raw_affiliation_string":"CentraleSup\u00e9lec, Inria, CVN, Universit\u00e9 Paris-Saclay, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I4210107720","https://openalex.org/I277688954"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062777204","display_name":"\u00c9milie Chouzenoux","orcid":"https://orcid.org/0000-0003-3631-6093"},"institutions":[{"id":"https://openalex.org/I4210107720","display_name":"CentraleSup\u00e9lec","ror":"https://ror.org/019tcpt25","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I4210107720"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Emilie Chouzenoux","raw_affiliation_strings":["CentraleSup\u00e9lec, Inria, CVN, Universit\u00e9 Paris-Saclay, Gif-sur-Yvette, France"],"affiliations":[{"raw_affiliation_string":"CentraleSup\u00e9lec, Inria, CVN, Universit\u00e9 Paris-Saclay, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I4210107720","https://openalex.org/I277688954"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026700953","display_name":"V. D. Elvira","orcid":"https://orcid.org/0000-0003-4446-4395"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Victor Elvira","raw_affiliation_strings":["School of Mathematics, University of Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5085457077"],"corresponding_institution_ids":["https://openalex.org/I277688954","https://openalex.org/I4210107720"],"apc_list":null,"apc_paid":null,"fwci":7.8853,"has_fulltext":true,"cited_by_count":135,"citation_normalized_percentile":{"value":0.9784442,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"101","last_page":"105"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9986000061035156,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9986000061035156,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9977999925613403,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/maxima-and-minima","display_name":"Maxima and minima","score":0.8532515168190002},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.831142783164978},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7031847238540649},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.604184091091156},{"id":"https://openalex.org/keywords/adaptive-simulated-annealing","display_name":"Adaptive simulated annealing","score":0.5809084177017212},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5438244342803955},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4747909903526306},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4510745406150818},{"id":"https://openalex.org/keywords/acceleration","display_name":"Acceleration","score":0.4443521499633789},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.4187372922897339},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3904343247413635},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3230242133140564},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16971781849861145}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.8532515168190002},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.831142783164978},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7031847238540649},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.604184091091156},{"id":"https://openalex.org/C46714192","wikidata":"https://www.wikidata.org/wiki/Q4680763","display_name":"Adaptive simulated annealing","level":3,"score":0.5809084177017212},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5438244342803955},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4747909903526306},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4510745406150818},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.4443521499633789},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.4187372922897339},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3904343247413635},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3230242133140564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16971781849861145},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ssp49050.2021.9513782","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssp49050.2021.9513782","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Statistical Signal Processing Workshop (SSP)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/3f3d1556-ec37-40de-a856-2fc812d00b46","is_oa":true,"landing_page_url":"https://hdl.handle.net/20.500.11820/3f3d1556-ec37-40de-a856-2fc812d00b46","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Guilmeau, T, Chouzenoux, E & Elvira, V 2021, 'Simulated annealing: a review and a new scheme', Paper presented at 2021 IEEE Statistical Signal Processing Workshop, 11/07/02 - 14/07/21. https://doi.org/10.1109/SSP49050.2021.9513782","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.ed.ac.uk:publications/3f3d1556-ec37-40de-a856-2fc812d00b46","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/3f3d1556-ec37-40de-a856-2fc812d00b46","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/3f3d1556-ec37-40de-a856-2fc812d00b46","is_oa":true,"landing_page_url":"https://hdl.handle.net/20.500.11820/3f3d1556-ec37-40de-a856-2fc812d00b46","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Guilmeau, T, Chouzenoux, E & Elvira, V 2021, 'Simulated annealing: a review and a new scheme', Paper presented at 2021 IEEE Statistical Signal Processing Workshop, 11/07/02 - 14/07/21. https://doi.org/10.1109/SSP49050.2021.9513782","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W170526737","https://openalex.org/W1513081986","https://openalex.org/W1976307568","https://openalex.org/W1996256651","https://openalex.org/W2024060531","https://openalex.org/W2024672209","https://openalex.org/W2032479603","https://openalex.org/W2038495454","https://openalex.org/W2056674749","https://openalex.org/W2063494315","https://openalex.org/W2077370047","https://openalex.org/W2112341314","https://openalex.org/W2116626386","https://openalex.org/W2120575449","https://openalex.org/W2121716262","https://openalex.org/W2140014834","https://openalex.org/W2142623799","https://openalex.org/W2154061444","https://openalex.org/W2317744239","https://openalex.org/W2727594204","https://openalex.org/W2746420172","https://openalex.org/W2969215180","https://openalex.org/W3090482648","https://openalex.org/W3091997813"],"related_works":["https://openalex.org/W2132461435","https://openalex.org/W2077092686","https://openalex.org/W2261837478","https://openalex.org/W3007136692","https://openalex.org/W1967687468","https://openalex.org/W2460653416","https://openalex.org/W2002077985","https://openalex.org/W2089397391","https://openalex.org/W1992534732","https://openalex.org/W2018121660"],"abstract_inverted_index":{"Finding":[0],"the":[1,39,42,49,99],"global":[2,50],"minimum":[3],"of":[4,30,41,70,101,108],"a":[5,10,28,64,78,90],"nonconvex":[6],"optimization":[7,32],"problem":[8],"is":[9,27,53,73,120],"notoriously":[11],"hard":[12],"task":[13],"appearing":[14],"in":[15],"numerous":[16],"applications,":[17],"from":[18,63],"signal":[19],"processing":[20],"to":[21,48,56,117],"machine":[22],"learning.":[23],"Simulated":[24],"annealing":[25],"(SA)":[26],"family":[29],"stochastic":[31],"methods":[33,119],"where":[34],"an":[35],"artificial":[36],"temperature":[37],"controls":[38],"exploration":[40],"search":[43],"space":[44],"while":[45],"preserving":[46],"convergence":[47,66],"minima.":[51],"SA":[52,82,92],"efficient,":[54],"easy":[55],"implement,":[57],"and":[58,83],"theoretically":[59],"sound,":[60],"but":[61],"suffers":[62],"slow":[65],"rate.":[67],"The":[68],"purpose":[69],"this":[71,109],"work":[72],"two-fold.":[74],"First,":[75],"we":[76,88],"provide":[77],"comprehensive":[79],"overview":[80],"on":[81,122],"its":[84],"accelerated":[85],"variants.":[86],"Second,":[87],"propose":[89],"novel":[91],"scheme":[93],"called":[94],"curious":[95],"simulated":[96],"annealing,":[97],"combining":[98],"assets":[100],"two":[102],"recent":[103],"acceleration":[104],"strategies.":[105],"Theoretical":[106],"guarantees":[107],"algorithm":[110],"are":[111],"provided.":[112],"Its":[113],"performance":[114],"with":[115],"respect":[116],"existing":[118],"illustrated":[121],"practical":[123],"examples.":[124]},"counts_by_year":[{"year":2026,"cited_by_count":15},{"year":2025,"cited_by_count":64},{"year":2024,"cited_by_count":35},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}