Truck and trailer routing-Problems, heuristics and computational experience

Authors:
Ulrich Derigs;Markus Pullmann;Ulrich Vogel
Affiliations:
Universität zu Köln, Pohligstr. 1, 50969 Köln, Germany;Universität zu Köln, Pohligstr. 1, 50969 Köln, Germany;Universität zu Köln, Pohligstr. 1, 50969 Köln, Germany
Venue:
Computers and Operations Research
Year:
2013

Citing 14
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
New optimization heuristics

Journal of Computational Physics
Record breaking optimization results using the ruin and recreate principle

Journal of Computational Physics
The vehicle routing problem

The vehicle routing problem
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A general heuristic for vehicle routing problems

Computers and Operations Research
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows

Transportation Science
Solving the truck and trailer routing problem based on a simulated annealing heuristic

Computers and Operations Research
Short Communication: A note on the truck and trailer routing problem

Expert Systems with Applications: An International Journal
A tabu search heuristic for the truck and trailer routing problem

Computers and Operations Research
A GRASP with evolutionary path relinking for the truck and trailer routing problem

Computers and Operations Research
Vehicle routing with compartments: applications, modelling and heuristics

OR Spectrum
A simulated annealing heuristic for the truck and trailer routing problem with time windows

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.