An extension of the arc orienteering problem and its application to cycle trip planning

The cycle trip planning problem (CTPP) can be formulated as a variant of the arc orienteering problem (AOP). The CTPP aims at finding a route with the highest possible score, in a directed graph, among those having a total length that does not exceed some given upper bound. The contributions of this paper are a new mathematical programming model for the CTPP and two solution methods. The first is a branch-and-cut approach that is able to solve small problem instances to optimality and the second is a metaheuristic that solves CTPP and AOP instances of realistic size to near optimality.status: publishe