{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:05:46Z","timestamp":1787497546457,"version":"build-2736575974"},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0305-0548(97)00054-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:08:45Z","timestamp":1027584525000},"page":"207-217","source":"Crossref","is-referenced-by-count":116,"title":["A systematic procedure for setting parameters in simulated annealing algorithms"],"prefix":"10.1016","volume":"25","author":[{"given":"Moon-Won","family":"Park","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yeong-Dae","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(97)00054-3_BIB1","doi-asserted-by":"crossref","first-page":"657","DOI":"10.2307\/3214097","article-title":"Simulated annealing methods with general acceptance probabilities","volume":"24","author":"Anily","year":"1987","journal-title":"Journal of Applied Probability"},{"key":"10.1016\/S0305-0548(97)00054-3_BIB2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","article-title":"Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm","volume":"45","author":"Cerny","year":"1985","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/S0305-0548(97)00054-3_BIB3","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1016\/0305-0548(91)90059-Z","article-title":"A note on the effect of neighborhood structure in simulated annealing","volume":"18","author":"Cheh","year":"1991","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(97)00054-3_BIB4","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\/S0305-0548(97)00054-3_BIB5","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90001-R","article-title":"Simulated annealing: A tool for operational research","volume":"46","author":"Eglese","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(97)00054-3_BIB6","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: An experimental evaluation; Part 1, Graph partitioning","volume":"37","author":"Johnson","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00054-3_BIB7","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1016\/0305-0548(95)00079-8","article-title":"Simulated annealing and genetic algorithms for scheduling products with multi-level product structure","volume":"23","author":"Kim","year":"1996","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(97)00054-3_BIB8","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/0377-2217(95)00119-0","article-title":"Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process","volume":"91","author":"Kim","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(97)00054-3_BIB9","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\/S0305-0548(97)00054-3_BIB10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0305-0483(94)90006-X","article-title":"A survey of simulated annealing applications to operations research problem","volume":"22","author":"Koulamas","year":"1994","journal-title":"Omega"},{"key":"10.1016\/S0305-0548(97)00054-3_BIB11","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"},{"key":"10.1016\/S0305-0548(97)00054-3_BIB12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0305-0548(90)90001-N","article-title":"The application of the simulated annealing algorithm to the solution of the n\/n\/Cmax flowshop problem","volume":"17","author":"Ogbu","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(97)00054-3_BIB13","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0305-0483(91)90036-S","article-title":"Memoranda: Simulated annealing for the permutation flowshop problem","volume":"19","author":"Ogbu","year":"1990","journal-title":"Omega"},{"key":"10.1016\/S0305-0548(97)00054-3_BIB14","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","article-title":"Simulated annealing for permutation flow-shop scheduling","volume":"17","author":"Osman","year":"1989","journal-title":"Omega"},{"key":"10.1016\/S0305-0548(97)00054-3_BIB15","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1080\/07408179108963868","article-title":"Single machine tardiness sequencing heuristics","volume":"23","author":"Potts","year":"1991","journal-title":"IIE Transactions"},{"key":"10.1016\/S0305-0548(97)00054-3_BIB16","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1109\/43.46801","article-title":"Temperature measurement and equilibrium dynamics of simulated annealing placement","volume":"9","author":"Rose","year":"1990","journal-title":"IEEE Transactions on ComputerAided Design"},{"key":"10.1016\/S0305-0548(97)00054-3_BIB17","doi-asserted-by":"crossref","first-page":"441","DOI":"10.2307\/1266283","article-title":"Sequential application of simplex design of optimization and evolutionary operations","volume":"4","author":"Spendley","year":"1962","journal-title":"Technometrics"},{"key":"10.1016\/S0305-0548(97)00054-3_BIB18","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","article-title":"Job shop scheduling by simulated annealing","volume":"40","author":"Van Laarhoven","year":"1992","journal-title":"Operations Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000543?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000543?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T20:59:33Z","timestamp":1556657973000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054897000543"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0305054897000543"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(97)00054-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}