{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:47:24Z","timestamp":1762300044926,"version":"build-2065373602"},"reference-count":56,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004744","name":"Brussels Institute for scientific research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004744","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002661","name":"Fund for Scientific Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009595","name":"Walloon Public Service","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100009595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1016\/j.ejor.2022.04.014","type":"journal-article","created":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T19:31:51Z","timestamp":1649964711000},"page":"395-410","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"title":["A landscape-based analysis of fixed temperature and simulated annealing"],"prefix":"10.1016","volume":"304","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4066-0375","authenticated-orcid":false,"given":"Alberto","family":"Franzin","sequence":"first","affiliation":[]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4975","key":"10.1016\/j.ejor.2022.04.014_bib0001","doi-asserted-by":"crossref","first-page":"1409","DOI":"10.1126\/science.249.4975.1409","article-title":"Rapid determination of the critical temperature in simulated annealing inversion","volume":"249","author":"Basu","year":"1990","journal-title":"Science"},{"key":"10.1016\/j.ejor.2022.04.014_bib0002","series-title":"GECCO","first-page":"313","article-title":"Algorithm selection based on exploratory landscape analysis and cost-sensitive learning","author":"Bischl","year":"2012"},{"issue":"3","key":"10.1016\/j.ejor.2022.04.014_bib0003","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","article-title":"Metaheuristics in combinatorial optimization: overview and conceptual comparison","volume":"35","author":"Blum","year":"2003","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/j.ejor.2022.04.014_bib0004","series-title":"Handbook of combinatorial optimization","first-page":"241","article-title":"The quadratic assignment problem","volume":"vol.\u00a02","author":"Burkard","year":"1998"},{"issue":"4","key":"10.1016\/j.ejor.2022.04.014_bib0005","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","article-title":"QAPLIB\u2013a quadratic assignment problem library","volume":"10","author":"Burkard","year":"1997","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"10.1016\/j.ejor.2022.04.014_bib0006","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1137\/S1052623497329683","article-title":"Simulated annealing: Searching for an optimal temperature","volume":"9","author":"Cohn","year":"1999","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"10.1016\/j.ejor.2022.04.014_bib0007","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","article-title":"An improved annealing scheme for the QAP","volume":"46","author":"Connolly","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2022.04.014_bib0008","series-title":"Computing and software science: State of the art and perspectives","first-page":"27","article-title":"Computing in combinatorial optimization","volume":"10000","author":"Cook","year":"2019"},{"key":"10.1016\/j.ejor.2022.04.014_bib0009","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.tcs.2019.10.033","article-title":"On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem","volume":"805","author":"Dantas","year":"2020","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10.1016\/j.ejor.2022.04.014_bib0010","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","article-title":"Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing","volume":"90","author":"Dueck","year":"1990","journal-title":"Journal of Computational Physics"},{"issue":"3","key":"10.1016\/j.ejor.2022.04.014_bib0011","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/j.ejor.2016.09.055","article-title":"A new vision of approximate methods for the permutation flowshop to minimise Makespan: State-of-the-art and computational evaluation","volume":"257","author":"Fernandez-Viagas","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.04.014_bib0012","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1137\/S1052623499363955","article-title":"Simulated annealing with an optimal fixed temperature","volume":"11","author":"Fielding","year":"2000","journal-title":"SIAM Journal on Optimization"},{"year":"2014","series-title":"Manufacturing scheduling systems: An integrated view on models, methods, and tools","author":"Frami\u00f1\u00e1n","key":"10.1016\/j.ejor.2022.04.014_bib0013"},{"issue":"8","key":"10.1016\/j.ejor.2022.04.014_bib0014","doi-asserted-by":"crossref","first-page":"1741","DOI":"10.1007\/s11590-018-1240-3","article-title":"Effect of transformations of numerical parameters in automatic algorithm configuration","volume":"12","author":"Franzin","year":"2018","journal-title":"Optimization Letters"},{"key":"10.1016\/j.ejor.2022.04.014_bib0015","unstructured":"Franzin, A., & St\u00fctzle, T. (2018). Revisiting simulated annealing: a component-based analysis: Supplementaty material. http:\/\/iridia.ulb.ac.be\/supp\/IridiaSupp2018-001."},{"key":"10.1016\/j.ejor.2022.04.014_bib0016","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.cor.2018.12.015","article-title":"Revisiting simulated annealing: A component-based analysis","volume":"104","author":"Franzin","year":"2019","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2022.04.014_bib0017","unstructured":"Franzin, A., & St\u00fctzle, T. (2021). A landscape-based analysis of fixed temperature and simulated annealing: Supplementaty material. http:\/\/iridia.ulb.ac.be\/supp\/IridiaSupp2021-002."},{"key":"10.1016\/j.ejor.2022.04.014_bib0018","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.04.014_bib0019","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2307\/3318737","article-title":"An adaptive Metropolis algorithm","volume":"7","author":"Haario","year":"2001","journal-title":"Bernoulli"},{"issue":"2","key":"10.1016\/j.ejor.2022.04.014_bib0020","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","article-title":"Cooling schedules for optimal annealing","volume":"13","author":"Hajek","year":"1988","journal-title":"Mathematics of Operations Research"},{"issue":"5","key":"10.1016\/j.ejor.2022.04.014_bib0021","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0167-6911(89)90081-9","article-title":"Simulated annealing\u2013to cool or not","volume":"12","author":"Hajek","year":"1989","journal-title":"System & Control Letters"},{"issue":"2","key":"10.1016\/j.ejor.2022.04.014_bib0022","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/2076450.2076469","article-title":"Programming by optimization","volume":"55","author":"Hoos","year":"2012","journal-title":"Communications of the ACM"},{"year":"2005","series-title":"Stochastic local search\u2014Foundations and applications","author":"Hoos","key":"10.1016\/j.ejor.2022.04.014_bib0023"},{"key":"10.1016\/j.ejor.2022.04.014_bib0024","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/j.cor.2013.10.007","article-title":"Tabu search vs. simulated annealing for solving large quadratic assignment instances","volume":"43","author":"Hussin","year":"2014","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2022.04.014_bib0025","series-title":"Approximation algorithms for NP-hard problems","first-page":"482","article-title":"The Markov chain Monte Carlo method: An approach to approximate counting and integration","author":"Jerrum","year":"1996"},{"issue":"1","key":"10.1016\/j.ejor.2022.04.014_bib0026","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(97)00133-9","article-title":"The Metropolis algorithm for graph bisection","volume":"82","author":"Jerrum","year":"1998","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"10.1016\/j.ejor.2022.04.014_bib0027","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0166-218X(01)00264-5","article-title":"On the convergence of generalized hill climbing algorithms","volume":"119","author":"Johnson","year":"2002","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2022.04.014_bib0028","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/j.ejor.2022.04.014_bib0029","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","article-title":"Assignment problems and the location of economic activities","volume":"25","author":"Koopmans","year":"1957","journal-title":"Econometrica"},{"issue":"5","key":"10.1016\/j.ejor.2022.04.014_bib0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v028.i05","article-title":"Building predictive models in R using the caret package","volume":"28","author":"Kuhn","year":"2008","journal-title":"Journal of Statistical Software"},{"key":"10.1016\/j.ejor.2022.04.014_bib0031","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","article-title":"The irace package: Iterated racing for automatic algorithm configuration","volume":"3","author":"L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","journal-title":"Operations Research Perspectives"},{"issue":"1","key":"10.1016\/j.ejor.2022.04.014_bib0032","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01582166","article-title":"Convergence of an annealing algorithm","volume":"34","author":"Lundy","year":"1986","journal-title":"Mathematical Programming"},{"year":"2018","series-title":"Handbook of heuristics","author":"Mart\u00ed","key":"10.1016\/j.ejor.2022.04.014_bib0033"},{"key":"10.1016\/j.ejor.2022.04.014_bib0034","series-title":"Learning and intelligent optimization, 7th international conference, LION 7","first-page":"321","article-title":"From grammars to parameters: Automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness","volume":"vol. 7997","author":"Mascia","year":"2013"},{"issue":"6","key":"10.1016\/j.ejor.2022.04.014_bib0035","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.ipl.2007.06.016","article-title":"Simulated annealing versus Metropolis for a TSP instance","volume":"104","author":"Meer","year":"2007","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.ejor.2022.04.014_bib0036","series-title":"GECCO","first-page":"829","article-title":"Exploratory landscape analysis","author":"Mersmann","year":"2011"},{"key":"10.1016\/j.ejor.2022.04.014_bib0037","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equation\u00a0of state calculations by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"Journal of Chemical Physics"},{"key":"10.1016\/j.ejor.2022.04.014_bib0038","series-title":"Decision and control, 1985 24th IEEE conference on","first-page":"761","article-title":"Convergence and finite-time behavior of simulated annealing","author":"Mitra","year":"1985"},{"issue":"4","key":"10.1016\/j.ejor.2022.04.014_bib0039","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/0375-9601(90)90166-L","article-title":"Stochastic versus deterministic update in simulated annealing","volume":"146","author":"Moscato","year":"1990","journal-title":"Physics Letters A"},{"key":"10.1016\/j.ejor.2022.04.014_bib0040","series-title":"IEEE CEC","first-page":"1017","article-title":"Size of neighborhood more important than temperature for stochastic local search","author":"M\u00fchlenbein","year":"2000"},{"issue":"1","key":"10.1016\/j.ejor.2022.04.014_bib0041","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"Omega"},{"issue":"1","key":"10.1016\/j.ejor.2022.04.014_bib0042","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1019633214895","article-title":"Analysis of static simulated annealing algorithms","volume":"115","author":"Orosz","year":"2002","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/j.ejor.2022.04.014_bib0043","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.ejor.2019.01.018","article-title":"Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems","volume":"276","author":"Pagnozzi","year":"2019","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2022.04.014_bib0044","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ejor.2012.04.034","article-title":"Local search methods for the flowshop scheduling problem with flowtime minimization","volume":"222","author":"Pan","year":"2012","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2022.04.014_bib0045","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.cor.2012.05.018","article-title":"A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime","volume":"40","author":"Pan","year":"2013","journal-title":"Computers and Operations Research"},{"year":"2012","series-title":"Scheduling: Theory, algorithms, and systems","author":"Pinedo","key":"10.1016\/j.ejor.2022.04.014_bib0046"},{"key":"10.1016\/j.ejor.2022.04.014_bib0047","series-title":"EvoCOP","first-page":"109","article-title":"Automatic algorithm selection for the quadratic assignment problem using fitness landscape analysis","volume":"vol. 7832","author":"Pitzer","year":"2013"},{"issue":"5","key":"10.1016\/j.ejor.2022.04.014_bib0048","first-page":"1284","article-title":"Optimizing heuristic search in forest planning","volume":"7","author":"Pukkala","year":"2006","journal-title":"Nonlinear Analysis: Real World Applications"},{"issue":"12","key":"10.1016\/j.ejor.2022.04.014_bib0049","doi-asserted-by":"crossref","first-page":"2784","DOI":"10.1190\/1.1441899","article-title":"Nonlinear inversion, statistical mechanics, and residual statics estimation","volume":"50","author":"Rothman","year":"1985","journal-title":"Geophysics"},{"issue":"2","key":"10.1016\/j.ejor.2022.04.014_bib0050","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1190\/1.1442092","article-title":"Automatic estimation of large residual statics corrections","volume":"51","author":"Rothman","year":"1986","journal-title":"Geophysics"},{"issue":"2","key":"10.1016\/j.ejor.2022.04.014_bib0051","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1046\/j.1365-246X.1999.00876.x","article-title":"Geophysical inversion with a neighbourhood algorithm\u2013i. searching a parameter space","volume":"138","author":"Sambridge","year":"1999","journal-title":"Geophysical Journal International"},{"issue":"2","key":"10.1016\/j.ejor.2022.04.014_bib0052","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2022.04.014_bib0053","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","article-title":"Comparison of iterative searches for the quadratic assignment problem","volume":"3","author":"Taillard","year":"1995","journal-title":"Location Science"},{"issue":"1","key":"10.1016\/j.ejor.2022.04.014_bib0054","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","article-title":"A thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm","volume":"45","author":"\u010cern\u00fd","year":"1985","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"2","key":"10.1016\/j.ejor.2022.04.014_bib0055","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/ijoc.14.2.98.120","article-title":"Contrasting structured and random permutation flow-shop scheduling problems: Search space topology and algorithm performance","volume":"14","author":"Watson","year":"2002","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2022.04.014_bib0056","series-title":"Proceedings of the 32nd international colloquium on automata, languages and programming, ICALP 2005","first-page":"589","article-title":"Simulated annealing beats Metropolis in combinatorial optimization","volume":"vol. 3580","author":"Wegener","year":"2005"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221722003125?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221722003125?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:51:56Z","timestamp":1759841516000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221722003125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":56,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["S0377221722003125"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2022.04.014","relation":{},"ISSN":["0377-2217"],"issn-type":[{"type":"print","value":"0377-2217"}],"subject":[],"published":{"date-parts":[[2023,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A landscape-based analysis of fixed temperature and simulated annealing","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2022.04.014","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}