Jacob Trepat Borecka


Loading...

Last Name

Trepat Borecka

First Name

Jacob

Organisational unit

09611 - Corman, Francesco / Corman, Francesco

Search Results

Publications 1 - 10 of 11
  • Trepat Borecka, Jacob; Corman, Francesco; Bešinović, Nikola (2024)
    Power peaks are an undesirable phenomenon occurring in railway networks when multiple electric trains require large amounts of power simultaneously, for instance, during acceleration. This phenomena puts too much pressure on the power grid, which in the worst cases it can result into a blackout, and hence it represents a relevant concern for operators. One solution for this is fine-tuning of timetables to minimize power peaks. Nevertheless, the benefits of adjusted timetables can be lost in situations with train delays in the network. In this paper, we develop a simulation-based optimization approach to mitigate anticipated power peaks in real-time by means of train control measures, i.e. traction power limitation and departure time shift, combined with real-time rescheduling. To do this, we propose a discrete-event simulation model for real-time traffic management in railways and heuristic algorithms to solve the problem in a very short computational time. We use precomputed train trajectories and power consumption profiles. We demonstrate the performance of the approach developed in a real-life case in a part of the Swiss Federal Railways network. The results show its potential to mitigate peaks and reduce energy costs with slight rescheduling actions in real-time with a very fast solving time, delivering nearly optimal solutions and negligible passenger inconvenience.
  • Trepat Borecka, Jacob; Leutwiler, Florin; Corman, Francesco (2022)
    Responsive and effective railway operations can be based on a flexible timetable concept with daily adjustments, based on the daily needs of the network such that it satisfies a set of business objectives. This motivates the need to develop solution algorithms to solve large-scale scheduling problems fast and efficiently. We develop, on an existing logic-based Benders decomposition framework, methods and algorithms to enhance the efficiency of automatic train scheduling. We study a variety of algorithmic improvements which have the goal of making the centralized and decomposed solution faster and with higher quality, and easier to handle and interpret from an industrial point of view. We also study how specific choices in geographic-based, time-based and train-based decomposition balance to a different extent the computation effort to solve decomposed subproblems, versus coordinating them towards a global solution.
  • Trepat Borecka, Jacob; Regueiro Sánchez, Daniel; Nold, Michael; et al. (2023)
    RailBelgrade 2023: Book of Abstracts
  • Trepat Borecka, Jacob; Bešinović, Nikola; Maknoon, Yousef M.; et al. (2021)
  • Trepat Borecka, Jacob; Leutwiler, Florin; Corman, Francesco; et al. (2023)
  • Trepat Borecka, Jacob; Bešinović, Nikola (2021)
  • Trepat Borecka, Jacob; Corman, Francesco; Bešinović, Nikola (2024)
    Conference in Emerging Technologies in Transportation Systems (TRC-30). List of Accepted Papers
  • Trepat Borecka, Jacob; Bešinović, Nikola (2021)
    Transportation Research Part B: Methodological
    Highly utilized railway networks require regular infrastructure maintenance. Different track sections often need to be closed for entire days to carry out engineering works, which makes the regular timetables no longer feasible and thus adjusted railway services and temporary alternative services need to be planned. We introduce the Multimodal Alternative Services for Possessions (MASP) problem to support the planning of alternative services, from the passenger and transport operator points of view, including an adjusted train timetable, bus-bridging services and extra train services. The MASP problem is formulated based on the Service Network Design Problem and the Vehicle Routing Problem. To solve it efficiently, we develop a solution framework that incorporates heuristics based on the column and row generation with mixed-integer linear programming. The developed framework provides the optimized alternative service routes, schedules and passenger flows routing. We demonstrated the performance of the MASP solution framework on the real-life Dutch railway network. The results show that the MASP framework is capable of efficiently generating alternative services to route passenger flows affected by possessions with a very limited increase in the total passenger costs compared to a scenario with no link closures. High computational efficiency is observed even for highly disrupted networks.
Publications 1 - 10 of 11