lecture14: Randomized algorithms: simulated annealing

This lecture starts to consider randomized algorithms, in particular simulated annealing.

Topics covered

• Star-like networks
• Some problems are too hard
• Heuristic methods
• Random search methods
• Randomized algorithm
• Notation
• Simulated annealing
• Details of the analogy
• Simulated annealing applications
• Simulated annealing components
• Acceptance function
• Example of one step
• Annealing schedule
• Metropolis algorithm
• TSP Example
• TSP Example
• Applet Example
• Algorithm issues
• Final