We introduce the Undirected Capacitated General Routing Problem with Profits.
An interesting application refers to the multiple-period bus touring.
We propose a two-phase exact approach to the problem.
Branch-and-cut algorithms are used in both phases.
Computational results on a large set of problem instances are presented.