Bastian Amberg

Bastian Amberg

Auto-generated profile, based on publicly available information

Bastian Amberg

Institute for Information Management in Engineering (IMI), Karlsruhe Institute of Technology

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 December 2011 in Public Transport
Verified
Journal Article
Closed access
PDF file
NKNatalia Kliewer
Natalia Kliewer
BABastian Amberg
Bastian Amberg
BABoris Amberg
Boris Amberg

1 February 2019 in Transportation Science
Verified
Journal Article
Closed access
BABastian Amberg
Bastian Amberg
BABoris Amberg
Boris Amberg
NKNatalia Kliewer
Natalia Kliewer
This work examines combined vehicle and crew scheduling in public bus transit in the context of both robust and cost-efficient resource allocation. Cost-efficiency in terms of minimal planned costs for resource usage is already addressed in numerous contributions providing increasingly sophisticated optimization approaches that are able to compute highly efficient resource schedules. Unfortunately, during operations the resulting tight resource schedules are generally more susceptible to disruptions causing delays or even cascades of delays. Because of dependencies between scheduled vehicles and drivers, even small delays may propagate through the entire network. However, to date there is only little research assessing schedule robustness against disruptions and delays, affecting both vehicle and crew schedules. We consider the mutual dependencies between vehicle and crew schedules and propose solution approaches that are able to consider the propagation of possible delays. The approaches are used to create cost-efficient resource schedules simultaneously capable to absorb delays and to prevent delay propagation. In particular, we present a fully integrated vehicle and crew scheduling approach. To analyze problem characteristics we investigate to what extent sequential, partially integrated, and integrated vehicle and crew scheduling lead to schedules with different quality. Numerical experiments using real-world problem instances examine the influence of these different scheduling schemes on robustness and cost-efficiency. The results stress the relevance of incorporating possible delay propagation when scheduling resources in (especially urban) public transportation. Compared to pure cost-efficient scheduling, the expected delay propagation can be decreased drastically without additional costs. The online appendix is available at https://doi.org/10.1287/trsc.2017.0757 .

1 January 2023 in Transportation Science
Verified
Journal Article
Closed access
BABastian Amberg
Bastian Amberg
BABoris Amberg
Boris Amberg
For vehicle and crew scheduling in public bus transport, two concepts are intensively studied to reduce resource usage and minimize operational costs: Integrated, that is, simultaneous scheduling of vehicles and drivers, and resource scheduling with simultaneous trip shifting, that is, slightly modifying departure and arrival times of particular trips without changing their duration. Applying these two concepts can lead to highly cost-efficient and tight schedules. Unfortunately, such schedules are more susceptible to delays during operations. Furthermore, shifting of particular trips may have an unwanted impact on the original timetable structure as, for example, headways between consecutive trips of a line might be changed. In this work, we develop an integrated vehicle and crew scheduling approach with the possibility to shift scheduled trips controllably within small defined time windows. It is a Lagrangian heuristic based on column generation. In addition to minimizing planned costs, the approach aims at two further objectives: building robust schedules by minimizing the expected overall propagation of delays through the transport network and minimizing timetable alteration. To reduce the possible propagation of delays, the mutual dependencies between vehicle and crew schedules are taken into account during integrated scheduling. To increase both robustness and cost-efficiency, the possibility to shift trips within small defined time windows is used. Robust and cost-efficient vehicle itineraries and crew duties are generated in the column-generation pricing problems. Computational experiments on data sets from the real world show that resource usage can be further reduced compared with pure cost-efficient integrated scheduling, whereas resource schedules remain robust and timetable alterations can be minimized. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.1154 .

1 January 2011 in Procedia - Social and Behavioral Sciences
Verified
Journal Article
Open access
BABastian Amberg
Bastian Amberg
BABoris Amberg
Boris Amberg
NKNatalia Kliewer
Natalia Kliewer
In public bus transport delays occur frequently during execution of vehicle and crew schedules. Delayed busses not only affect the vehicle schedule but also the associated crew schedule. Delayed drivers cause similar effects the other way round. Thus planned schedules can become infeasible and the operations control has to initiate expensive recovery actions. To avoid these undesirable effects possible disruptions can already be considered in the planning phase. We present different offline approaches to increase delay-tolerance of both vehicle schedules and crew schedules. Thereby we consider sequential, partial-integrated and integrated planning methods for vehicle and crew scheduling. We propose two different types of approaches: approaches using no information about possible delays, and approaches using historical delay data. Within these approaches the main focus is on providing buffer times at appropriate positions in the vehicle and crew schedules. Buffer times should be distributed that way that minor disruptions are absorbed and delay propagation can be limited. Further, planned costs should not be increased significantly compared to cost-optimal scheduling. We use different flow decomposition strategies for cost-optimal flows of the underlying time-space-network model in order to redistribute buffer times. In addition, we apply different strategies to select timetabled trips that might be susceptible to delays. After these trips a certain minimum buffer time is guaranteed. The approaches are compared with regard to planned costs and delay-tolerance using real-life timetables from German cities for the experiments.

15 March 2024 in Operations Research Forum
Verified
Journal Article
Open access
PDF file
LMLucas Mertens
Lucas Mertens
BABastian Amberg
Bastian Amberg
NKNatalia Kliewer
Natalia Kliewer
Public transport planning is a multi-level process that includes various complex tasks. These tasks are traditionally executed sequentially, and the result of each task serves as input for consecutive tasks. A simultaneous integrated consideration of multiple tasks may lead to an overall improved solution, but further increase the complexity of already hard-to-solve planning problems. This work focuses on timetabling and vehicle scheduling and evaluates synergies from the integrated optimization. We investigate an exact sequential, exact integrated, and heuristic approach to solve the combined problem for large public transport networks considering the interlining of vehicles, multiple vehicle types, or multiple depots while additionally aiming to maximize regular “clock-faced’’ headways and transfer connections. Compared to sequential optimization, an integrated approach significantly reduces nominal and operational costs while maintaining high service quality. However, an exact integrated approach is only able to compute solutions for problems of limited size in a reasonable time. We propose an adaptive modular evolutionary extendable scheme that effectively balances computational efficiency and solution quality. By utilizing various problem-specific mutation operators and adaptively applying them based on their impact, the heuristic can compute high-quality solutions for large real-world-inspired public transport networks in a reasonable time while considering short connecting times between lines and regular clock-faced headways.

31 December 2011 in Procedia - Social and Behavioral Sciences
Verified
Journal Article
Open access
BABoris Amberg
Boris Amberg
BABastian Amberg
Bastian Amberg
NKNatalia Kliewer
Natalia Kliewer
In public bus transport, timetables usually consist of many trips that are serviced each day. However, there are also some trips that do not repeat daily. This small amount of irregular trips has a large impact when the corresponding resource scheduling problems are solved day by day at minimum costs by optimization tools: vehicle and driver schedules produced for one day may completely differ from schedules for another day. As most companies prefer both cost efficient and similar schedules, scheduling approaches should also consider similarity as an objective. We propose and compare approaches that increase the similarity of resource schedules in two different ways: The first type of approaches solves the scheduling problems of various days separated from each other while similarity is ensured with the help of a common reference schedule. The second type of approaches tackles the scheduling problems of various days simultaneously while the similarity is increased with the help of regular patterns. In addition to heuristic procedures we propose a MIP formulation that includes patterns as variables. The models are solved with a column generation approach. Computational results show that the proposed approaches can highly increase the similarity, while only a few additional costs compared to a cost optimal solution are necessary.