Integrated planning of loaded and empty container movements

Authors:
Kris Braekers;An Caris;Gerrit K. Janssens
Affiliations:
Transportation Research Institute, Hasselt University, Diepenbeek, Belgium 3590;Transportation Research Institute, Hasselt University, Diepenbeek, Belgium 3590 and Research Foundation Flanders (FWO), Brussels, Belgium 1000;Transportation Research Institute, Hasselt University, Diepenbeek, Belgium 3590
Venue:
OR Spectrum
Year:
2013

Citing 11
Cited 3

Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows

Management Science
Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing

Journal of Computational Physics
Dynamic and stochastic models for the allocation of empty containers

Operations Research
The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Simulation Modeling and Analysis (McGraw-Hill Series in Industrial Engineering and Management)

Simulation Modeling and Analysis (McGraw-Hill Series in Industrial Engineering and Management)
Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows

Computers and Operations Research
A local search heuristic for the pre- and end-haulage of intermodal container terminals

Computers and Operations Research
An Effective Multirestart Deterministic Annealing Metaheuristic for the Fleet Size and Mix Vehicle-Routing Problem with Time Windows

Transportation Science
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows

Computers and Operations Research
A satellite navigation system to improve the management of intermodal drayage

Advanced Engineering Informatics
The multiple TSP with time windows: vehicle bounds based on precedence graphs

Operations Research Letters

Decision support in intermodal transport: A new research agenda

Computers in Industry
Dynamic approach to solve the daily drayage problem with transit time uncertainty

Computers in Industry
Optimization of empty container movements using street-turn: Application to Valencia hinterland

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficiently planning drayage operations is an important task for transportation companies since these operations constitute a large part of the cost of an intermodal transport. In this paper, a full truckload vehicle routing problem for transporting loaded and empty containers in drayage operations is studied. For empty container transports, either the origin or the destination is not predefined. The problem is formulated as an asymmetric multiple vehicle Travelling Salesman Problem with Time Windows (am-TSPTW). Two solution approaches are proposed: a sequential and an integrated approach. For both approaches, a single- and a two-phase deterministic annealing algorithm are presented. Results show that the proposed algorithms are able to find good quality solutions in a small amount of computation time. The integrated approach clearly outperforms the sequential one and the results confirm the advantage of using a two-phase algorithm for vehicle routing problems with hierarchical objectives. Finally, it is shown that the proposed integrated solution method improves previous results on a similar problem.