arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2207.08189cond-mat.dis-nncs.LGmath.OC
收藏

用退火补充循环神经网络以求解组合优化问题

Supplementing Recurrent Neural Networks with Annealing to Solve Combinatorial Optimization Problems

BRAC University(BRAC大学);University of Waterloo(滑铁卢大学);Vector Institute for Artificial Intelligence(向量人工智能研究所)

Shoummo Ahsan Khandoker, Jawaril Munshad Abedin, Mohamed Hibat-Allah

AI总结:

本文提出将变分经典退火(VCA)与自回归循环神经网络结合,用于求解最大割、护士排班和旅行商问题,实验表明VCA在相对误差上平均优于模拟退火一个或多个数量级,并可在SA失败时作为有效替代。

摘要:

组合优化问题可以通过模拟退火(SA)等启发式算法求解,SA旨在通过热涨落在大型搜索空间中找到最优解。该算法通过马尔可夫链蒙特卡洛技术生成新解。这种采样方案可能导致严重局限,例如收敛缓慢,以及在低温下倾向于停留在同一局部搜索空间内。为克服这些不足,我们使用变分经典退火(VCA)框架,该框架将自回归循环神经网络(RNNs)与传统退火相结合,以采样不相关的解。在本文中,我们展示了使用VCA作为求解现实世界优化问题的一种方法的潜力。我们探索了VCA与SA在求解三个流行优化问题时的性能比较:最大割问题(Max-Cut)、护士排班问题(NSP)和旅行商问题(TSP)。对于所有三个问题,我们发现在渐近极限下,VCA在相对误差方面平均比SA优一个或多个数量级。有趣的是,对于TSP,我们达到了高达$256$个城市的大系统规模。我们还得出结论,在最佳情况下,当SA未能找到最优解时,VCA可以作为一个很好的替代方案。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑