{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T07:35:41Z","timestamp":1782891341424,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":119,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540929093","type":"print"},{"value":"9783540929109","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-540-92910-9_49","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T14:54:06Z","timestamp":1345906446000},"page":"1623-1655","source":"Crossref","is-referenced-by-count":122,"title":["Simulated Annealing"],"prefix":"10.1007","author":[{"given":"Kathryn A.","family":"Dowsland","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan M.","family":"Thompson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"49_CR00491","volume-title":"Simulated annealing and Boltzmann machines","author":"EHL Aarts","year":"1989","unstructured":"Aarts EHL, Korst JHM (1989) Simulated annealing and Boltzmann machines. Wiley, Chichester"},{"key":"49_CR00492","first-page":"193","volume":"40","author":"EHL Aarts","year":"1985","unstructured":"Aarts EHL, Van Laarhoven PJM (1985) Statistical cooling: a general approach to combinatorial optimisation problems. Philips J Res 40:193\u2013226","journal-title":"Philips J Res"},{"key":"49_CR00493","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/0-387-28356-0_7","volume-title":"Search methodologies","author":"EHL Aarts","year":"2005","unstructured":"Aarts EHL, Korst JHM, Michiels W (2005) Simulated annealing. In: Burke EK, Kendall G (eds) Search methodologies. Springer, New York, pp 187\u2013210"},{"key":"49_CR00494","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/mnsc.37.1.98","volume":"37","author":"D Abramson","year":"1991","unstructured":"Abramson D (1991) Constructing school timetables using simulated annealing: sequential and parallel algorithms. Manag Sci 37:98\u2013113","journal-title":"Manag Sci"},{"key":"49_CR00495","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1287\/mnsc.45.5.748","volume":"45","author":"MH Alrefaei","year":"1999","unstructured":"Alrefaei MH, Andradottir S (1999) A simulated annealing algorithm with constant temperature for discrete stochastic optimisation. Manag Sci 45:748\u2013764","journal-title":"Manag Sci"},{"key":"49_CR00496","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1057\/palgrave.jors.2602301","volume":"59","author":"F Altiparmak","year":"2008","unstructured":"Altiparmak F, Karaoglan I (2008) An adaptive tabu-simulated annealing for concave cost transportation problems. J Operational Res Soc 59:331\u2013341","journal-title":"J Operational Res Soc"},{"key":"49_CR00497","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10951-006-7187-8","volume":"9","author":"A Anagnostopoulos","year":"2006","unstructured":"Anagnostopoulos A, Michel L, Van Hentenryck P, Vergados YA (2006) Simulated annealing approach to the traveling tournament problem. J Scheduling 9:177\u2013193","journal-title":"J Scheduling"},{"issue":"12","key":"49_CR00498","doi-asserted-by":"crossref","first-page":"2202","DOI":"10.1016\/j.asr.2005.06.075","volume":"37","author":"K Arai","year":"2006","unstructured":"Arai K, Sakakibara J (2006) Estimation of sea surface temperature, wind speed and water vapour with microwave radiometer data based on simulated annealing. Adv Space Res 37(12):2202\u20132207","journal-title":"Adv Space Res"},{"issue":"4","key":"49_CR00499","doi-asserted-by":"crossref","first-page":"2439","DOI":"10.1016\/S0305-0548(03)00197-7","volume":"31","author":"N Azizi","year":"2004","unstructured":"Azizi N, Zolfaghari S (2004) Adaptive temperature control for simulated annealing: a comparative study. Comput Operations Res 31(4):2439\u20132451","journal-title":"Comput Operations Res"},{"key":"49_CR004910","volume-title":"Proceedings of PATAT 2006, Brno, Czech Republic, August\u2013September 2006. Lecture notes in computer science","author":"R Bai","year":"2006","unstructured":"Bai R, Burke EK, Kendall G, McCollum B (2006) A simulated annealing hyper-heuristic for university course timetabling. In: Burke EK, Rudova H (eds) In: Proceedings of PATAT 2006, Brno, Czech Republic, August\u2013September 2006. Lecture notes in computer science, vol 3867. Springer, Heidelberg"},{"key":"49_CR004911","author":"L Bianci","year":"2008","unstructured":"Bianci L, Dorigo M, Gambardella LM, Gutjahr WJ (2008) A survey on metaheuristics for stochastic combinatorial optimisation. Nat Comput. DOI 101007, Online September 2008","journal-title":"Nat Comput"},{"key":"49_CR004912","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0167-6911(94)90028-0","volume":"22","author":"KD Boese","year":"1994","unstructured":"Boese KD, Kahng AB (1994) Best-so-far vs. where-you-are: implications for optimal finite time annealing. Syst Control Lett 22:71\u201378","journal-title":"Syst Control Lett"},{"key":"49_CR004913","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/1026105","volume":"26","author":"E Bonomi","year":"1984","unstructured":"Bonomi E, Lutton JL (1984) The N-city travelling salesman problem: statistical mechanics and the Metropolis algorithm. SIAM Rev 26:551\u2013568","journal-title":"SIAM Rev"},{"key":"49_CR004914","first-page":"235","volume-title":"Proceedings of the 3rd international conference on simulation in manufacturing, Turin, Italy, November 1987","author":"P Brandimarte","year":"1987","unstructured":"Brandimarte P, Conterno R, Laface P (1987) FMS production scheduling by simulated annealing. In: Micheletti GF (ed) Proceedings of the 3rd international conference on simulation in manufacturing, Turin, Italy, November 1987. Springer, Berlin, pp 235\u2013245"},{"key":"49_CR004915","first-page":"684","volume-title":"Proceedings of the 1988 winter simulation conference, San Diego, CA, December 1998","author":"AA Bulgak","year":"1988","unstructured":"Bulgak AA, Sanders JL (1988) Integrating a modified simulated annealing algorithm with the simulation of a manufacturing system to optimise buffer sizes in automatic assembly systems. In: Abrams M, Haigh P, Comfort J (eds) Proceedings of the 1988 winter simulation conference, San Diego, CA, December 1998. IEEE Press, Piscataway, NJ, pp 684\u2013690"},{"issue":"3","key":"49_CR004916","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1287\/ijoc.1080.0306","volume":"21","author":"EK Burke","year":"2008","unstructured":"Burke EK, Kendall G, Whitwell G (2008) A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock cutting problem. INFORMS J Comput 21(3):505\u2013516","journal-title":"INFORMS J Comput"},{"key":"49_CR004917","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V \u010cerny","year":"1985","unstructured":"\u010cerny V (1985) A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. J Optimization Theory Appl 45:41\u201355","journal-title":"J Optimization Theory Appl"},{"key":"49_CR004918","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/S0377-2217(87)80148-0","volume":"32","author":"M Chams","year":"1987","unstructured":"Chams M, Hertz A, De Werra D (1987) Some experiments with simulated annealing for colouring graphs. Eur J Operational Res 32:260\u2013266","journal-title":"Eur J Operational Res"},{"key":"49_CR004919","first-page":"37","volume-title":"Parallel simulated annealing strategies for VLSI cell placement","author":"JA Chandy","year":"1996","unstructured":"Chandy JA, Banerjee P (1996) Parallel simulated annealing strategies for VLSI cell placement. In: Proceedings of the 9th conference on VLSI design, Bangalore, India, January 1996. IEEE Computer Society, Washington, pp 37\u201342"},{"issue":"4","key":"49_CR004920","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1049\/ip-gtd:20040645","volume":"151","author":"YL Chen","year":"2004","unstructured":"Chen YL, Ke YL (2004) Multi-objective VAr planning for large-scale power systems using projection-based two-layer simulated annealing algorithms. IEE Proc Generation, Transm Distribution 151(4):555\u2013560","journal-title":"Transm Distribution"},{"issue":"3\u20134","key":"49_CR004921","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0165-1889(00)00030-0","volume":"25","author":"S-H Chen","year":"2001","unstructured":"Chen S-H, Yeh C-H (2001) Evolving traders and the business school with genetic programming: a new architecture of the agent based artificial stock market. J Econ Dyn Control 25 (3\u20134):363\u2013393","journal-title":"J Econ Dyn Control"},{"key":"49_CR004922","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/11424925_45","volume":"3483","author":"C-H Chen","year":"2005","unstructured":"Chen C-H, Ting C-J, Chang P-C (2005) Applying a hybrid ant colony system to the vehicle routing problem. Lect Notes Comput Sci 3483:417\u2013426","journal-title":"Lect Notes Comput Sci"},{"issue":"1","key":"49_CR004923","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.artmed.2004.01.013","volume":"32","author":"K-S Choi","year":"2004","unstructured":"Choi K-S, Sun H, Heng P-A (2004) An efficient and scalable deformable model for virtual reality-based medical applications. Artif Intell Med 32(1):51\u201369","journal-title":"Artif Intell Med"},{"key":"49_CR004924","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","volume":"46","author":"DT Connolly","year":"1990","unstructured":"Connolly DT (1990) An improved annealing scheme for the QAP. Eur J Operational Res 46:93\u2013100","journal-title":"Eur J Operational Res"},{"key":"49_CR004925","doi-asserted-by":"crossref","unstructured":"Cook SA (1971) The complexity of theorem procedures. In: Proceedings of 3rd ACM symposium on the theory of computing, Shaker Heights, OH, 1971. ACM, New York, pp 151\u2013158","DOI":"10.1145\/800157.805047"},{"key":"49_CR004926","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1145\/358141.358144","volume":"26","author":"SA Cook","year":"1972","unstructured":"Cook SA (1972) An overview of computational complexity. Commun ACM 26:400\u2013408","journal-title":"Commun ACM"},{"issue":"23","key":"49_CR004927","doi-asserted-by":"crossref","first-page":"5729","DOI":"10.1088\/0264-9381\/24\/23\/001","volume":"24","author":"NJ Cornish","year":"2007","unstructured":"Cornish NJ, Porter EK (2007) The search for massive black hole binaries with LISA. Classical Quantum Gravity 24(23):5729\u20135755","journal-title":"Classical Quantum Gravity"},{"issue":"10","key":"49_CR004928","doi-asserted-by":"crossref","first-page":"2500","DOI":"10.1139\/x05-139","volume":"35","author":"KA Crowe","year":"2005","unstructured":"Crowe KA, Nelson JD (2005) An evaluation of the simulated annealing algorithm for solving the area-restricted harvest-scheduling model against optimal benchmarks. Can J Forest Res 35(10):2500\u20132509","journal-title":"Can J Forest Res"},{"issue":"13","key":"49_CR004929","doi-asserted-by":"crossref","first-page":"2486","DOI":"10.1002\/qua.21666","volume":"108","author":"MD De Andrade","year":"2008","unstructured":"De Andrade MD, Nascimento MAC, Mundim KC, Sobrinho AMC, Malbouisson LAC (2008) Atomic basis sets optimization using the generalized simulated annealing approach: new basis sets for the first row elements. Int J Quantum Chem 108(13):2486\u20132498","journal-title":"Int J Quantum Chem"},{"issue":"4","key":"49_CR004930","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s00158-007-0096-4","volume":"34","author":"SO Degertekin","year":"2007","unstructured":"Degertekin SO (2007) A comparison of simulated annealing and genetic algorithm for optimum design of nonlinear steel space frames. Struct Multidisciplinary Optimization 34(4):347\u2013359","journal-title":"Struct Multidisciplinary Optimization"},{"key":"49_CR004931","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0377-2217(93)90195-S","volume":"68","author":"KA Dowsland","year":"1993","unstructured":"Dowsland KA (1993a) Some experiments with simulated annealing techniques for packing problems. Eur J Operational Res 68:389\u2013399","journal-title":"Eur J Operational Res"},{"key":"49_CR004932","volume-title":"Applied simulated annealing. Lecture notes in economics and mathematical systems","author":"KA Dowsland","year":"1993","unstructured":"Dowsland KA (1993b) Using simulated annealing for efficient allocation of students to practical classes. In: Vidal RVV (ed) Applied simulated annealing. Lecture notes in economics and mathematical systems, vol 396. Springer-Verlag, Berlin"},{"key":"49_CR004933","first-page":"637","volume":"25","author":"KA Dowsland","year":"1988","unstructured":"Dowsland KA, Thompson JM (1998) A robust simulated annealing based examination timetabling system. Comput Oper Res 25:637\u2013648","journal-title":"Comput Oper Res"},{"issue":"3","key":"49_CR004934","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.ejor.2005.03.058","volume":"179","author":"KA Dowsland","year":"2007","unstructured":"Dowsland KA, Soubeiga E, Burke EK (2007) A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation. Eur J Oper Res 179(3):759\u2013774","journal-title":"Eur J Oper Res"},{"key":"49_CR004935","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G Dueck","year":"1990","unstructured":"Dueck G, Sheuer T (1990) Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 90:161\u2013175","journal-title":"J Comput Phys"},{"key":"49_CR004936","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Paths, trees and flowers. Can J Maths 17:449\u2013467","journal-title":"Can J Maths"},{"issue":"4","key":"49_CR004937","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1016\/j.cor.2007.12.004","volume":"36","author":"J Egeblad","year":"2009","unstructured":"Egeblad J, Pisinger D (2009) Heuristic approaches for the two and three dimensional knapsack packing problem. Comput Oper Res 36(4):1026\u20131049","journal-title":"Comput Oper Res"},{"issue":"3","key":"49_CR004938","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90001-R","volume":"46","author":"RW Eglese","year":"1990","unstructured":"Eglese RW (1990) Simulated annealing: a general tool for operational research. Eur J Oper Res 46(3):271\u2013281","journal-title":"Eur J Oper Res"},{"issue":"3","key":"49_CR004939","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/j.ejor.2007.07.004","volume":"190","author":"ET Erdemir","year":"2008","unstructured":"Erdemir ET, Batta R, Spielman S, Rogerson PA, Blatt A, Flanigan M (2008) Location coverage models with demand originating from nodes and paths: application to cellular network design. Eur J Oper Res 190(3):610\u2013632","journal-title":"Eur J Oper Res"},{"key":"49_CR004940","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"TA Feo","year":"1994","unstructured":"Feo TA, Resende MGC, Smith SH (1994) A greedy randomised adaptive search procedure for maximum independent set. Oper Res 42:860\u2013878","journal-title":"Oper Res"},{"key":"49_CR004941","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/ijoc.11.1.35","volume":"11","author":"M Fleischer","year":"1999","unstructured":"Fleischer M, Jacobson SH (1999) Information theory and the finite time behavior of the simulated annealing algorithm: experimental results. INFORMS J Comput 11:35\u201343","journal-title":"INFORMS J Comput"},{"key":"49_CR004942","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0893-9659(02)00140-4","volume":"16","author":"A Franz","year":"2003","unstructured":"Franz A, Hoffmann KH (2003) Threshold accepting as limit case for a modified Tsallis statistics. Appl Math Lett 16:27\u201331","journal-title":"Appl Math Lett"},{"key":"49_CR004943","volume-title":"Computers and intractability","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. WH Freeman, San Francisco, CA"},{"key":"49_CR004944","first-page":"715","volume-title":"A hybrid algorithm based on particle swarm optimisation and simulated annealing for job shop scheduling","author":"H Ge","year":"2007","unstructured":"Ge H, Du W, Qian F (2007) A hybrid algorithm based on particle swarm optimisation and simulated annealing for job shop scheduling. In: Proceedings of ICNC 2007. Third International Conference on Natural Computation, vol 3, Haikou, China, August 2007. IEEE Computer Society, Washington, pp 715\u2013719"},{"key":"49_CR004945","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF00939629","volume":"69","author":"SB Gelfand","year":"1989","unstructured":"Gelfand SB, Mitter SK (1989) Simulated annealing with noisy or imprecise measurements. J Opt Theory Appl 69:49\u201362","journal-title":"J Opt Theory Appl"},{"key":"49_CR004946","first-page":"165","volume-title":"Introductory tutorials in optimisation, decision support and search methodology","author":"M Gendreau","year":"2005","unstructured":"Gendreau M, Potvin JY (2005) Tabu search. In: EK Burke, G Kendall (eds) Introductory tutorials in optimisation, decision support and search methodology. Springer, New York, pp 165\u2013186"},{"key":"49_CR004947","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search part 1. ORSA J Comput 1:190\u2013206","journal-title":"ORSA J Comput"},{"key":"49_CR004948","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0377-2217(89)90185-9","volume":"39","author":"F Glover","year":"1989","unstructured":"Glover F, Greenberg HJ (1989) New approaches for heuristic search: a bilateral link with artificial intelligence. Eur J Oper Res 39:119\u2013130","journal-title":"Eur J Oper Res"},{"key":"49_CR004949","unstructured":"Gogos C, Alefragis P, Housos E (2008) A multi-staged algorithmic process for the solution of the examination timetabling problem. In: Burke EK, Gendreau M (eds) The 7th international conference on the practice and theory of automated timetabling, Montreal, Canada, August 2008"},{"key":"49_CR004950","first-page":"409","volume":"8","author":"L Goldstein","year":"1988","unstructured":"Goldstein L, Waterman MS (1988) Neighbourhood size in the simulated annealing algorithm. Am J Math Manag Sci 8:409\u2013423","journal-title":"Am J Math Manag Sci"},{"issue":"3","key":"49_CR004951","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1016\/j.ejor.2004.09.008","volume":"171","author":"AM Gomes","year":"2006","unstructured":"Gomes AM, Oliveira JF (2006) Solving irregular strip packing problems by hybridising simulated annealing and linear programming. Eur J Oper Res 171(3):811\u2013829","journal-title":"Eur J Oper Res"},{"key":"49_CR004952","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1109\/TCAD.1986.1270190","volume":"CAD-5","author":"JW Greene","year":"1986","unstructured":"Greene JW, Supowit KJ (1986) Simulated annealing without rejected moves. IEEE Trans Comput Aided Des CAD-5:221\u2013228","journal-title":"IEEE Trans Comput Aided Des"},{"issue":"3","key":"49_CR004953","first-page":"790","volume":"E89A","author":"XP Guo","year":"2006","unstructured":"Guo XP, Yang GK, Zhiming W, Huang ZH (2006) A hybrid fine-tuned multi-objective memetic algorithm. IEICE Trans Fundam Electron Commun Comput Sci E89A(3):790\u2013797","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"issue":"1","key":"49_CR004954","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00229298","volume":"8","author":"WJ Gutjahr","year":"1996","unstructured":"Gutjahr WJ, Pflug GCh (1996) Simulated annealing for noisy cost functions. J Global Optimisation 8(1):1\u201313","journal-title":"J Global Optimisation"},{"key":"49_CR004955","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B Hajek","year":"1988","unstructured":"Hajek B (1988) Cooling schedules for optimal annealing. Math Oper Res 13:311\u2013329","journal-title":"Math Oper Res"},{"key":"49_CR004956","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1209\/epl\/i2006-10058-0","volume":"74","author":"K Hamacher","year":"2006","unstructured":"Hamacher K (2006) Adaptation in stochastic tunnelling global optimisation of complex potential energy landscapes. Europhys Lett 74:944\u2013950","journal-title":"Europhy Lett"},{"key":"49_CR004957","doi-asserted-by":"crossref","first-page":"938","DOI":"10.1103\/PhysRevE.59.938","volume":"59","author":"K Hamacher","year":"1999","unstructured":"Hamacher K, Wenzel W (1999) Scaling behaviour of stochastic minimisation algorithms in a perfect funnel landscape. Phys Rev E 59:938\u2013941","journal-title":"Phys Rev E"},{"key":"49_CR004958","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/0-387-28356-0_8","volume-title":"Search methodologies","author":"P Hansen","year":"2005","unstructured":"Hansen P, Mladenovic N (2005) Variable neighbourhood search. In: Burke EK, Kendall G (eds) Search methodologies. Springer, New York, pp 211\u2013238"},{"key":"49_CR004959","volume-title":"The handbook of metaheuristics, International series in operations research and management science","author":"D Henderson","year":"2003","unstructured":"Henderson D, Jacobson SH, Johnson AW (2003) The theory and practice of simulated annealing. In: Glover F, Kochenberger GA (eds) The handbook of metaheuristics, International series in operations research and management science, vol 57. Springer, New York"},{"key":"49_CR004960","first-page":"381","volume-title":"An efficient general cooling schedule for simulated annealing","author":"MD Huang","year":"1986","unstructured":"Huang MD, Romeo F, Sangiovanni-Vincentelli AL (1986) An efficient general cooling schedule for simulated annealing. In: Proceedings of IEEE international conference on computer aided design, Santa Clara, CA, November 1986. IEEE Computer Society, Washington, pp 381\u2013384"},{"issue":"3","key":"49_CR004961","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1016\/j.ijrobp.2008.02.009","volume":"72","author":"D Jacob","year":"2008","unstructured":"Jacob D, Raben A, Sarkar A, Grimm J, Simpson L (2008) Anatomy-based inverse planning simulated annealing optimization in high-dose-rate prostrate brachytherapy significant dosimetric advantage over other optimization techniques. Int J Radiat Oncol Biol Phys 72(3):820\u2013827","journal-title":"Int J Radiat Oncol Biol Phys"},{"key":"49_CR004962","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"DS Johnson","year":"1989","unstructured":"Johnson DS, Aragon CR, McGeoch LA, Schevon C (1989) Optimization by simulated annealing: an experimental evaluation; part I, graph partitioning. Oper Res 37:865\u2013892","journal-title":"Oper Res"},{"key":"49_CR004963","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"DS Johnson","year":"1991","unstructured":"Johnson DS, Aragon CR, McGeoch LA, Schevon C (1991) Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning. Oper Res 39:378\u2013406","journal-title":"Oper Res"},{"issue":"4","key":"49_CR004964","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1049\/ip-gtd:19951958","volume":"142","author":"W-S Jwo","year":"1995","unstructured":"Jwo W-S, Liu C-W, Liu C-C, Hsiao Y-Y (1995) Hybrid expert system and simulated annealing approach to optimal reactive power planning. IEE Proc Generation, Transm Distribution 142(4):381\u2013385","journal-title":"IEE Proc Generation, Transm Distribution"},{"issue":"1","key":"49_CR004965","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0169-7439(92)80022-V","volume":"15","author":"JH Kalivas","year":"1992","unstructured":"Kalivas JH (1992) Optimization using variations of simulated annealing. Chemometrics Intell Lab Syst 15(1):1\u201312","journal-title":"Chemometrics Intell Lab Syst"},{"key":"49_CR004966","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility amongst combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York, pp 85\u2013103"},{"key":"49_CR004967","unstructured":"Kern W (1986) On the depth of combinatorial optimisation problems. University of Koln Technical Report 8633"},{"key":"49_CR004968","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"CD Kirkpatrick","year":"1983","unstructured":"Kirkpatrick CD, Gellat CD, Vecchi MP (1983) Optimisation by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"issue":"3","key":"49_CR004969","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/j.brachy.2008.01.003","volume":"7","author":"CD Kubicky","year":"2008","unstructured":"Kubicky CD, Yeh BM, Lessard E, Joe BN, Speight JL, Pouliot J, Hsu I-C (2008) Inverse planning simulated annealing for magnetic resonance imaging-based intracavitary high dose-rate brachytherapy for cervical cancer. Bracytherapy 7(3):242\u2013247","journal-title":"Bracytherapy"},{"key":"49_CR004970","first-page":"109","volume-title":"The practice and theory of automated timetabling V. Lecture notes in computer science","author":"PA Kostuch","year":"2004","unstructured":"Kostuch PA (2004) The university course timetabling problem with a 3-phase method. In: Burke EK, Trick M (eds) The practice and theory of automated timetabling V. Lecture notes in computer science, vol 3616. Springer-Verlag, Berlin, pp 109\u2013125"},{"key":"49_CR004971","unstructured":"Lin S, Yu VF, Chou S-Y (2008) Solving the truck and trailer problem based on a simulated annealing heuristics. Comput Oper Res, Available online 17-4-2008 (corrected proof)"},{"key":"49_CR004972","first-page":"195","volume-title":"Mobile networks and computing. DIMACS series on discrete mathematics and theoretical computer science","author":"X Liu","year":"2000","unstructured":"Liu X, Pardalos PM, Rajasekaran S, Resende MGC (2000) A GRASP for frequency assignment in mobile radio networks. In: Badrinath BR, Hsu F, Pardalos PM, Rajasejaran S (eds) Mobile networks and computing. DIMACS series on discrete mathematics and theoretical computer science, vol 52. American Mathematical Society, Providence, RI, pp 195\u2013201"},{"key":"49_CR004973","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01582166","volume":"34","author":"M Lundy","year":"1986","unstructured":"Lundy M, Mees A (1986) Convergence of an annealing algorithm. Math Programming 34:111\u2013124","journal-title":"Math Programming"},{"issue":"2","key":"49_CR004974","first-page":"167","volume":"10","author":"RE Marsh","year":"2007","unstructured":"Marsh RE, Riauka TA, McQuarrie SA (2007) Use of a simulated annealing algorithm to fit compartmental models with an application to fractal pharmacokinetics. J Pharm Pharm Sci 10(2):167\u2013178","journal-title":"J Pharm Pharm Sci"},{"key":"49_CR004975","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/978-3-540-45157-0_14","volume":"2740","author":"LTG Merlot","year":"2003","unstructured":"Merlot LTG, Boland N, Hughes BD, Stuckey PJ (2003) A hybrid algorithm for the examination timetabling problem. Lect Notes Comput Sci 2740:207\u2013231","journal-title":"Lect Notes Comput Sci"},{"key":"49_CR004976","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculation by fast computing machines. J Chem Phys 21:1087\u20131091","journal-title":"J Chem Phys"},{"key":"49_CR004977","doi-asserted-by":"crossref","first-page":"747","DOI":"10.2307\/1427186","volume":"18","author":"D Mitra","year":"1986","unstructured":"Mitra D, Romeo F, Sangiovanni-Vincentelli AL (1986) Convergence and finite time behaviour of simulated annealing. Adv Appl Probability 18:747\u2013771","journal-title":"Adv Appl Probability"},{"issue":"4","key":"49_CR004978","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1002\/ird.199","volume":"54","author":"MJ Monem","year":"2005","unstructured":"Monem MJ, Namdarian R (2005) Application of simulated annealing (SA) techniques for optimal water distribution in irrigation canals. Irrigation Drainage 54(4):365\u2013373","journal-title":"Irrigation Drainage"},{"key":"49_CR004979","unstructured":"Morgenstern C, Shapiro H (1989) Chromatic number approximation using simulated annealing. Technical Report CS86-1, Department of Computer Science, University of New Mexico"},{"issue":"1","key":"49_CR004980","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.brachy.2007.10.001","volume":"7","author":"GC Morton","year":"2008","unstructured":"Morton GC, Sangreacha R, Halina P, Loblaw A (2008) A comparison of anatomy-based inverse planning with simulated annealing and graphical optimization for high-dose-rate prostrate brachytherapy. Brachytherapy 7(1):12\u201316","journal-title":"Brachytherapy"},{"key":"49_CR004981","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/0375-9601(90)90166-L","volume":"146","author":"P Moscato","year":"1990","unstructured":"Moscato P, Fontanari JF (1990) Stochastic versus deterministic update in simulated annealing. Phys Lett A 146:204\u2013208","journal-title":"Phys Lett A"},{"key":"49_CR004982","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/978-3-642-61217-6_2","volume-title":"Evolutionary algorithms in management applications","author":"V Nissen","year":"1995","unstructured":"Nissen V (1995) An overview of evolutionary algorithms in management applications. In: Biethahn J, Nissen V (eds) Evolutionary algorithms in management applications. Springer Verlag, New York, pp 44\u201397"},{"key":"49_CR004983","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0305-0548(90)90001-N","volume":"17","author":"FA Ogbu","year":"1990","unstructured":"Ogbu FA, Smith DK (1990) The application of the simulated annealing algorithm to the solution of the n\/m\/Cmax flowshop problem. Comput Oper Res 17:243\u2013253","journal-title":"Comput Oper Res"},{"key":"49_CR004984","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"IH Osman","year":"1993","unstructured":"Osman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41:421\u2013451","journal-title":"Ann Oper Res"},{"issue":"2","key":"49_CR004985","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1016\/j.jpowsour.2008.08.019","volume":"185","author":"MT Outeiro","year":"2008","unstructured":"Outeiro MT, Chibante R, Carvalho AS, de Almeida AT (2008) A parameter optimized model of a proton exchange membrane fuel cell including temperature effects. J Power Sources 185(2):952\u2013960","journal-title":"J Power Sources"},{"key":"49_CR004986","first-page":"23","volume":"84","author":"MK Pakhira","year":"2003","unstructured":"Pakhira MK (2003) A hybrid genetic algorithm using probabilistic selection. J Inst Eng (India) 84:23\u201330","journal-title":"J Inst Eng (India)"},{"issue":"8","key":"49_CR004987","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1111\/j.1467-8667.2008.00561.x","volume":"23","author":"I Paya","year":"2008","unstructured":"Paya I, Yepes V, Gonzalez-Vidosa F, Hospitaler A (2008) Multiobjective optimization of concrete frames by simulated annealing. Comput Aided Civil Infrastructure Eng 23(8):596\u2013610","journal-title":"Comput Aided Civil Infrastructure Eng"},{"key":"49_CR004988","first-page":"1","volume-title":"Advances in metaheuristics for hard optimization 2008. Natural computing series","author":"CS Pedamallu","year":"2008","unstructured":"Pedamallu CS, Ozdamar L (2008) Comparison of simulated annealing, interval partitioning and hybrid algorithms in constrained global optimisation. In: Siarry P, Michalewicz Z (eds) Advances in metaheuristics for hard optimization 2008. Natural computing series. Springer, Berlin, pp 1\u201322"},{"key":"49_CR004989","doi-asserted-by":"crossref","first-page":"R1","DOI":"10.1103\/PhysRevE.51.R1","volume":"51","author":"TJP Penna","year":"1994","unstructured":"Penna TJP (2008) Travelling salesman problem and Tsallis statistics. Phys Rev E 51:R1\u2013R3","journal-title":"Phys Rev E"},{"issue":"8","key":"49_CR004990","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1016\/j.advengsoft.2007.07.007","volume":"39","author":"C Perea","year":"2008","unstructured":"Perea C, Alcaca J, Yepes V, Gonzalez-Vidosa F, Hospitaler A (2008) Design of reinforced concrete bridge frames by heuristic optimization. Adv Eng Software 39(8):676\u2013688","journal-title":"Adv Eng Software"},{"key":"49_CR004991","doi-asserted-by":"crossref","first-page":"3331","DOI":"10.1016\/j.cor.2007.03.001","volume":"35","author":"E Rodriguez-Tello","year":"2008","unstructured":"Rodriguez-Tello E, Hao J-K, Torres-Jimenez J (2008) An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem. Comput Oper Res 35:3331\u20133346","journal-title":"Comput Oper Res"},{"key":"49_CR004992","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighbourhood search heuristics for the pickup and delivery problem with time windows. Transportation Sci 40:455\u2013472","journal-title":"Transportation Sci"},{"key":"49_CR004993","doi-asserted-by":"crossref","unstructured":"Salamon P, Suibani P, Frost R (2002) Facts, conjectures and improvements for simulated annealing. SIAM Monographs on Mathematical Modeling and Computation 7, Society for Industrial and Applied Mathematics","DOI":"10.1137\/1.9780898718300"},{"issue":"3","key":"49_CR004994","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.cageo.2007.03.014","volume":"34","author":"I Sant\u00e9-Riveira","year":"2008","unstructured":"Sant\u00e9-Riveira I, Boull\u00f3n-Mag\u00e1n M, Crecente-Maseda R, Miranda-Barr\u00f3s D (2008) Algorithm based on simulated annealing for land-use allocation. Comput Geosci 34(3):259\u2013268","journal-title":"Comput Geosci"},{"key":"49_CR004995","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1109\/4.1001","volume":"23","author":"D Sechen","year":"1988","unstructured":"Sechen D, Braun D, Sangiovanni-Vincetelli A (1988) Thunderbird: a complete standard cell layout package. IEEE J Solid State Circuits 23:410\u2013420","journal-title":"IEEE J Solid State Circuits"},{"issue":"1","key":"49_CR004996","first-page":"31","volume":"188","author":"SU Se\u00e7kiner","year":"2007","unstructured":"Se\u00e7kiner SU, Kurt M (2007) A simulated annealing approach to the solution of job rotation scheduling problems. Appl Math Comput 188(1):31\u201345","journal-title":"Appl Math Comput"},{"key":"49_CR004997","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0375-9601(87)90796-1","volume":"122","author":"H Szu","year":"1987","unstructured":"Szu H, Hartley R (1987) Fast simulated annealing. Phys Lett A 122:157\u2013162","journal-title":"Phys Lett A"},{"issue":"5","key":"49_CR004998","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/j.jfranklin.2005.12.002","volume":"344","author":"R Tavakkoli-Moghaddam","year":"2007","unstructured":"Tavakkoli-Moghaddam R, Safaei N, Kah MMO, Rabbani M (2007) A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing. J Franklin Inst 344(5):406\u2013425","journal-title":"J Franklin Inst"},{"key":"49_CR004999","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"MB Teitz","year":"1968","unstructured":"Teitz MB, Bart P (1968) Heuristics methods for estimating the generalised vertex median of a weighted graph. Oper Res 16:955\u2013961","journal-title":"Oper Res"},{"issue":"1","key":"49_CR0049100","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1142\/S021972000800331X","volume":"6","author":"S Tewari","year":"2008","unstructured":"Tewari S, Arnold J, Bhandarkar SM (2008) Likelihood of a particular order of genetic markers and the construction of genetic maps. J Bioinform Comput Biol 6(1):125\u2013162","journal-title":"J Bioinform Comput Biol"},{"key":"49_CR0049101","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1016\/S0305-0548(97)00101-9","volume":"25","author":"JM Thompson","year":"1998","unstructured":"Thompson JM, Dowsland KA (1998) A robust simulated annealing based examination timetabling system. Comput Oper Res 25:637\u2013648","journal-title":"Comput Oper Res"},{"key":"49_CR0049102","volume-title":"Practice and theory of automated timetabling. Lecture notes in computer science","author":"JM Thompson","year":"1996","unstructured":"Thompson JM, Dowsland KA (1996) General cooling schedules for a simulated annealing based timetabling system. In: Burke EK, Ross P (eds) Practice and theory of automated timetabling. Lecture notes in computer science, vol 1153. Springer-Verlag, Berlin"},{"key":"49_CR0049103","unstructured":"Tiourine S, Hurkens C, Lenstra JK (1995) An overview of algorithmic approaches to frequency assignment problems. Technical report, EUCLID CALMA project, Eindhoven University of Technology"},{"key":"49_CR0049104","first-page":"389","volume":"8","author":"CA Tovey","year":"1988","unstructured":"Tovey CA (1988) Simulated simulated annealing. Am J Math Manag Sci 8:389\u2013407","journal-title":"Am J Math Manag Sci"},{"key":"49_CR0049105","first-page":"77","volume":"166","author":"E Triki","year":"2005","unstructured":"Triki E, Collette Y, Siarry P (2005) A theoretical study on the behavior of simulated annealing leading to a new cooling schedule. Eur J OR 166:77\u201392","journal-title":"Eur J OR"},{"key":"49_CR0049106","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0378-4371(96)00271-3","volume":"233","author":"C Tsallis","year":"1996","unstructured":"Tsallis C, Stariolo DA (1996) Generalized simulated annealing. Phys A 233:395\u2013406","journal-title":"Phys A"},{"key":"49_CR0049107","first-page":"400","volume-title":"A hybrid simulated annealing with Kempe chain neighbourhood for the university timetabling problem","author":"M Tuga","year":"2007","unstructured":"Tuga M, Berretta R, Mendes A (2007) A hybrid simulated annealing with Kempe chain neighbourhood for the university timetabling problem. In: Lee R, Chowdhury M, Ray S, Lee T (eds) 6th IEEE\/ACIS Conference Proceedings Computer and Information Science 2007, Melbourne, Australia, July 2007. IEEE Computer Society, Washington, pp 400\u2013405"},{"key":"49_CR0049109","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1002\/1520-6750(199008)37:4<559::AID-NAV3220370409>3.0.CO;2-8","volume":"37","author":"AJ Vakharia","year":"1990","unstructured":"Vakharia AJ, Chang Y-L (1990) A simulated annealing approach to scheduling a manufacturing cell. Naval Res Logistics 37:559\u2013577","journal-title":"Naval Res Logistics"},{"issue":"3","key":"49_CR0049110","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1016\/0377-2217(94)00064-J","volume":"86","author":"A Van Breedam","year":"1995","unstructured":"Van Breedam A (1995) Improvement heuristics for the vehicle routing problem based on simulated annealing. Eur J Operational Res 86(3):480\u2013490","journal-title":"Eur J Operational Res"},{"key":"49_CR0049111","first-page":"267","volume-title":"Population-based simulated annealing for traveling tournaments. Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence","author":"P Van Hentenryck","year":"2007","unstructured":"Van Hentenryck P, Vergados Y (2007) Population-based simulated annealing for traveling tournaments. Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, Vancouver, Canada, AAAI Press, pp 267\u2013271"},{"key":"49_CR0049108","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated annealing: theory and applications","author":"PJM Van Laarhoven","year":"1987","unstructured":"Van Laarhoven PJM, Aarts EHL (1987) Simulated annealing: theory and applications. Kluwer, Dordrecht, The Netherlands"},{"key":"49_CR0049112","doi-asserted-by":"crossref","first-page":"1368","DOI":"10.1126\/science.285.5432.1368","volume":"285","author":"DJ Wales","year":"1999","unstructured":"Wales DJ, Scheraga HA (1999) Chemistry: global optimisation of clusters, crystals and biomolecules. Science 285:1368\u20131372","journal-title":"Science"},{"key":"49_CR0049113","doi-asserted-by":"crossref","unstructured":"Wishart JD, Dong Z, Secanell MM (2006) Optimization of a PEM fuel cell system for low-speed hybrid electric vehicles. In: Proceedings of the ASME Design Engineering Technical Conference 2006, Philadelphia, PA, September 2006","DOI":"10.1115\/DETC2006-99606"},{"key":"49_CR0049114","volume-title":"Simulated annealing for VLSI design. The Springer International Series in Engineering and Computer Science","author":"DF Wong","year":"1998","unstructured":"Wong, DF, Leong HW, Liu HW (1998) Simulated annealing for VLSI design. The Springer International Series in Engineering and Computer Science, vol 42. Springer, Berlin"},{"key":"49_CR0049115","first-page":"447","volume":"42","author":"M Wright","year":"1991","unstructured":"Wright M (1991) Scheduling English cricket umpires. J OR Soc 42:447\u2013452","journal-title":"J OR Soc"},{"key":"49_CR0049116","first-page":"347","volume":"47","author":"M Wright","year":"1996","unstructured":"Wright M (1996) School timetabling using heuristic search. J OR Soc 47:347\u2013357","journal-title":"J OR Soc"},{"key":"49_CR0049117","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1023\/A:1011367031160","volume":"7","author":"M Wright","year":"2001","unstructured":"Wright M (2001) Subcost-guided search \u2013 experiments with timetabling problems. J Heuristics 7:251\u2013260","journal-title":"J Heuristics"},{"issue":"3","key":"49_CR0049118","first-page":"845","volume":"51","author":"P Yu","year":"2008","unstructured":"Yu P, Dai M-G, Wang J-L, Wu J-S (2008) Joint inversion of gravity and seismic data based on common gridded model with random density and velocity distributions. Chinese J Geophys 51(3):845\u2013852","journal-title":"Chinese J Geophys"},{"key":"49_CR0049119","doi-asserted-by":"crossref","first-page":"2141","DOI":"10.1080\/00207540210131851","volume":"40","author":"S Zolfaghari","year":"2002","unstructured":"Zolfaghari S, Liang M (2002) Comparative study of simulated annealing, genetic algorithms and tabu search for solving binary and comprehensive machine-grouping problems. Int J Prod Res 40:2141\u20132158","journal-title":"Int J Prod Res"}],"container-title":["Handbook of Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92910-9_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T04:38:28Z","timestamp":1676781508000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-92910-9_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783540929093","9783540929109"],"references-count":119,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92910-9_49","relation":{},"subject":[],"published":{"date-parts":[[2012]]}}}