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

Journal Article

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

Related Topics

Related Publications

Related Content

Site Footer


This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.