Ii iii therepresentationoftheschedule

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 3 3 3 3 3 3 4 2 4 1 1 4 ΣwjTj 67 72 83 92 109 109 115 123 131 131 133 136 j1 j2 j3 j4 2 3 1 3 4 4 2 3 3 4 3 3 3 2 3 4 3 1 3 2 4 3 1 1 4 4 4 2 2 3 1 1 1 1 2 4 1 1 2 1 1 2 4 4 2 2 4 2 11 Σ w jT j 137 137 141 142 142 143 161 161 170 170 174 179 Local search Design criteria i. ii. iii. The representation of the schedule The design of the neighborhood The search process within the neighborhood iv. The acceptance­rejection criteria v. Stopping criteria 12 Simulated Annealing (SA) Annealing: Heating of a material (metal) to a high temperature and then cooling it at a certain rate to achieve a desired crystalline structure SA: Avoids getting stuck at a local minimum by accepting a worse schedule Sc with probability G(Sc)­ P(Sk,Sc)= exp(­ G(Sk) ) 13 SA: Temperature parameter βk ≥ 0 is the temperature (also called cooling parameter) Initially the temperature is high making moves to a worse schedule more likely ~50% chance of accepting a slightly worse schedule seems to work well As the temperature decreases the probability of accepting a worse schedule decr...
View Full Document

This note was uploaded on 10/09/2012 for the course MAST 901 taught by Professor King during the Spring '10 term at British Columbia Institute of Technology.

Ask a homework question - tutors are online