New path elimination constraints for multi-depot routing problems

Abstract

Multi-depot routing problems arise in distribution logistics where a set of vehicles based at several depots are used to serve a number of clients. Most variants of this problem have the basic requirement that the route of each vehicle starts and ends at the same depot. This article describes new inequalities, namely multi-cut constraints (MCC), which enforce this requirement in mathematical programming formulations of multi-depot routing problems. The MCCs are exponential in size, and are equivalent to a compact three-index formulation for the problem in terms of the associated linear programming relaxations. The article describes how a generalization of the MCCs can be obtained, in a similar manner, by using a stronger version of the three-index formulation. The connection between the compact and the exponential formulations implies a separation procedure based on max-flow/min-cut computations, which has reduced complexity in comparison with a previously known set of constraints described for the same purpose. The new inequalities are used in a branch-and-cut algorithm. Computational results are presented for instances with up to 300 clients and 60 depots.

More information

Identifiers

ORCID for Tolga Bektas: orcid.org/0000-0003-0634-144X

Catalogue record

Export record

Altmetrics