This article studies the Hazardous Orienteering Problem (HOP), a variant of more famous (OP). In OP, vehicle earns profit for each customer it visits (e.g., to pick up parcel) subject an upper bound on tour time. HOP, parcels picked at some customers have probability triggering catastrophic event. The depends how long travel vehicle. If any event triggers, entire collected is lost. goal determi...

We consider the P2P orienteering problem on general metrics and present a (2+ε) approximation algorithm. In the stochastic P2P orienteering problem we are given a metric and each node has a fixed reward and random size. The goal is to devise a strategy for visiting the nodes so as to maximize the expected value of the reward without violating the budget constraints. We present an approximation ...

This is an addendum to the paper by Tricoire et al. on various orienteering problems [1]. We present experimental results on the orienteering problem with time windows (OPTW) and team orienteering problem with time windows (TOPTW) test instances introduced by Montemanni et al. [2].

Visiting and observing specified locations is a fundamental task for various applications including environmental monitoring military operations. The Orienteering Problem (OP) variant of routing problems in which the goal to maximize objective function by visiting most rewarding while respecting limited travel budget (e.g., distance or time). However, traditional formulations generally neglect ...

Email: [email protected] Abstract: The NP-hard (complete) team orienteering problem is a particular vehicle routing problem with the aim of maximizing the profits gained from visiting control points without exceeding a travel cost limit. The team orienteering problem has a number of applications in several fields such as athlete recruiting, technician routing and tourist trip. Therefore, so...

During the last decade, a number of challenging applications in logistics, tourism and other fields were modelled as orienteering problems (OP). In the orienteering problem, a set of vertices is given, each with a score. The goal is to determine a path, limited in length, that visits some vertices and maximises the sum of the collected scores. In this paper, the literature about the orienteerin...

The probabilistic orienteering problem (POP) is defined on a directed graph where a cost is associated with each arc and a prize is associated with each node. Moreover, each node will be available for visit only with a certain probability. A server starts from a fixed origin, has a given time limit to visit a subset of nodes, and ends at a fixed destination. In a first stage, a node subset has ...