Supplementing Recurrent Neural Networks with Annealing to Solve Combinatorial Optimization Problems

Abstract

Combinatorial optimization problems can be solved by heuristic algorithms such as simulated annealing (SA) which aims to find the optimal solution within a large search space through thermal fluctuations. The algorithm generates new solutions through Markov-chain Monte Carlo techniques. This sampling scheme can result in severe limitations, such as slow convergence and a tendency to stay within the same local search space at small temperatures. To overcome these shortcomings, we use the variational classical annealing (VCA) framework that combines autoregressive recurrent neural networks (RNNs) with traditional annealing to sample solutions that are uncorrelated. In this paper, we demonstrate the potential of using VCA as an approach to solving real-world optimization problems. We explore VCA's performance in comparison with SA at solving three popular optimization problems: the maximum cut problem (Max-Cut), the nurse scheduling problem (NSP), and the traveling salesman problem (TSP). For all three problems, we find that VCA outperforms SA on average in the asymptotic limit by one or more orders of magnitude in terms of relative error. Interestingly, we reach large system sizes of up to $256$ cities for the TSP. We also conclude that in the best case scenario, VCA can serve as a great alternative when SA fails to find the optimal solution.

14 pages, 3 figures, 4 tables. Github code: https://github.com/RNN-VCA-CO/RNN-VCA-CO. Published version

References in corpus (9)

• A class of quantum many-body states that can be efficiently simulated
• Combinatorial Optimization with Physics-Inspired Graph Neural Networks
• Cyclical Annealing Schedule: A Simple Approach to Mitigating KL Vanishing
• Dilated Recurrent Neural Networks
• The Transformer Network for the Traveling Salesman Problem
• Supplementing Recurrent Neural Network Wave Functions with Symmetry and Annealing to Improve Accuracy
• Evaluating Curriculum Learning Strategies in Neural Combinatorial Optimization
• The deep learning and statistical physics applications to the problems of combinatorial optimization
• Meta Variational Monte Carlo

Cited by in corpus (7)

• Investigating Topological Order using Recurrent Neural Networks
• Qudit-inspired optimization for graph coloring
• Recurrent neural network wave functions for Rydberg atom arrays on kagome lattice
• Sparse Autoregressive Neural Networks for Classical Spin Systems
• Liouville Space Neural Network Representation of Density Matrices
• Lattice Protein Folding with Variational Annealing
• Large-scale portfolio optimization with variational neural annealing