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

被引：44

作者：

Drexl, Michael ^{[1
,2
]}

机构：

[1] Johannes Gutenberg Univ Mainz, Chair Logist Management, Gutenberg Sch Management & Econ, D-55122 Mainz, Germany

[2] Fraunhofer Ctr Appl Res Supply Chain Serv SCS, Nurnberg, Germany

来源：

NETWORKS | 2014年 / 63卷 / 01期

关键词：

branch-and-cut; vehicle routing; synchronization; trailer; transshipment; TIME WINDOWS; TABU SEARCH; TRUCK; INEQUALITIES; CONSTRAINTS; MODEL;

D O I：

10.1002/net.21526

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 (c) 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 63(1), 119-133 2014

引用

页码：119 / 133

页数：15

共 26 条

[1]

[Anonymous], 2002, The vehicle routing problem pp

[2]

Ascheuer N, 2000, NETWORKS, V36, P69, DOI 10.1002/1097-0037(200009)36:2<69::AID-NET1>3.0.CO

[3]

2-Q

[4] Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints [J].