Truck and trailer routing-Problems, heuristics and computational experience

被引：100

作者：

Derigs, Ulrich ^{[1
]}

Pullmann, Markus ^{[1
]}

Vogel, Ulrich ^{[1
]}

机构：

[1] Univ Cologne, D-50969 Cologne, Germany

来源：

COMPUTERS & OPERATIONS RESEARCH | 2013年 / 40卷 / 02期

关键词：

Truck and trailer routing problem; Load transfer; Time windows; Metaheuristics; Computational study; SCHEDULING PROBLEMS; VEHICLE; SEARCH; ALGORITHM;

D O I：

10.1016/j.cor.2012.08.007

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In the truck and trailer routing problem (TTRP) the vehicle fleet consists of truck units and trailer units with some customers only accessible by truck. For that purpose trailers can be uncoupled en-route at customers where truck sub-tours are built. We discuss several variants of this specific rich vehicle routing problem (RVRP): the TTRP with and without the option of load transfer between truck and trailer as well as the requirement of time windows for delivery. We present computational experience with a simple and flexible hybrid approach which is based on local search and large neighborhood search as well as standard metaheuristic control strategies. This approach which has shown to be rather effective on several other RVRP-classes before can compete with complex state-of-the-art approaches with respect to speed and accuracy on the TTRP too. (c) 2012 Elsevier Ltd. All rights reserved.

引用

页码：536 / 546

页数：11

共 39 条

[1] Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints : an application to road feeder service planning in air cargo transportation [J].