A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks