Robust load planning of trains in intermodal transportation

Bruns, Florian; Goerigk, Marc; Knust, Sigrid; Schöbel, Anita
July 2014
OR Spectrum;Jul2014, Vol. 36 Issue 3, p631
Academic Journal
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, ) 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.


Related Articles

  • Robust cyclic berth planning of container vessels. Hendriks, Maarten; Laumanns, Marco; Lefeber, Erjen; Udding, Jan Tijmen // OR Spectrum;Jul2010, Vol. 32 Issue 3, p501 

    We consider a container terminal operator who faces the problem of constructing a cyclic berth plan. Such a plan defines the arrival and departure times of each cyclically calling vessel on a terminal, taking into account the expected number of containers to be handled and the necessary quay and...

  • Robust delay-constrained routing in telecommunications. Hijazi, Hassan; Bonami, Pierre; Ouorou, Adam // Annals of Operations Research;Jul2013, Vol. 206 Issue 1, p163 

    In telecommunications, operators usually use market surveys and statistical models to estimate traffic evolution in networks or to approximate queuing delay functions in routing strategies. Many research activities concentrated on handling traffic uncertainty in network design. Measurements on...

  • Robust linear semi-infinite programming duality under uncertainty. Goberna, M.; Jeyakumar, V.; Li, G.; López, M. // Mathematical Programming;Jun2013, Vol. 139 Issue 1/2, p185 

    In this paper, we propose a duality theory for semi-infinite linear programming problems under uncertainty in the constraint functions, the objective function, or both, within the framework of robust optimization. We present robust duality by establishing strong duality between the robust...

  • An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times. Wu, Tao; Shi, Leyuan; Song, Jie // Annals of Operations Research;Jun2012, Vol. 196 Issue 1, p635 

    This paper considers the capacitated multi-level lot-sizing problem with setup times, a class of difficult problems often faced in practical production planning settings. In the literature, relax-and-fix is a technique commonly applied to solve this problem due to the fact that setup decisions...

  • DIRECT USE OF EXTREMAL PRINCIPLES IN SOLVING CERTAIN OPTIMIZING PROBLEMS INVOLVING INEQUALITIES. Klein, Bertram // Journal of the Operations Research Society of America;May55, Vol. 3 Issue 2, p168 

    It is shown how extremal principles may be used in their rigorous sense to solve certain optimizing problems involving inequalities. The method applies to both linear and non-linear type problems as illustrated by the examples included in the paper, and is particularly suited for electronic...

  • Addendum to 'Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method.' Mészáros, Csaba; Gondzio, Jacek // INFORMS Journal on Computing;Spring2001, Vol. 13 Issue 2, p169 

    Focuses on issues related to linear programming. Analysis of linear programs prior to the application of interior point method; Importance of presolving techniques in saving solution time; Concerns over the precision of propositions 1 and 2.

  • A NEW SIMPLIFIED APPROACH TO THE SIMPLEX METHOD OF LINEAR PROGRAMMING. Rifai, Ahmed K.; Mehta, Anal J. // Industrial Management;Dec75, Vol. 17 Issue 12, p8 

    Presents a simplified approach to the simplex method of linear programming (LP). Consideration of LP as the most successful and frequent method used in solving problems which require the determination of an optimum value of a linear function; Presentation of a step by step procedure of the...

  • Meta-heuristic solution approaches for robust single allocation p-hub median problem with stochastic demands and travel times. Ghaderi, Abdolsalam; Rahmaniani, Ragheb // International Journal of Advanced Manufacturing Technology;Feb2016, Vol. 82 Issue 9-12, p1627 

    Hub location problems appear at the core of strategic planning for many transportation and logistics problems. This class of optimization problems has received a wide gamut of research attention during the last few decades. However, the associated mathematical formulations are mainly developed...

  • PRIMJENA MATEMATIÄŒKIH MODELA U PLANIRANJU LOGISTIÄŒKIH OPERACIJA. Stanković, Ratko; Radulović, Siniša; Hrupački, Slađana // Technical Journal / Tehnicki Glasnik;Sep2013, Vol. 7 Issue 3, p290 

    Linear programming mathematical models can be applied in planning logistics operations, in order to facilitate solving logistics problems. This approach is demonstrated on two basic logistics problems - the resource allocation problem and the distribution network problem. The optimal solution...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics