The Team Orienteering Arc Routing Problem

Autores UPV
Año
Revista TRANSPORTATION SCIENCE

Abstract

In this paper a formulation for the team orienteering arc routing problem (TOARP) is proposed and studied a relaxation of its associated polyhedron. Some families of valid and facet-inducing inequalities are presented that are used in the implementation of a branch-and-cut algorithm for the resolution of the problem. Computational experiments are run on a large set of benchmark instances.