Simulated annealing can be effective in solving a wide range of combinatorial optimization problems. A short list is provided below.
Path Generation
Image Reconstruction
Task Assignment and Scheduling
Circuit Layout
Global Routing
Visual Object Detection and Recognition
Design Specialized Digital Filters
It should be noted that since simulated annealing is a random process, finding a solution using the algorithm can take time, and in some cases, it may never converge on a solution at all.