A Branch-Cut-and-Price Approach for the Single-Trip and Multi-Trip Two-Echelon Vehicle Routing Problem with Time Windows

The authors thank François Vanderbeck, whose efforts contributed to obtaining the PhD studentship for G. Marques; Idex Bordeaux and Eduardo Uchoa for financing and implementing a three-month stay at Federal Fluminense University (Brazil) for G. Marques; Nico Dellaert and Phillipe Grangier for kindly sending us some of their solutions; and the anonymous referees for helping us to improve the quality of the paper. Experiments presented in this paper were carried out using the PlaFRIM (Federative Platform for Research in Computer Science and Mathematics), created under the Inria PlaFRIM development action with support from Bordeaux INP, Laboratoire Bordelais de Recherche en Informatique, and Institut de Mathématiques de Bordeaux and other entities: Conseil Régional d’Aquitaine, Université de Bordeaux, Centre Nationale de la Recherche Scientifique, and Agence Nationale de la Recherche in accordance to the “Programme d’Investissements d’Avenir.”