Simulated annealing is a local search algorithm inspired by the metallurgical process of annealing. It starts with a random solution and neighbor selection at a high temperature, accepting worse solutions probabilistically based on temperature. The temperature gradually cools, and the process repeats until cooled, finding good but not necessarily optimal solutions. Key advantages are it can handle any system or cost function, is easy to implement, and generally finds good solutions.