Premium
Branch‐and‐cut algorithms for the vehicle routing problem with trailers and transshipments
Author(s) -
Drexl Michael
Publication year - 2014
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.21526
Subject(s) - generalization , vehicle routing problem , computer science , routing (electronic design automation) , integer programming , branch and cut , algorithm , representation (politics) , mathematical optimization , integer (computer science) , mathematics , computer network , mathematical analysis , politics , political science , law , programming language
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