JHJohann Hartleb

Johann Hartleb

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Johann Hartleb has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Learning-based scope reduction for real-time train rescheduling optimization in station areas

    by Sebastian Sehmisch, Tabish Haque, Christopher Szymula, Johann Hartleb, Nikola Bešinović

    Real-time train rescheduling requires the rapid generation of revised train timetables in response to unforeseen disruptions. Solving such problems using exact methods is computationally challenging, especially in case of infrastructure blockages at complex station areas with dense traffic. This paper introduces a Learning-based Scope Reduction (LSR) framework for local train rescheduling that effectively prunes the search space by fixing a subset of decision variables prior to optimization. The approach fixes nominal routing decisions of trains that are predicted to be unaffected by infrastructure disruptions. Logistic Regression, Random Forest, and Neural Network classifiers are trained on generated disruption scenarios and their corresponding high-quality rescheduling solutions obtained by solving a Mixed Integer Linear Programming model. To balance the trade-off in computation time savings and potential solution quality degradation, we propose an effective tuning method that strengthens prediction robustness to improve computational efficiency. We evaluate the proposed LSR framework on a real-world medium-sized station area in Germany. Results show that LSR achieves computation time reductions of up to 97%, while largely preserving solution quality in comparison to the full scope solutions. In the best configuration, the approach solves 95% of the most complex instances in real time, with only minor solution quality degradation of 2.3%. This work demonstrates the potential of a hybrid train rescheduling approach that combines supervised learning with exact optimization and offers a promising tool for intelligent real-time dispatching support.

  • Modeling and Solving Line Planning with Mode Choice

    by Johann Hartleb, Marie Schmidt, Dennis Huisman, Markus Friedrich

    We present a mixed-integer linear program (MILP) for line planning with mode and route choice. In contrast to existing approaches, the mode and route decisions of passengers are modeled depending on the line plan and commercial solvers can be applied to solve the corresponding MILP. The model aims at finding line plans that maximize the profit for the railway operator while estimating the corresponding passenger demand with aggregate choice models. Hence, the resulting line plans are not only profitable for operators but also attractive to passengers. By suitable preprocessing we are able to apply any aggregate choice model for mode choices using linear constraints. We provide and test means to improve the computational performance. Our experiments on the Intercity network of the Randstad, a metropolitan area in the Netherlands, show that models which assume a fixed passenger assignment to modes cannot attract the passenger numbers they were designed for and therefore lead to inferior profit compared with our new model. Supplemental Material: The online appendices are available at https://doi.org/10.1287/trsc.2022.1171 .


  • Open Access

    Vehicle scheduling for on-demand vehicle fleets in macroscopic travel demand models

    by Johann Hartleb, Markus Friedrich, Emely Richter

    The planning of on-demand services requires the formation of vehicle schedules consisting of service trips and empty trips. This paper presents an algorithm for building vehicle schedules that uses time-dependent demand matrices (= service trips) as input and determines time-dependent empty trip matrices and the number of required vehicles as a result. The presented approach is intended for long-term, strategic transport planning. For this purpose, it provides planners with an estimate of vehicle fleet size and distance travelled by on-demand services. The algorithm can be applied to integer and non-integer demand matrices and is therefore particularly suitable for macroscopic travel demand models. Two case studies illustrate potential applications of the algorithm and feature that on-demand services can be considered in macroscopic travel demand models.