@article{ref1,
title="An extension of the arc orienteering problem and its application to cycle trip planning",
journal="Transportation research part E: logistics and transportation review",
year="2014",
author="Verbeeck, C. and Vansteenwegen, P. and Aghezzaf, E. -h.",
volume="68",
number="",
pages="64-78",
abstract="The cycle trip planning problem (CTPP) can be formulated as a variant of the arc orienteering problem (AOP), which is a well-known combinatorial optimisation problem. 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 for its solution. 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 in a few seconds.<p />",
language="en",
issn="1366-5545",
doi="10.1016/j.tre.2014.05.006",
url="http://dx.doi.org/10.1016/j.tre.2014.05.006"
}