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

Authors:
A. Caris;G. K. Janssens
Affiliations:
Transportation Research Institute, Hasselt University - Campus Diepenbeek, Wetenschapspark 5 - bus 6, 3590 Diepenbeek, Belgium;Transportation Research Institute, Hasselt University - Campus Diepenbeek, Wetenschapspark 5 - bus 6, 3590 Diepenbeek, Belgium
Venue:
Computers and Operations Research
Year:
2009

Citing 6
Cited 6

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

Operations Research
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
Simulation Modeling and Analysis

Simulation Modeling and Analysis
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows

Computers and Operations Research
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science
Formulations and exact algorithms for the vehicle routing problem with time windows

Computers and Operations Research

A satellite navigation system to improve the management of intermodal drayage

Advanced Engineering Informatics
Solving vehicle routing with full container load and time windows

ICCL'12 Proceedings of the Third international conference on Computational Logistics
A Tabu Search Heuristic for the Inland Container Transportation Problem

Computers and Operations Research
Integrated planning of loaded and empty container movements

OR Spectrum
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

Quantified Score

Hi-index	0.01

Visualization

Abstract

Pre- and end-haulage of intermodal container terminals involves the pickup or delivery of containers at customer locations. The attractiveness of intermodal transport can be increased by organizing the road segment in the intermodal transport chain more efficiently. In this paper the drayage of containers in the service area of an intermodal terminal is modelled as a full truckload pickup and delivery problem with time windows (FTPDPTW). A two-phase insertion heuristic is proposed to construct an initial solution. This solution is improved with a local search heuristic based on three neighbourhoods. Numerical experiments are described to demonstrate the mechanisms of the heuristics.