  This paper discusses a heuristic approach for Team Orienteering Problems with
Time Windows. The method we propose takes advantage of a solution model based
on a hierarchic generalization of the original problem, which is combined with
an Ant Colony System algorithm.
  Computational results on benchmark instances previously adopted in the
literature suggest that the algorithm we propose is effective in practice.
