A Tabu Search Heuristic for the Inland Container Transportation Problem

Authors:
Sebastian Sterzik;Herbert Kopfer
Affiliations:
Department of Economics and Business Studies, University of Bremen, Wilhelm-Herbst-Str. 5, 28359 Bremen, Germany;Department of Economics and Business Studies, University of Bremen, Wilhelm-Herbst-Str. 5, 28359 Bremen, Germany
Venue:
Computers and Operations Research
Year:
2013

Citing 4
Cited 1

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
VRP with Time Windows

The vehicle routing problem
A local search heuristic for the pre- and end-haulage of intermodal container terminals

Computers and Operations Research

Block transportation scheduling under delivery restriction in shipyard using meta-heuristic algorithms

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

The Inland Container Transportation Problem describes the movement of full and empty containers among a number of terminals, depots and customers in a hinterland region. A trucking company with a homogeneous fleet of trucks has to serve customers which either receive goods by inbound containers or ship goods by outbound containers. While keeping given hard time constraints the total operating time of all trucks has to be minimized. A comprehensive mathematical formulation which considers vehicle routing and scheduling and empty container repositioning simultaneously is defined. The problem is solved by an efficient Tabu Search Heuristic. Computational experiments carried out on small- and large-sized instances indicate that the proposed algorithm performs well with respect to effectiveness and efficiency.