Simulated annealing (SA) is a stochastic global optimisation technique applicable to a wide range of discrete and continuous variable problems. Despite its simplicity, the development of an effective SA optimiser for a given problem hinges on a handful of carefully handpicked components; namely, neighbour proposal distribution and temperature annealing schedule. In this work, we view SA from a reinforcement learning perspective and frame the proposal distribution as a policy, which can be optimised for higher solution quality given a fixed computational budget. We demonstrate that this Neural SA with such a learnt proposal distribution, parametrised by small equivariant neural networks, outperforms SA baselines on a number of problems: Rosenbrock's function, the Knapsack problem, the Bin Packing problem, and the Travelling Salesperson problem. We also show that Neural SA scales well to large problems - generalising to significantly larger problems than the ones seen during training - while achieving comparable performance to popular off-the-shelf solvers and other machine learning methods in terms of solution quality and wall-clock time.
Simulated Annealing-based Candidate Optimization for Batch Acquisition Functions
a Department of Materials Science;Engineering, Texas A\&M University, College Station, TX, USA 77843;b J. Mike Walker '66 Department of Mechanical Engineering, Texas A\&M University, College Station, TX, USA 77843;c Wm Michael Barnes '64 Department of Industrial;Systems Engineering, Texas A\&M University, College Station, TX, USA 77843
Optimization of Worker Scheduling at Logistics Depots Using Genetic Algorithms and Simulated Annealing
Peoples' Friendship University of Russia(俄罗斯人民友谊大学);Southern Methodist University(南卫理公会大学);Columbia University(哥伦比亚大学);Washington University in St. Louis(圣路易斯华盛顿大学);China United Network Communications Group Co., Ltd.(中国联合网络通信集团有限公司);Central China Normal University(华中师范大学)