This paper introduces, models and solves a generalization of the Orienteering Problem, called the The Orienteering Problem with Variable Profits (OPVP). The OPVP is defined on a complete undirected graph G = (V,E), with a depot at vertex 0. Every vertex i ∈ V \ {0} has a profit pi to be collected, and an associated collection parameter αi ∈ [0, 1]. The vehicle may make a number of “passes”, col...

In this paper, we analyze both the deterministic and stochastic versions of a team orienteering problem (TOP) in which rewards from customers are dynamic. The typical goal TOP is to select set visit order maximize total reward gathered by fixed fleet vehicles. To better reflect some real-life scenarios, consider version associated with each customer might depend upon visited within route, bonus...

In this thesis, we present new approximation algorithms as well as hardness of approximation results for N P-hard vehicle routing problems related to public transportation. We consider two different problem classes that also occur frequently in areas such as logistics, robotics, or distribution systems. For the first problem class, the goal is to visit as many locations in a network as possible...

In this work, we propose a hybrid heuristic in order to solve the Team Orienteering Problem (TOP). Given a set of points (or customers), each with associated score (profit or benefit), and a team that has a fixed number of members, the problem to solve is to visit a subset of points in order to maximize the total collected score. Each member performs a tour starting at the start point, visiting...