scholarly journals A Permutational Boltzmann Machine with Parallel Tempering for Solving Combinatorial Optimization Problems

Author(s):  
Mohammad Bagherbeik ◽  
Parastoo Ashtari ◽  
Seyed Farzad Mousavi ◽  
Kouichi Kanda ◽  
Hirotaka Tamura ◽  
...  
2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Xiaodong Yan ◽  
Jiahui Ma ◽  
Tong Wu ◽  
Aoyang Zhang ◽  
Jiangbin Wu ◽  
...  

AbstractNeuromorphic hardware implementation of Boltzmann Machine using a network of stochastic neurons can allow non-deterministic polynomial-time (NP) hard combinatorial optimization problems to be efficiently solved. Efficient implementation of such Boltzmann Machine with simulated annealing desires the statistical parameters of the stochastic neurons to be dynamically tunable, however, there has been limited research on stochastic semiconductor devices with controllable statistical distributions. Here, we demonstrate a reconfigurable tin oxide (SnOx)/molybdenum disulfide (MoS2) heterogeneous memristive device that can realize tunable stochastic dynamics in its output sampling characteristics. The device can sample exponential-class sigmoidal distributions analogous to the Fermi-Dirac distribution of physical systems with quantitatively defined tunable “temperature” effect. A BM composed of these tunable stochastic neuron devices, which can enable simulated annealing with designed “cooling” strategies, is conducted to solve the MAX-SAT, a representative in NP-hard combinatorial optimization problems. Quantitative insights into the effect of different “cooling” strategies on improving the BM optimization process efficiency are also provided.


2009 ◽  
Vol 20 (04) ◽  
pp. 539-556 ◽  
Author(s):  
CHIAMING WANG ◽  
JEFFREY D. HYMAN ◽  
ALLON PERCUS ◽  
RUSSEL CAFLISCH

We explore the potential of parallel tempering as a combinatorial optimization method, applying it to the traveling salesman problem. We compare simulation results of parallel tempering with a benchmark implementation of simulated annealing, and study how different choices of parameters affect the relative performance of the two methods. We find that a straightforward implementation of parallel tempering can outperform simulated annealing in several crucial respects. When parameters are chosen appropriately, both methods yield close approximation to the actual minimum distance for an instance with 200 nodes. However, parallel tempering yields more consistently accurate results when a series of independent simulations are performed. Our results suggest that parallel tempering might offer a simple but powerful alternative to simulated annealing for combinatorial optimization problems.


Sign in / Sign up

Export Citation Format

Share Document