Aarts EHL, Korst JHM (1989) Simulated annealing and Boltzmann machines. Wiley, Chichester
MATHAarts EHL, Van Laarhoven PJM (1985) Statistical cooling: a general approach to combinatorial optimisation problems. Philips J Res 40:193–226
MathSciNetAarts EHL, Korst JHM, Michiels W (2005) Simulated annealing. In: Burke EK, Kendall G (eds) Search methodologies. Springer, New York, pp 187–210
Abramson D (1991) Constructing school timetables using simulated annealing: sequential and parallel algorithms. Manag Sci 37:98–113
Alrefaei MH, Andradottir S (1999) A simulated annealing algorithm with constant temperature for discrete stochastic optimisation. Manag Sci 45:748–764
MATHAltiparmak F, Karaoglan I (2008) An adaptive tabu-simulated annealing for concave cost transportation problems. J Operational Res Soc 59:331–341
MATHAnagnostopoulos A, Michel L, Van Hentenryck P, Vergados YA (2006) Simulated annealing approach to the traveling tournament problem. J Scheduling 9:177–193
MATHArai 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–2207
Azizi N, Zolfaghari S (2004) Adaptive temperature control for simulated annealing: a comparative study. Comput Operations Res 31(4):2439–2451
MathSciNetMATHBai 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–September 2006. Lecture notes in computer science, vol 3867. Springer, Heidelberg
Bianci L, Dorigo M, Gambardella LM, Gutjahr WJ (2008) A survey on metaheuristics for stochastic combinatorial optimisation. Nat Comput. DOI 101007, Online September 2008
Boese KD, Kahng AB (1994) Best-so-far vs. where-you-are: implications for optimal finite time annealing. Syst Control Lett 22:71–78
MathSciNetMATHBonomi E, Lutton JL (1984) The N-city travelling salesman problem: statistical mechanics and the Metropolis algorithm. SIAM Rev 26:551–568
MathSciNetMATHBrandimarte 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–245
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–690
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–516
Černy V (1985) A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. J Optimization Theory Appl 45:41–55
MATHChams M, Hertz A, De Werra D (1987) Some experiments with simulated annealing for colouring graphs. Eur J Operational Res 32:260–266
MATHChandy 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–42
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–560
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–4):363–393
MATHChen 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–426
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–69
Connolly DT (1990) An improved annealing scheme for the QAP. Eur J Operational Res 46:93–100
MathSciNetMATHCook 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–158
Cook SA (1972) An overview of computational complexity. Commun ACM 26:400–408
Cornish NJ, Porter EK (2007) The search for massive black hole binaries with LISA. Classical Quantum Gravity 24(23):5729–5755
MATHCrowe 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–2509
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–2498
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–359
Dowsland KA (1993a) Some experiments with simulated annealing techniques for packing problems. Eur J Operational Res 68:389–399
MATHDowsland 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
Dowsland KA, Thompson JM (1998) A robust simulated annealing based examination timetabling system. Comput Oper Res 25:637–648
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–774
MATHDueck G, Sheuer T (1990) Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 90:161–175
MathSciNetMATHEdmonds J (1965) Paths, trees and flowers. Can J Maths 17:449–467
MathSciNetMATHEgeblad J, Pisinger D (2009) Heuristic approaches for the two and three dimensional knapsack packing problem. Comput Oper Res 36(4):1026–1049
MathSciNetMATHEglese RW (1990) Simulated annealing: a general tool for operational research. Eur J Oper Res 46(3):271–281
MathSciNetMATHErdemir 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–632
MathSciNetMATHFeo TA, Resende MGC, Smith SH (1994) A greedy randomised adaptive search procedure for maximum independent set. Oper Res 42:860–878
MATHFleischer M, Jacobson SH (1999) Information theory and the finite time behavior of the simulated annealing algorithm: experimental results. INFORMS J Comput 11:35–43
MathSciNetMATHFranz A, Hoffmann KH (2003) Threshold accepting as limit case for a modified Tsallis statistics. Appl Math Lett 16:27–31
MATHGarey MR, Johnson DS (1979) Computers and intractability. WH Freeman, San Francisco, CA
MATHGe 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–719
Gelfand SB, Mitter SK (1989) Simulated annealing with noisy or imprecise measurements. J Opt Theory Appl 69:49–62
MathSciNetGendreau 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–186
Glover F (1989) Tabu search part 1. ORSA J Comput 1:190–206
MathSciNetMATHGlover F, Greenberg HJ (1989) New approaches for heuristic search: a bilateral link with artificial intelligence. Eur J Oper Res 39:119–130
MathSciNetMATHGogos 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
Goldstein L, Waterman MS (1988) Neighbourhood size in the simulated annealing algorithm. Am J Math Manag Sci 8:409–423
MathSciNetMATHGomes AM, Oliveira JF (2006) Solving irregular strip packing problems by hybridising simulated annealing and linear programming. Eur J Oper Res 171(3):811–829
MATHGreene JW, Supowit KJ (1986) Simulated annealing without rejected moves. IEEE Trans Comput Aided Des CAD-5:221–228
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–797
Gutjahr WJ, Pflug GCh (1996) Simulated annealing for noisy cost functions. J Global Optimisation 8(1):1–13
MathSciNetMATHHajek B (1988) Cooling schedules for optimal annealing. Math Oper Res 13:311–329
MathSciNetMATHHamacher K (2006) Adaptation in stochastic tunnelling global optimisation of complex potential energy landscapes. Europhys Lett 74:944–950
Hamacher K, Wenzel W (1999) Scaling behaviour of stochastic minimisation algorithms in a perfect funnel landscape. Phys Rev E 59:938–941
Hansen P, Mladenovic N (2005) Variable neighbourhood search. In: Burke EK, Kendall G (eds) Search methodologies. Springer, New York, pp 211–238
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
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–384
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–827
Johnson DS, Aragon CR, McGeoch LA, Schevon C (1989) Optimization by simulated annealing: an experimental evaluation; part I, graph partitioning. Oper Res 37:865–892
MATHJohnson 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–406
MATHJwo 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–385
Kalivas JH (1992) Optimization using variations of simulated annealing. Chemometrics Intell Lab Syst 15(1):1–12
Karp RM (1972) Reducibility amongst combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York, pp 85–103
Kern W (1986) On the depth of combinatorial optimisation problems. University of Koln Technical Report 8633
Kirkpatrick CD, Gellat CD, Vecchi MP (1983) Optimisation by simulated annealing. Science 220:671–680
MathSciNetMATHKubicky 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–247
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–125
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)
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–201
Lundy M, Mees A (1986) Convergence of an annealing algorithm. Math Programming 34:111–124
MathSciNetMATHMarsh 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–178
Merlot LTG, Boland N, Hughes BD, Stuckey PJ (2003) A hybrid algorithm for the examination timetabling problem. Lect Notes Comput Sci 2740:207–231
Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculation by fast computing machines. J Chem Phys 21:1087–1091
Mitra D, Romeo F, Sangiovanni-Vincentelli AL (1986) Convergence and finite time behaviour of simulated annealing. Adv Appl Probability 18:747–771
MathSciNetMATHMonem MJ, Namdarian R (2005) Application of simulated annealing (SA) techniques for optimal water distribution in irrigation canals. Irrigation Drainage 54(4):365–373
Morgenstern C, Shapiro H (1989) Chromatic number approximation using simulated annealing. Technical Report CS86-1, Department of Computer Science, University of New Mexico
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–16
Moscato P, Fontanari JF (1990) Stochastic versus deterministic update in simulated annealing. Phys Lett A 146:204–208
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–97
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–253
MathSciNetMATHOsman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41:421–451
MATHOuteiro 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–960
Pakhira MK (2003) A hybrid genetic algorithm using probabilistic selection. J Inst Eng (India) 84:23–30
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–610
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–22
Penna TJP (2008) Travelling salesman problem and Tsallis statistics. Phys Rev E 51:R1–R3
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–688
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–3346
MATHRopke S, Pisinger D (2006) An adaptive large neighbourhood search heuristics for the pickup and delivery problem with time windows. Transportation Sci 40:455–472
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
Santé-Riveira I, Boullón-Magán M, Crecente-Maseda R, Miranda-Barrós D (2008) Algorithm based on simulated annealing for land-use allocation. Comput Geosci 34(3):259–268
Sechen D, Braun D, Sangiovanni-Vincetelli A (1988) Thunderbird: a complete standard cell layout package. IEEE J Solid State Circuits 23:410–420
Seçkiner SU, Kurt M (2007) A simulated annealing approach to the solution of job rotation scheduling problems. Appl Math Comput 188(1):31–45
MATHSzu H, Hartley R (1987) Fast simulated annealing. Phys Lett A 122:157–162
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–425
MathSciNetTeitz MB, Bart P (1968) Heuristics methods for estimating the generalised vertex median of a weighted graph. Oper Res 16:955–961
MATHTewari 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–162
Thompson JM, Dowsland KA (1998) A robust simulated annealing based examination timetabling system. Comput Oper Res 25:637–648
MATHThompson 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
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
Tovey CA (1988) Simulated simulated annealing. Am J Math Manag Sci 8:389–407
MathSciNetMATHTriki 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–92
MathSciNetMATHTsallis C, Stariolo DA (1996) Generalized simulated annealing. Phys A 233:395–406
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–405
Vakharia AJ, Chang Y-L (1990) A simulated annealing approach to scheduling a manufacturing cell. Naval Res Logistics 37:559–577
MathSciNetMATHVan Breedam A (1995) Improvement heuristics for the vehicle routing problem based on simulated annealing. Eur J Operational Res 86(3):480–490
MATHVan 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–271
Van Laarhoven PJM, Aarts EHL (1987) Simulated annealing: theory and applications. Kluwer, Dordrecht, The Netherlands
MATHWales DJ, Scheraga HA (1999) Chemistry: global optimisation of clusters, crystals and biomolecules. Science 285:1368–1372
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
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
Wright M (1991) Scheduling English cricket umpires. J OR Soc 42:447–452
Wright M (1996) School timetabling using heuristic search. J OR Soc 47:347–357
Wright M (2001) Subcost-guided search – experiments with timetabling problems. J Heuristics 7:251–260
MATHYu 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–852
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–2158
MATH