An optimization method that uses random tries to get near the best answer.
Simulated annealing is like hunting for the best donut in the break room. First you risk the pickle donut, then grab a winner before Bob does.
It can jump out of a bad “good enough” answer. It helps with schedules and routes, plus setting tweaks.
Optimization
Simulated annealing searches a complex space for a near-best answer.
Heuristic Search
Simulated annealing is a heuristic search method with random tries.
GA
Simulated annealing and GA both use randomness for hard problems.