Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach

We develop a branch-and-cut algorithm that makes use of the proposed model and valid inequalities. This cutting plane algorithm is implemented and tested on a large family of symmetric and asymmetric instances derived from randomly generated problems, showing the usefulness of the proposed valid inequalities.