Simulated Annealing Optimization Using C# or Python

added by DotNetKicks
12/1/2021 6:09:27 PM

400 Views

The Data Science Lab Dr. James McCaffrey of Microsoft Research shows how to implement simulated annealing for the Traveling Salesman Problem (find the best ordering of a set of discrete items). The goal of a combinatorial optimization problem is to find the best ordering of a set of discrete items. A classic combinatorial optimization challenge is the Traveling Salesman Problem (TSP).


0 comments