{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T05:24:02Z","timestamp":1770528242542,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1023\/a:1009627527067","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"215-252","source":"Crossref","is-referenced-by-count":8,"title":["Rescaled Simulated Annealing\u2014Accelerating Convergence of Simulated Annealing by Rescaling the States Energies"],"prefix":"10.1007","volume":"6","author":[{"given":"L.","family":"Herault","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"262135_CR1","doi-asserted-by":"crossref","unstructured":"Aarts and Laarhoven. (1987). Simulated Annealing: Theory and Applications. Kluwer Academic Publishers.","DOI":"10.1007\/978-94-015-7744-1"},{"key":"262135_CR2","volume-title":"Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing","author":"Aarts","year":"1989","unstructured":"Aarts and Korst. (1989). Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. New York: Wiley Publishers."},{"key":"262135_CR3","doi-asserted-by":"crossref","first-page":"657","DOI":"10.2307\/3214097","volume":"24","author":"Anily","year":"1987","unstructured":"Anily and Federgruen. (1987). \u201cSimulated Annealing Methods with General Acceptance Probabilities.\u201d Journal of Applied Probability 24, 657-667.","journal-title":"Journal of Applied Probability"},{"key":"262135_CR4","volume-title":"Simulated Annealing: Parallelization Techniques","author":"Azencott","year":"1992","unstructured":"Azencott. (1992). Simulated Annealing: Parallelization Techniques. New York: Wiley Publishers."},{"key":"262135_CR5","doi-asserted-by":"crossref","unstructured":"Bilbro et al. (1990). \u201cExtraction of the Parameters of Equivalent Circuits of Microwave Transistors Using Tree Annealing.\u201d I.E.E.E. Transactions on Microwave Theory and Techniques, November.","DOI":"10.1109\/22.60019"},{"key":"262135_CR6","doi-asserted-by":"crossref","unstructured":"Bilbro and Snyder. (1991). \u201cOptimization of Functions with Many Local Minima.\u201d I.E.E.E. Transactions on Systems, Man and Cybernetics 21(4).","DOI":"10.1109\/21.108301"},{"key":"262135_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"Cerny","year":"1985","unstructured":"Cerny. (1985). \u201cA Thermodynamical Approach to the Travelling Salesman Problem: An Efficient Simulated Algorithm.\u201d Journal of Optimization Theory and Applications 45, 41-51.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"262135_CR8","unstructured":"Dowsland. (1995). \u201cSimulated Annealing.\u201d In C.R. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Optimization Problems. McGraw Hill Publishers, pp. 20-69."},{"key":"262135_CR9","volume-title":"An Introduction to Probability Theory and its Applications","author":"Feller","year":"1950","unstructured":"Feller. (1950). An Introduction to Probability Theory and its Applications. New York: Wiley Publishers."},{"issue":"2","key":"262135_CR10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF00127079","volume":"1","author":"Fleisher","year":"1995","unstructured":"Fleisher. (1995). \u201cCybernetic Optimization by Simulated Annealing: Accelerating Convergence by Parallel Processing and Probabilistic Feedback Control.\u201d Journal of Heuristics 1(2), 225-246.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"262135_CR11","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"Hajek","year":"1988","unstructured":"Hajek. (1988). \u201cCooling Schedules for Optimal Annealing.\u201d Mathematics of Operations Research 13(2), 311-329.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"262135_CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","volume":"57","author":"Hastings","year":"1970","unstructured":"Hastings. (1970). \u201cMonte Carlo Sampling Methods Using Markov Chains and Their Applications.\u201d Biometrika 57(1), 97-109.","journal-title":"Biometrika"},{"key":"262135_CR13","unstructured":"Isaacson and Madsen. (1976). Markov Chains: Theory and Applications. John Wiley Publishers."},{"key":"262135_CR14","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, Gelatt, and Vecchi. (1983). \u201cOptimization by Simulated Annealing.\u201d Science 220, 671-680.","journal-title":"Science"},{"key":"262135_CR15","doi-asserted-by":"crossref","first-page":"333","DOI":"10.4064\/cm-9-2-333-346","volume":"9","author":"Kozniewska","year":"1962","unstructured":"Kozniewska (1962). \u201cErgodicit\u00e9 et stationnarit\u00e9 des cha\u00eenes de Markov variables \u00e0 un nombre fini d'\u00e9tats possibles.\u201d Colloq. Math. 9, 333-346.","journal-title":"Colloq. Math."},{"key":"262135_CR16","unstructured":"van Laarhoven and Aarts. (1989). Simulated Annealing: Theory and Applications. Kluwer Academic Publishers."},{"key":"262135_CR17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01582166","volume":"34","author":"Lundy","year":"1986","unstructured":"Lundy and Mees. (1986). \u201cConvergence of an Annealing Algorithm.\u201d Mathematical Programming 34, 111-124.","journal-title":"Mathematical Programming"},{"key":"262135_CR18","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"Metropolis","year":"1953","unstructured":"Metropolis et al. (1953). \u201cEquation of State Calculations by Fast Computing Machines.\u201d Journal of Chemical Physics 21, 1087-1092.","journal-title":"Journal of Chemical Physics"},{"key":"262135_CR19","doi-asserted-by":"crossref","first-page":"747","DOI":"10.2307\/1427186","volume":"18","author":"Mitra","year":"1986","unstructured":"Mitra, Romeo, and Sangiovanni-Vincentelli. (1986). \u201cConvergence and Finite-Time Behavior of Simulated Annealing.\u201d Adv. Appl. Prob. 18, 747-771.","journal-title":"Adv. Appl. Prob."},{"key":"262135_CR20","unstructured":"Reinelt. (1994). The Traveling Salesman-Computational Solutions for TSP Applications. Springer Verlag Publishers."},{"key":"262135_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-32792-4","volume-title":"Non-Negative Matrices and Markov Chains","author":"Seneta","year":"1981","unstructured":"Seneta. (1981). Non-Negative Matrices and Markov Chains. New York: Springer Verlag Publishers."},{"issue":"12","key":"262135_CR22","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1016\/0167-8655(90)90034-Y","volume":"11","author":"Snyder","year":"1990","unstructured":"Snyder et al. (1990). \u201cOptimal Thresholding-A New Approach.\u201d Pattern Recognition Letters 11(12), 803-810.","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"262135_CR23","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"Verhoeven","year":"1995","unstructured":"Verhoeven and Aarts. (1995). \u201cParallel Local Search.\u201d Journal of Heuristics 1(1), 43-65.","journal-title":"Journal of Heuristics"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009627527067.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009627527067\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009627527067.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:03:38Z","timestamp":1747652618000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009627527067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["262135"],"URL":"https:\/\/doi.org\/10.1023\/a:1009627527067","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}