A set covering approach for the double traveling salesman problem with multiple stacks