Branch-and-Cut Algorithms for the Vehicle Routing Problem with Trailers and Transshipments

Michael Drexl ()
Additional contact information
Michael Drexl: Johannes Gutenberg University Mainz

No 1210, Working Papers from Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz

Abstract: This paper studies the vehicle routing problem with trailers and transshipments (VRPTT), a practically relevant, but challenging, generalization of the classical vehicle routing problem. The paper makes three contributions: (i) Building on a non-trivial 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 behaviour of the algorithms is analyzed in an extensive computational study, using a large number of test instances designed to resemble real-world VRPTTs.

Keywords: Branch-and-cut; Vehicle Routing; Synchronization; Trailer; Transshipment (search for similar items in EconPapers)
Pages: 23 page
Date: 2012-09-25
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_1210.pdf First version, 2012 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:jgu:wpaper:1210

Access Statistics for this paper

More papers in Working Papers from Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz Contact information at EDIRC.
Bibliographic data for series maintained by Research Unit IPP ().