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), 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.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01536484
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Aug 14 2014 3:28PM