Intermodal Transport

Routing Vehicles and Scheduling Containers

Master thesis (2018)

Authors

K. Kalicharan Electrical Engineering, Mathematics and Computer Science

Contributors

Dion Gijswijt (supervisor 1)
F. Phillipson (supervisor 1)
A Sangers (supervisor 1)
F Redig (supervisor 2)
K.I. Aardal (supervisor 2)
Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright: © 2018 Kishan Kalicharan
Branch and Bound ILP Min Cost Flow Container Network Design Local search algorithm Reductions Column Generating Cutting Plane Multicommodity Flow Intermodal Transport Time-Space Graph Fix Fixed-charge Capacitated Barges
More Info
expand_more

Published Date

14-05-2018

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

In intermodal transport multiple types of vehicles are used to transport containers. If the routes of the vehicles are known, then the container allocation can be optimized. This problem can be modelled as an integral multi-commodity min cost flow problem on a time-space graph. This model has an arc-based and path-based form. In this thesis, the path-based form is derived from the arc-based form. Some of the methods that can be used to solve this model are column generation, Lagrangian relaxation and the repeated cheapest path heuristic. If the routes of the vehicles are not known, then we also need to create routes for the vehicles. The problem of routing vehicles and scheduling containers can be modelled as a multi-commodity network design problem on a time-space graph. Variable reductions, cutting planes and other additional constraints are looked into to make the problem easier to solve. Additions to the model are researched that can make the model more suitable for use in practice. Additionally, ILP based solution methods are developed. Finally, some of these reductions, extensions and solution methods are implemented and reviewed.