arXiv subjects

Anders Peterson

Publications and source records attributed to Anders Peterson.

3 recordsLinked to original sources

arXiv2026

Late Train-Crew Rescheduling: A Tabu-Search-Based Approach Using Restricted DFS

In this paper, we reschedule the duties of train drivers one day before the operation. Because several drivers are absent (for example, because of sick leave), some trains have no driver. Thus, duties need to be rescheduled for the day of operation. We start with a feasible crew schedule for each of the remaining operating drivers, a set of unassigned tasks originally assigned to the absent drivers, and a set of standby drivers with fixed start time, end time, start depot, and end depot. Our aim is to generate a crew schedule with as few canceled tasks as possible. We present a tabu-search-based approach with restricted graph search for crew rescheduling. We also adopt a column-generation approach as a benchmark to reflect the same restrictions and objective function as our tabu-search-based approach. We use it to compare the quality of the results, computational time, and other performance indicators. Our tabu-search-based approach needs less computational time than the column-generation approach to compute an acceptable result. We further test the performance of our approach under different settings. One of the datasets used in the experiments originated from a regional passenger-train system around Stockholm, Sweden, and was provided by Mälartåg. The other dataset is generated from the open-source crew scheduling data from the ROMSOC project.

math.OC↗

arXiv2025

Modelling and evaluating travel information during disruptions: An illustrative example from Swedish railways

Accurate and timely travel information is an asset for enhancing passenger travel experience during normal traffic, and for mitigating the discomforts during disruptions. With longer and more frequent disruptions as well as increasing ridership, traffic delays can incur substantial costs for passengers and other transport stakeholders, e.g., operators and infrastructure managers. Such costs can, however, be reduced thanks to effective travel information strategies during traffic disruptions. In this paper, we introduce an evaluation model to assess the value of travel information under different scenarios. Focusing on real-time travel information to train passengers, accessibility benefits are quantified in monetary terms based on historical delay distributions, timing of travel information (pre/on-trip) and ridership. Using a case study from the Swedish railways, the model is showcased and applied to a commuter line in Stockholm. The experimental results indicate individual valuations that are higher than references and savings at the system level of at least 23% of the delay costs. Further testing of the model, e.g., on larger-scale scenarios, and including transfer trips, is a possible direction for future works.

physics.soc-ph↗

arXiv2024

A New Method for Inserting Train Paths into a Timetable

A seemingly simple, yet widely applicable subroutine in automated train scheduling is the insertion of a new train path to a timetable in a railway network. We believe it to be the first step towards a new train-rerouting framework in case of large disturbances or maintenance works. Other applications include handling ad-hoc requests and modifying train paths upon request from railway undertakings. We propose a fast and scalable path-insertion algorithm based on dynamic programming that is able to output multiple suitable paths. Our algorithm uses macroscopic data and can run on railway networks with any number of tracks. We apply the algorithm on the line from Göteborg Sävenäs to the Norwegian border at Kornsjö. For a time window of seven hours, we obtain eight suitable paths for a freight train within 0.3 seconds after preprocessing.

cs.DS↗