4OR

, Volume 5, Issue 3, pp 211–230

An exact algorithm for team orienteering problems

  • Sylvain Boussier
  • Dominique Feillet
  • Michel Gendreau
Regular paper

DOI: 10.1007/s10288-006-0009-1

Cite this article as:
Boussier, S., Feillet, D. & Gendreau, M. 4OR (2007) 5: 211. doi:10.1007/s10288-006-0009-1

Abstract

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 résolution exacte pour problémes de tournées de véhicules. Thése de doctorat, école 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.

Keywords

Selective vehicle routing problem with time windows Team orienteering problem Column generation Branch & price Routing problems with profits 

MSC Classification

90C10 90C35 90C90 

Copyright information

© Springer Verlag 2006

Authors and Affiliations

  • Sylvain Boussier
    • 1
  • Dominique Feillet
    • 2
  • Michel Gendreau
    • 3
  1. 1.LGI2P, Ecole des Mines d’Alès - Site EERIEParc Scientifique Georges BesseNimes Cedex 1France
  2. 2.Laboratoire d’informatique d’AvignonUniversité d’Avignon et des pays de VaucluseAvignon Cedex 9France
  3. 3.Centre de recherche sur les transportsUniversité de MontréalMontréalCanada