arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.08475stat.MLcs.LG
收藏

注意,学习解决路由问题!

Attention, Learn to Solve Routing Problems!

University of Amsterdam(阿姆斯特丹大学);ORTEC(奥泰克公司);CIFAR(加拿大高级研究所)

Wouter Kool, Herke van Hoof, Max Welling

摘要:

最近提出的学习组合优化问题的算法的想法是有前途的,因为它可以节省昂贵的开发。然而,为了将这一想法推向实际实施,我们需要更好的模式和更好的培训方法。我们在两个方向上都有贡献:我们提出了一个基于注意力层的模型,该模型比指针网络具有优势,我们展示了如何使用REINFORCE训练这个模型,该模型具有基于确定性贪婪卷展的简单基线,我们发现这比使用值函数更有效。我们显着改善最近学到的旅行推销员问题(TSP),接近最佳结果的问题多达100个节点。使用相同的超参数,我们学习了车辆路径问题(VRP)的两个变体,定向问题(OP)和奖品收集TSP(PCTSP)(的随机变体)的强大算法,优于广泛的基线,并获得接近高度优化和专业算法的结果。

英文摘要:

The recently presented idea to learn heuristics for combinatorial optimization problems is promising as it can save costly development. However, to push this idea towards practical implementation, we need better models and better ways of training. We contribute in both directions: we propose a model based on attention layers with benefits over the Pointer Network and we show how to train this model using REINFORCE with a simple baseline based on a deterministic greedy rollout, which we find is more efficient than using a value function. We significantly improve over recent learned heuristics for the Travelling Salesman Problem (TSP), getting close to optimal results for problems up to 100 nodes. With the same hyperparameters, we learn strong heuristics for two variants of the Vehicle Routing Problem (VRP), the Orienteering Problem (OP) and (a stochastic variant of) the Prize Collecting TSP (PCTSP), outperforming a wide range of baselines and getting results close to highly optimized and specialized algorithms.

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

↑