{"id":"https://openalex.org/W2130338985","doi":"https://doi.org/10.1109/cec.2005.1554816","title":"Optimal Simulated Annealing Schedules for Larger Problems","display_name":"Optimal Simulated Annealing Schedules for Larger Problems","publication_year":2005,"publication_date":"2005-12-13","ids":{"openalex":"https://openalex.org/W2130338985","doi":"https://doi.org/10.1109/cec.2005.1554816","mag":"2130338985"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2005.1554816","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554816","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5003386351","display_name":"W. Benfold","orcid":null},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"W. Benfold","raw_affiliation_strings":["Image, Speech and Intelligent Systems, School of Electronics and Computer Science, University of Southampton, UK","Sch. of Electron. & Comput. Sci., Southampton Univ., UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Image, Speech and Intelligent Systems, School of Electronics and Computer Science, University of Southampton, UK","institution_ids":["https://openalex.org/I43439940"]},{"raw_affiliation_string":"Sch. of Electron. & Comput. Sci., Southampton Univ., UK","institution_ids":["https://openalex.org/I43439940"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111485912","display_name":"J. Hallam","orcid":null},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"J. Hallam","raw_affiliation_strings":["Image, Speech and Intelligent Systems, School of Electronics and Computer Science, University of Southampton, UK","Sch. of Electron. & Comput. Sci., Southampton Univ., UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Image, Speech and Intelligent Systems, School of Electronics and Computer Science, University of Southampton, UK","institution_ids":["https://openalex.org/I43439940"]},{"raw_affiliation_string":"Sch. of Electron. & Comput. Sci., Southampton Univ., UK","institution_ids":["https://openalex.org/I43439940"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046941095","display_name":"Adam Pr\u00fcgel\u2010Bennett","orcid":"https://orcid.org/0000-0002-1329-5077"},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. Prugel-Bennett","raw_affiliation_strings":["Image, Speech and Intelligent Systems, School of Electronics and Computer Science, University of Southampton, UK","Sch. of Electron. & Comput. Sci., Southampton Univ., UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Image, Speech and Intelligent Systems, School of Electronics and Computer Science, University of Southampton, UK","institution_ids":["https://openalex.org/I43439940"]},{"raw_affiliation_string":"Sch. of Electron. & Comput. Sci., Southampton Univ., UK","institution_ids":["https://openalex.org/I43439940"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I43439940"],"apc_list":null,"apc_paid":null,"fwci":0.1962,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.5015807,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1119","last_page":"1126"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9909999966621399,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9886999726295471,"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/simulated-annealing","display_name":"Simulated annealing","score":0.8568285703659058},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7254894971847534},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6025778651237488},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5987432599067688},{"id":"https://openalex.org/keywords/adaptive-simulated-annealing","display_name":"Adaptive simulated annealing","score":0.5488387942314148},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5295969843864441},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4304080307483673},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4100925922393799},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3848288357257843},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3008902072906494},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.138717919588089},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0682184100151062}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.8568285703659058},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7254894971847534},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6025778651237488},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5987432599067688},{"id":"https://openalex.org/C46714192","wikidata":"https://www.wikidata.org/wiki/Q4680763","display_name":"Adaptive simulated annealing","level":3,"score":0.5488387942314148},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5295969843864441},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4304080307483673},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4100925922393799},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3848288357257843},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3008902072906494},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.138717919588089},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0682184100151062},{"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.1109/cec.2005.1554816","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554816","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on 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":6,"referenced_works":["https://openalex.org/W1964440694","https://openalex.org/W1982076795","https://openalex.org/W2009980271","https://openalex.org/W2054841302","https://openalex.org/W2054975983","https://openalex.org/W2131968264"],"related_works":["https://openalex.org/W2261837478","https://openalex.org/W2077092686","https://openalex.org/W3007136692","https://openalex.org/W1967687468","https://openalex.org/W2089397391","https://openalex.org/W2002077985","https://openalex.org/W173512906","https://openalex.org/W2382432451","https://openalex.org/W2394090522","https://openalex.org/W2979021254"],"abstract_inverted_index":{"We":[0,62],"present":[1],"a":[2,8,16,20,29,37,41,67,73,84,110,115],"method":[3],"for":[4,7],"optimizing":[5],"parameters":[6],"search":[9,22,25,45,86],"algorithm":[10],"(we":[11],"choose":[12],"simulated":[13],"annealing":[14,94],"as":[15,28,40,100,102],"specific":[17,38],"example)":[18],"on":[19,36,66],"finite":[21],"space.":[23],"The":[24,93],"is":[26,49,106],"described":[27],"Markov":[30],"process,":[31],"giving":[32],"the":[33,44,53],"average":[34],"cost":[35],"problem":[39,116],"function":[42],"of":[43],"parameters.":[46],"A":[47],"minimization":[48],"then":[50,71],"performed":[51],"over":[52,83,114],"parameter":[54,60],"space":[55],"to":[56,77,88],"provide":[57],"an":[58],"optimal":[59],"set.":[61],"demonstrate":[63],"this":[64],"technique":[65],"toy":[68],"problem;":[69],"we":[70],"use":[72],"'barrier":[74],"tree'":[75],"model":[76],"reduce":[78],"20-variable":[79],"Max-SAT":[80],"problems":[81],"from":[82],"million":[85],"points":[87],"more":[89],"manageable":[90],"30-40":[91],"states.":[92],"schedules":[95],"produced":[96],"do":[97],"not":[98],"perform":[99],"well":[101],"predicted,":[103],"but":[104],"there":[105],"some":[107],"evidence":[108],"that":[109],"single":[111],"schedule":[112],"optimized":[113],"set":[117],"may":[118],"produce":[119],"better":[120],"results.":[121]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}