Network-level analysis of the performance of European intermodal freight transport

Master Thesis (2020)
Author(s)

Y. Houtsma (TU Delft - Civil Engineering & Geosciences)

Contributor(s)

Lorent Tavasszy – Graduation committee member (TU Delft - Transport and Planning)

Bart Wiegmans – Mentor (TU Delft - Transport and Planning)

J. H.R. Van Duin – Graduation committee member (TU Delft - Transport and Logistics)

H. Saeedi – Graduation committee member (TU Delft - Transport and Planning)

Jan Kiel – Mentor (Panteia)

Faculty
Civil Engineering & Geosciences
Copyright
© 2020 Y. Houtsma
More Info
expand_more
Publication Year
2020
Language
English
Copyright
© 2020 Y. Houtsma
Graduation Date
28-09-2020
Awarding Institution
Delft University of Technology
Programme
['Civil Engineering | Transport and Planning']
Faculty
Civil Engineering & Geosciences
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.

Abstract

Road freight transport has a major impact on society with external effects such as congestion, air pollution and carbon emissions. Therefore, the European Commission stimulates the more sustainable alternative Intermodal Freight Transportation (IFT). To increase the share of IFT, it is needed to know the performance of the current IFT-network. In this research, a methodology to assess performance of chains in IFT is developed. The developed Weighted Slacks-Based Data Envelopment Analysis model takes into account parallel and overlapping divisions and different structures of chains. The method is tested with a numerical example and a sample of real European IFT chains and solves issues of a compared Data Envelopment Analysis model. The methodology is then implemented to the rail and transshipment part of the North Sea – Mediterranean and Rhine – Alpine freight corridors.

Files

License info not available