1 / 25

IE 607 Heuristic Optimization Simulated Annealing

IE 607 Heuristic Optimization Simulated Annealing. Origins and Inspiration from Natural Systems. Metropolis et al. (Los Alamos National Lab), “Equation of State Calculations by Fast Computing Machines,” Journal of Chemical Physics , 1953.

enya
Download Presentation

IE 607 Heuristic Optimization Simulated Annealing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. IE 607 Heuristic OptimizationSimulated Annealing

  2. Origins and Inspiration from Natural Systems • Metropolis et al. (Los Alamos National Lab), “Equation of State Calculations by Fast Computing Machines,” Journal of Chemical Physics, 1953.

  3. In annealing, a material is heated to high energy where there are frequent state changes (disordered). It is then gradually (slowly) cooled to a low energy state where state changes are rare (approximately thermodynamic equilibrium, “frozen state”). For example, large crystals can be grown by very slow cooling, but if fast cooling or quenching is employed the crystal will contain a number of imperfections (glass).

  4. Metropolis’s paper describes a Monte Carlo simulation of interacting molecules. • Each state change is described by: • If E decreases, P = 1 • If E increases, P = where T = temperature (Kelvin), k = Boltzmann constant, k > 0, energy change To summarize behavior: For large T, P  For small T, P 

  5. SA for Optimization • Kirkpatrick, Gelatt and Vecchi, “Optimization by Simulated Annealing,” Science, 1983. • Used the Metropolis algorithm to optimization problems – spin glasses analogy, computer placement and wiring, and traveling salesman, both difficult and classic combinatorial problems.

  6. Thermodynamic Simulation vs Combinatorial Optimization SimulationOptimization System states Feasible solutions Energy Cost (Objective) Change of state Neighboring solution (Move) Temperature Control parameter Frozen state Final solution

  7. Spin Glasses Analogy • Spin glasses display a reaction called frustration, in which opposing forces cause magnetic fields to line up in different directions, resulting in an energy function with several low energy states  in an optimization problem, there are likely to be several local minima which have cost function values close to the optimum

  8. Canonical Procedure of SA • Notation: T0 starting temperature TF final temperature (T0 > TF, T0,TF 0) Tt temperature at state t m number of states n(t) number of moves at state t (total number of moves = n * m) move operator

  9. Canonical Procedure of SA x0 initial solution xi solution i xF final solution f(xi) objective function value ofxi cooling parameter

  10. Procedure (Minimization) Select x0, T0, m, n, α Set x1= x0, T1= T0, xF= x0 for (t = 1,…,m) { for (i = 1,…n) { xTEMP = σ(xi) if f(xTEMP) ≤ f(xi), xi+1 = xTEMP else if , xi+1 = xTEMP else xi+1 = xi if f(xi+1) ≤ f(xF), xF= xi+1 } Tt+1= α Tt } return xF

  11. Combinatorial Example: TSP

  12. Continuous Example: 2 Dimensional Multimodal Function

  13. SA: Theory Assumption: can reach any solution from any other solution • Single T – Homogeneous Markov Chain - constant T - global optimization does not depend on initial solution - basically works on law of large numbers

  14. 2. Multiple T - sequence of homogeneous Markov Chains (one at each T) (by Aarts and van Laarhoven)  number of moves is at least quadratic with search space at T  running time for SA with such guarantees of optimality will be Exponential!! - a single non-homogeneous Markov Chain (by Hajek)  if , the SA converges if c ≥ depth of largest local minimum where k = number of moves

  15. 2. Multiple T (cont.) - usually successful between 0.8 & 0.99 - Lundy & Mees - Aarts & Korst

  16. Variations of SA • Initial starting point - construct “good” solution ( pre-processing) search must be commenced at a lower temperature save a substantial amount of time (when compared to totally random) - Multi-start

  17. Variations of SA • Move - change neighborhood during search (usually contract) e.g. in TSP, 2-opt neighborhoods restrict two points “close” to one another to be swapped - non-random move

  18. Variations of SA • Annealing Schedule - constant T: such a temperature must be high enough to climb out of local optimum, but cool enough to ensure that these local optima are visited  problem-specific & instance-specific - 1 move per T

  19. Variations of SA • Annealing Schedule (cont.) - change schedule during search (include possible reheating)  # of moves accepted  # of moves attempted  entropy, specific heat, variance of solutions at T

  20. Variations of SA • Acceptance Probability By Johnson et al. By Brandimarte et al., need to decide whether to accept moves for the change of energy = 0

  21. Variations of SA • Stopping Criteria - total moves attempted - no improvement over n attempts - no accepted moves over m attempts - minimum temperature

  22. Variations of SA • Finish with Local Search - post-processing  apply a descent algorithm to the final annealing solution to ensure that at least a local minimum has been found

  23. Variations of SA • Parallel Implementations - multiple processors proceed with different random number streams at given Tthe best result from all processors is chosen for the new temperature - if one processor finds a neighbor to accept  convey to all other processors and search start from there

  24. Applications of SA • Graph partitioning & graph coloring • Traveling salesman problem • Quadratic assignment problem • VLSI and computer design • Scheduling • Image processing • Layout design • A lot more…

  25. Some Websites • http://www.svengato.com/salesman.html • http://www.ingber.com/#ASA • http://www.taygeta.com/annealing/simanneal.html

More Related