The vehicle routing problem with cross-dock selection is a variant of the vehicle routing problem containing spatial and load synchronization constraints by which products are transferred and processed via at least one cross-dock. This paper presents a mathematical formulation of the problem and an adaptive large neighborhood search heuristic. Computational experiments on a set of benchmark instances demonstrate the efficiency of the proposed methodology. (C) 2016 Elsevier Ltd. All rights reserved.