Searching k-Optimal Goals for an Orienteering Problem on a Specialized Graph with Budget Constraints

2020/11/02 by Abhinav Sharma, Sharma, Abhinav, Advait Deshpande +9
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #cs.AI

paper · pdf · doi:10.48550/arxiv.2011.00781

arxiv created 2020/11/02 · arxiv updated 2020/11/03

Abstract

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.

Related

• A survey of the orienteering problem: model evolution, algorithmic advances, and future directions
• Orienteering (with Time Windows) on Restricted Graph Classes
• Competing for the most profitable tour: The orienteering interdiction game
• A revisited branch-and-cut algorithm for large-scale orienteering problems
• Clustered Orienteering Problem with Subgroups