Visual Studio Magazine

Simulated Annealing Optimization Using C# or Python

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 ...
Nature

GPU-accelerated simulated annealing based on p-bits with real-world device-variability modeling

Probabilistic computing using probabilistic bits (p-bits) presents an efficient alternative to traditional CMOS logic for complex problem-solving, including simulated annealing and machine learning.
Nature

Enhanced convergence in p-bit based simulated annealing with partial deactivation for large-scale combinatorial optimization problems

$$\begin{aligned} \sigma _i(t+1) = \textrm{sgn}\Bigl (r_i(t) + \textrm{tanh}\bigl (I_i(t+1)\bigr )\Bigr ), \end{aligned}$$ Simulated annealing that utilizes p-bits ...
Visual Studio Magazine

Simulated Annealing Optimization Using C# or Python

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). The ...