The input to the stochastic orienteering problem [13] consists of a budget B and metric (V, d) where each vertex v ∈ V has a job with a deterministic reward and a random processing time (drawn from a known distribution). The processing times are independent across vertices. The goal is to obtain a nonanticipatory policy (originating from a given root vertex) to run jobs at different vertices, t...

We consider the NP-hard Stochastic Orienteering Problem, where goal is to navigate between start and end vertices in a graph, maximizing sum of rewards for visited while obeying travel budget over edges with stochastic cost within given probability failure. Previously, we solved this by finding an initial path using deterministic orienteering solver transformed it into policy Constrained Markov...

This paper addresses the Clustered Orienteering Problem, a recent variant of the Orienteering Problem. In this variant, customers are grouped into subsets called clusters. A profit is assigned to each cluster and is collected only if all customers belonging to the cluster are served. The objective is to visit the customers of a subset of clusters in order to maximize the total collected profit ...

The Orienteering Problem (OP) is a routing problem that has numerous applications in various fields such as logistics and tourism. The objective is to determine a subset of nodes to visit so that the total collected score is maximized and a given time budget is not exceeded. The extensive application of OP has led to many different variants, including the Team Orienteering Problem (TOP) and the...

The orienteering problem (OP) is defined on a graph in which scores are assigned to the vertices and a travel time is assigned to each edge linking two vertices. The objective of the OP is to select a subset of vertices and determine the order in which they are visited so that the total collected score is maximized while the maximum total travel time is not exceeded. In addition, a feasible OP ...

The Team Orienteering Problem (TOP) is defined as to find a set of vehicle walks such that the total collected reward received from visiting a subset of customers is maximized and the length of each vehicle walk is restricted by a pre-specified limit. The team orienteering problem with capacity constraint and time window(TOPCT) is an extension of the TOP where each customer has a demand and a t...