arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.04730cs.AI
收藏

利用注意力网络推进图搜索求解一般定向越野问题

Boosting Graph Search with Attention Network for Solving the General Orienteering Problem

Zhejiang University(浙江大学);State Grid Corporation of China(国家电网公司)

Zongtao Liu, Jing Xu, Jintao Su, Tao Xiao, Yang Yang

摘要:

最近,一些研究探索了使用神经网络来解决不同的路由问题,这是一个吉祥的方向。这些研究通常设计一个基于编码器-解码器的框架,该框架使用节点的编码器嵌入和特定于问题的上下文来产生节点序列(路径),并通过束搜索进一步优化产生的结果。然而,现有模型仅支持节点坐标作为输入,忽略了所研究路由问题的自参考特性,且缺乏对节点选择初始阶段可靠性低的考虑,难以应用于实际。在本文中,我们以定向越野问题为例,以解决这些限制。我们提出了一种新的组合的变体束搜索算法和学习启发式解决一般定向运动问题。我们用一个以节点间距离为输入的注意力网络获得启发式,并通过一个强化学习框架学习它。实证研究表明,我们的方法可以超越广泛的基线,并取得接近最佳或高度专业化的方法的结果。此外,我们提出的框架可以很容易地应用到其他路由问题。我们的代码是公开的。

英文摘要:

Recently, several studies have explored the use of neural network to solve different routing problems, which is an auspicious direction. These studies usually design an encoder-decoder based framework that uses encoder embeddings of nodes and the problem-specific context to produce node sequence(path), and further optimize the produced result on top by beam search. However, existing models can only support node coordinates as input, ignore the self-referential property of the studied routing problems, and lack the consideration about the low reliability in the initial stage of node selection, thus are hard to be applied in real-world. In this paper, we take the orienteering problem as an example to tackle these limitations. We propose a novel combination of a variant beam search algorithm and a learned heuristic for solving the general orienteering problem. We acquire the heuristic with an attention network that takes the distances among nodes as input, and learn it via a reinforcement learning framework. The empirical studies show that our method can surpass a wide range of baselines and achieve results close to the optimal or highly specialized approach. Also, our proposed framework can be easily applied to other routing problems. Our code is publicly available.

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

↑