Get access

Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments


  • Michael Drexl

    Corresponding author
    1. Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg University, Mainz, Germany
    2. Fraunhofer Centre for Applied Research on Supply Chain Services SCS, Nuremberg, Germany
    Search for more papers by this author


This article studies the vehicle routing problem with trailers and transshipments (VRPTT), a practically relevant, but challenging, generalization of the classical vehicle routing problem. The article makes three contributions: (i) Building on a nontrivial network representation, two mixed-integer programming formulations for the VRPTT are proposed. (ii) Based on these formulations, five different branch-and-cut algorithms are developed and implemented. (iii) The computational behavior of the algorithms is analyzed in an extensive computational study, using a large number of test instances designed to resemble real-world VRPTTs.Copyright © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 63(1), 119–133 2014

Get access to the full text of this article