An exact algorithm for team orienteering problems

Optimising routing of vehicles constitutes a major logistic stake in many industrial contexts. We are interested here in the optimal resolution of special cases of vehicle routing problems, known as team orienteering problems. In these problems, vehicles are guided by a reward that can be collected from customers, while the length of routes is limited. The main difference with classical vehicle routing problems is that not all customers have to be visited. The solution method we propose here is based on a Branch & Price algorithm. It is, as far as we know, the first exact method proposed for such problems, except for a preliminary work from Gueguen (Methodes de resolution exacte pour problemes de tournees de vehicules. These de doctorat, ecole Centrale Paris 1999) and a work from Butt and Ryan (Comput Oper Res 26(4):427-441 1999). It permits to solve instances with up to 100 customers.