CONTACT US: Contact info
|
Citation |
Verbeeck C, Vansteenwegen P, Aghezzaf EH. Transp. Res. E Logist. Transp. Rev. 2014; 68: 64-78. |
|
Copyright |
(Copyright © 2014, Elsevier Publishing) |
|
DOI |
|
PMID |
unavailable |
|
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. |