A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand

The multiple vehicle traveling purchaser problem (MVTPP) consists of simultaneously selecting suppliers and routing a fleet of homogeneous vehicles to purchase different products at the selected suppliers so that all product demands are fulfilled and traveling and purchasing costs are minimized. We consider variants of the MVTPP in which the capacity of the vehicles can become binding and the demand for each product is one unit. Corresponding solution algorithms from the literature are either branch-and-cut or branch-and-price algorithms, where in the latter case the route-generation subproblem is solved on an expanded graph by applying standard dynamic-programming techniques. Our branch-price-and-cut algorithm employs a novel labeling algorithm that works directly on the original network and postpones the purchasing decisions until the route has been completely defined. Moreover, we define a new branching rule generally applicable in case of unitary product demands, introduce a new family of valid inequalities to apply when suppliers can be visited at most once, and show how product incompatibilities can be handled without considering additional resources in the pricing problem. In comprehensive computational experiments with standard benchmark sets we prove that the new branch-price-and-cut approach is highly competitive. (C) 2020 Elsevier B.V. All rights reserved.

Automated summary

This study discusses variants of the Multiple Vehicle Traveling Purchaser Problem (MVTPP), introduces a branch-price-and-cut algorithm, proposes a new branching rule and valid inequalities, and demonstrates how to handle product incompatibilities. Experimental results show that the new approach is highly competitive.