https://hal-enac.archives-ouvertes.fr/hal-01887543Delahaye, DanielDanielDelahayeENAC - Ecole Nationale de l'Aviation CivileChaimatanan, SupatchaSupatchaChaimatananGISTDA - Geo-Informatics and Space Technology Development AgencyMongeau, MarcelMarcelMongeauENAC - Ecole Nationale de l'Aviation CivileSimulated annealing: From basics to applicationsHAL CCSD2019[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]Porte, Laurence - Artificial and Natural Intelligence Toulouse Institute - - ANITI2019 - ANR-19-P3IA-0004 - P3IA - VALID - Gendreau, MichelPotvin, Jean-Yves2018-10-26 19:31:192022-08-05 11:52:582018-11-05 18:26:25enBook sectionshttps://hal-enac.archives-ouvertes.fr/hal-01887543/document10.1007/978-3-319-91086-4_1application/pdf1Simulated Annealing (SA) is one of the simplest and best-known metaheuristic method for addressing difficult black box global optimization problems whose objective function is not explicitly given and can only be evaluated via some costly computer simulation. It is massively used in real-life applications. The main advantage of SA is its simplicity. SA is based on an analogy with the physical annealing of materials that avoids the drawback of the Monte-Carlo approach (which can be trapped in local minima), thanks to an efficient Metropolis acceptance criterion. When the evaluation of the objective-function results from complex simulation processes that manipulate a large-dimension state space involving much memory, population-based algorithms are not applicable and SA is the right answer to address such issues. This chapter is an introduction to the subject. It presents the principles of local search optimization algorithms, of which simulated annealing is an extension, and the Metropolis algorithm, a basic component of SA. The basic SA algorithm for optimization is described together with two theoretical properties that are fundamental to SA: statistical equilibrium (inspired from elementary statistical physics) and asymptotic convergence (based on Markov chain theory). The chapter surveys the following practical issues of interest to the user who wishes to implement the SA algorithm for its particular application: finite-time approximation of the theoretical SA, polynomial-time cooling, Markov-chain length, stopping criteria, and simulation-based evaluations. To illustrate these concepts, this chapter presents the straightforward application of SA to two classical and simple classical NP-hard combinatorial optimization problems: the knapsack problem and the traveling salesman problem. The overall SA methodology is then deployed in detail on a real-life application: a large-scale aircraft trajectory planning problem involving nearly 30,000 flights at the European continental scale. This exemplifies how to tackle nowadays complex problems using the simple scheme of SA by exploiting particular features of the problem, by integrating astute computer implementation within the algorithm, and by setting user-defined parameters empirically, inspired by the SA basic theory presented in this chapter.