Searching k-Optimal Goals for an Orienteering Problem on a Specialized Graph with Budget Constraints
We propose a novel non-randomized anytime orienteering algorithm for finding k-optimal goals that maximize reward on a specialized graph with budget constraints. This specialized graph represents a real-world scenario which is analogous to an orienteering problem of finding k-most optimal goal states.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Boosting Graph Search with Attention Network for Solving the General Orienteering Problem
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 e…
DecoderA Spatio-Temporal Representation for the Orienteering Problem with Time-Varying Profits
We consider an orienteering problem (OP) where an agent needs to visit a series (possibly a subset) of depots, from which the maximal accumulated profits are desired within given limited time budget. Different from most …
Clustered Orienteering Problem with Subgroups
This paper introduces an extension to the Orienteering Problem (OP), called Clustered Orienteering Problem with Subgroups (COPS). In this variant, nodes are arranged into subgroups, and the subgroups are organized into c…
The Sea Exploration Problem: Data-driven Orienteering on a Continuous Surface
This paper describes a problem arising in sea exploration, where the aim is to schedule the expedition of a ship for collecting information about the resources on the seafloor. The aim is to collect data by probing on a …
Gaussian ProcessesAttention, Learn to Solve Routing Problems!
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 a…
Combinatorial Optimization