The undirected m-Capacitated Peripatetic Salesman Problem

► We propose exact branch-and-cut and branch-and-cut-and-price algorithms for the m-Capacitated Peripatetic Salesman Problem. ► This problem has applications in the design of patrol routes, in the design of AGV loops and in hazmat transportation. ► Our best algorithm solves a set covering based model by branch-and-cut-and-price. ► Instances containing up to 144 vertices can be solved optimally.