Home > Research > Publications & Outputs > Robust load planning of trains in intermodal tr...
View graph of relations

Robust load planning of trains in intermodal transportation

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Robust load planning of trains in intermodal transportation. / Bruns, Florian; Goerigk, Marc; Knust, Sigrid et al.
In: OR Spectrum, Vol. 36, No. 3, 07.2014, p. 631-668.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Bruns, F, Goerigk, M, Knust, S & Schöbel, A 2014, 'Robust load planning of trains in intermodal transportation', OR Spectrum, vol. 36, no. 3, pp. 631-668. https://doi.org/10.1007/s00291-013-0341-8

APA

Bruns, F., Goerigk, M., Knust, S., & Schöbel, A. (2014). Robust load planning of trains in intermodal transportation. OR Spectrum, 36(3), 631-668. https://doi.org/10.1007/s00291-013-0341-8

Vancouver

Bruns F, Goerigk M, Knust S, Schöbel A. Robust load planning of trains in intermodal transportation. OR Spectrum. 2014 Jul;36(3):631-668. Epub 2013 Sept 6. doi: 10.1007/s00291-013-0341-8

Author

Bruns, Florian ; Goerigk, Marc ; Knust, Sigrid et al. / Robust load planning of trains in intermodal transportation. In: OR Spectrum. 2014 ; Vol. 36, No. 3. pp. 631-668.

Bibtex

@article{f7541dc2245947cca0737cfd1f2d989c,
title = "Robust load planning of trains in intermodal transportation",
abstract = "In this paper, the problem of robust load planning for trains in intermodal container terminals is studied. The goal of load planning is to choose wagon settings and assign load units to wagons of a train such that the utilization of the train is maximized, and setup and transportation costs in the terminal are minimized. However, in real-world applications, many of the parameters needed for the model are not known exactly. Since feasibility of the resulting load distribution has always to be guaranteed, we decided to use a robust approach. In particular, we apply the concepts of strict and adjustable robustness to enhance the load planning problem. Based on a formulation developed in Bruns and Knust (OR Spectrum 34:511-533, 2012) for the deterministic load planning problem, we propose mixed-integer linear programming formulations for most of the respective robust counterparts, dependent on the type of uncertainty. An experimental study shows that most of the robust problems can be solved within runtimes of a few minutes, which is good enough for real-world applications. Furthermore, our results indicate that robust solutions may improve the planning considerably, and that it is promising to add robustness even to large mixed-integer programs with many and diverse technical constraints. ",
keywords = "Adjustable robustness, Intermodal transportation, Load planning, Robustness, Strict robustness",
author = "Florian Bruns and Marc Goerigk and Sigrid Knust and Anita Sch{\"o}bel",
year = "2014",
month = jul,
doi = "10.1007/s00291-013-0341-8",
language = "English",
volume = "36",
pages = "631--668",
journal = "OR Spectrum",
issn = "0171-6468",
publisher = "Springer Verlag",
number = "3",

}

RIS

TY - JOUR

T1 - Robust load planning of trains in intermodal transportation

AU - Bruns, Florian

AU - Goerigk, Marc

AU - Knust, Sigrid

AU - Schöbel, Anita

PY - 2014/7

Y1 - 2014/7

N2 - In this paper, the problem of robust load planning for trains in intermodal container terminals is studied. The goal of load planning is to choose wagon settings and assign load units to wagons of a train such that the utilization of the train is maximized, and setup and transportation costs in the terminal are minimized. However, in real-world applications, many of the parameters needed for the model are not known exactly. Since feasibility of the resulting load distribution has always to be guaranteed, we decided to use a robust approach. In particular, we apply the concepts of strict and adjustable robustness to enhance the load planning problem. Based on a formulation developed in Bruns and Knust (OR Spectrum 34:511-533, 2012) for the deterministic load planning problem, we propose mixed-integer linear programming formulations for most of the respective robust counterparts, dependent on the type of uncertainty. An experimental study shows that most of the robust problems can be solved within runtimes of a few minutes, which is good enough for real-world applications. Furthermore, our results indicate that robust solutions may improve the planning considerably, and that it is promising to add robustness even to large mixed-integer programs with many and diverse technical constraints.

AB - In this paper, the problem of robust load planning for trains in intermodal container terminals is studied. The goal of load planning is to choose wagon settings and assign load units to wagons of a train such that the utilization of the train is maximized, and setup and transportation costs in the terminal are minimized. However, in real-world applications, many of the parameters needed for the model are not known exactly. Since feasibility of the resulting load distribution has always to be guaranteed, we decided to use a robust approach. In particular, we apply the concepts of strict and adjustable robustness to enhance the load planning problem. Based on a formulation developed in Bruns and Knust (OR Spectrum 34:511-533, 2012) for the deterministic load planning problem, we propose mixed-integer linear programming formulations for most of the respective robust counterparts, dependent on the type of uncertainty. An experimental study shows that most of the robust problems can be solved within runtimes of a few minutes, which is good enough for real-world applications. Furthermore, our results indicate that robust solutions may improve the planning considerably, and that it is promising to add robustness even to large mixed-integer programs with many and diverse technical constraints.

KW - Adjustable robustness

KW - Intermodal transportation

KW - Load planning

KW - Robustness

KW - Strict robustness

U2 - 10.1007/s00291-013-0341-8

DO - 10.1007/s00291-013-0341-8

M3 - Journal article

AN - SCOPUS:84902484343

VL - 36

SP - 631

EP - 668

JO - OR Spectrum

JF - OR Spectrum

SN - 0171-6468

IS - 3

ER -