The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach

This paper introduces and formulates this generalization, called the Traveling Purchaser Problem with Multiple Stacks and Deliveries. It proposes valid inequalities, and adapts some constraints defined for the Double Traveling Salesman Problem with Multiple Stacks by other authors. This formulation motivates a Branch-and-Cut algorithm whose performance has been tested on 240 instances from the literature properly adapted. Our computational experience confirms the effectiveness of the valid inequalities here proposed, and shows that instances of up to 24 products and 32 markets can be solved to optimality.