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

by   Zongtao Liu, et al.
Zhejiang University
NetEase, Inc

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.


page 1

page 2

page 3

page 4


Solve routing problems with a residual edge-graph attention neural network

For NP-hard combinatorial optimization problems, it is usually difficult...

A Deep Reinforcement Learning Algorithm Using Dynamic Attention Model for Vehicle Routing Problems

Recent researches show that machine learning has the potential to learn ...

Graph-based Heuristic Search for Module Selection Procedure in Neural Module Network

Neural Module Network (NMN) is a machine learning model for solving the ...

Learn to Design the Heuristics for Vehicle Routing Problem

This paper presents an approach to learn the local-search heuristics tha...

Dynamic Routing with Path Diversity and Consistency for Compact Network Learning

In this paper, we propose a novel dynamic routing inference method with ...

Please sign up or login with your details

Forgot password? Click here to reset