Volume
OASIcs, Volume 106
22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)
Event
ATMOS 2022, September 8-9, 2022, Potsdam, GermanyEditors
Publication Details
- published at: 2022-09-06
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-95977-259-4
- DBLP: db/conf/atmos/atmos2022
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Complete Volume
OASIcs, Volume 106, ATMOS 2022, Complete Volume
Abstract
OASIcs, Volume 106, ATMOS 2022, Complete Volume
Cite as
22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 1-240, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@Proceedings{demidio_et_al:OASIcs.ATMOS.2022,
title = {{OASIcs, Volume 106, ATMOS 2022, Complete Volume}},
booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
pages = {1--240},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-259-4},
ISSN = {2190-6807},
year = {2022},
volume = {106},
editor = {D'Emidio, Mattia and Lindner, Niels},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022},
URN = {urn:nbn:de:0030-drops-171036},
doi = {10.4230/OASIcs.ATMOS.2022},
annote = {Keywords: OASIcs, Volume 106, ATMOS 2022, Complete Volume}
}
Document
Front Matter
Front Matter, Table of Contents, Preface, Conference Organization
Abstract
Front Matter, Table of Contents, Preface, Conference Organization
Cite as
22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 0:i-0:x, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{demidio_et_al:OASIcs.ATMOS.2022.0,
author = {D'Emidio, Mattia and Lindner, Niels},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
pages = {0:i--0:x},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-259-4},
ISSN = {2190-6807},
year = {2022},
volume = {106},
editor = {D'Emidio, Mattia and Lindner, Niels},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.0},
URN = {urn:nbn:de:0030-drops-171040},
doi = {10.4230/OASIcs.ATMOS.2022.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Document
An A* Algorithm for Flight Planning Based on Idealized Vertical Profiles
Abstract
The Flight Planning Problem is to find a minimum fuel trajectory between two airports in a 3D airway network under consideration of the wind. We show that this problem is NP-hard, even in its most basic version. We then present a novel A* heuristic, whose potential function is derived from an idealized vertical profile over the remaining flight distance. This potential is, under rather general assumptions, both admissible and consistent and it can be computed efficiently. The method outperforms the state-of-the-art heuristic on real-life instances.
Cite as
Marco Blanco, Ralf Borndörfer, and Pedro Maristany de las Casas. An A* Algorithm for Flight Planning Based on Idealized Vertical Profiles. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 1:1-1:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{blanco_et_al:OASIcs.ATMOS.2022.1,
author = {Blanco, Marco and Bornd\"{o}rfer, Ralf and Maristany de las Casas, Pedro},
title = {{An A* Algorithm for Flight Planning Based on Idealized Vertical Profiles}},
booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
pages = {1:1--1:15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-259-4},
ISSN = {2190-6807},
year = {2022},
volume = {106},
editor = {D'Emidio, Mattia and Lindner, Niels},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.1},
URN = {urn:nbn:de:0030-drops-171052},
doi = {10.4230/OASIcs.ATMOS.2022.1},
annote = {Keywords: shortest path problem, a-star algorithm, flight trajectory optimization, flight planning, heuristics}
}
Document
A Discrete-Continuous Algorithm for Globally Optimal Free Flight Trajectory Optimization
Abstract
We present an efficient algorithm that finds a globally optimal solution to the 2D Free Flight Trajectory Optimization Problem (aka Zermelo Navigation Problem) up to arbitrary precision in finite time. The algorithm combines a discrete and a continuous optimization phase. In the discrete phase, a set of candidate paths that densely covers the trajectory space is created on a directed auxiliary graph. Then Yen’s algorithm provides a promising set of discrete candidate paths which subsequently undergo a locally convergent refinement stage. Provided that the auxiliary graph is sufficiently dense, the method finds a path that lies within the convex domain around the global minimizer. From this starting point, the second stage will converge rapidly to the optimum. The density of the auxiliary graph depends solely on the wind field, and not on the accuracy of the solution, such that the method inherits the superior asymptotic convergence properties of the optimal control stage.
Cite as
Ralf Borndörfer, Fabian Danecker, and Martin Weiser. A Discrete-Continuous Algorithm for Globally Optimal Free Flight Trajectory Optimization. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 2:1-2:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{borndorfer_et_al:OASIcs.ATMOS.2022.2,
author = {Bornd\"{o}rfer, Ralf and Danecker, Fabian and Weiser, Martin},
title = {{A Discrete-Continuous Algorithm for Globally Optimal Free Flight Trajectory Optimization}},
booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
pages = {2:1--2:13},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-259-4},
ISSN = {2190-6807},
year = {2022},
volume = {106},
editor = {D'Emidio, Mattia and Lindner, Niels},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.2},
URN = {urn:nbn:de:0030-drops-171068},
doi = {10.4230/OASIcs.ATMOS.2022.2},
annote = {Keywords: shortest path, flight planning, free flight, discretization error bounds, optimal control, discrete optimization, global optimization}
}
Document
Tropical Neighbourhood Search: A New Heuristic for Periodic Timetabling
Abstract
Periodic timetabling is a central aspect of both the long-term organization and the day-to-day operations of a public transportation system. The Periodic Event Scheduling Problem (PESP), the combinatorial optimization problem that forms the mathematical basis of periodic timetabling, is an extremely hard problem, for which optimal solutions are hardly ever found in practice. The most prominent solving strategies today are based on mixed-integer programming, and there is a concurrent PESP solver employing a wide range of heuristics [Borndörfer et al., 2020]. We present tropical neighborhood search (tns), a novel PESP heuristic. The method is based on the relations between periodic timetabling and tropical geometry [Bortoletto et al., 2022]. We implement tns into the concurrent solver, and test it on instances of the benchmarking library PESPlib. The inclusion of tns turns out to be quite beneficial to the solver: tns is able to escape local optima for the modulo network simplex algorithm, and the overall share of improvement coming from tns is substantial compared to the other methods available in the solver. Finally, we provide better primal bounds for five PESPlib instances.
Cite as
Enrico Bortoletto, Niels Lindner, and Berenike Masing. Tropical Neighbourhood Search: A New Heuristic for Periodic Timetabling. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 3:1-3:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{bortoletto_et_al:OASIcs.ATMOS.2022.3,
author = {Bortoletto, Enrico and Lindner, Niels and Masing, Berenike},
title = {{Tropical Neighbourhood Search: A New Heuristic for Periodic Timetabling}},
booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
pages = {3:1--3:19},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-259-4},
ISSN = {2190-6807},
year = {2022},
volume = {106},
editor = {D'Emidio, Mattia and Lindner, Niels},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.3},
URN = {urn:nbn:de:0030-drops-171075},
doi = {10.4230/OASIcs.ATMOS.2022.3},
annote = {Keywords: Periodic Timetabling, Tropical Geometry, Neighborhood Search, Mixed-Integer Programming}
}
Document
Greedy Algorithms for the Freight Consolidation Problem
Abstract
We define and study the (ocean) freight consolidation problem (FCP), which plays a crucial role in solving today’s supply chain crisis. Roughly speaking, every day and every hour, a freight forwarder sees a set of shipments and a set of containers at the origin port. There is a shipment cost associated with assigning each shipment to each container. If a container is assigned any shipment, there is also a procurement cost for that container. The FCP aims to minimize the total cost of fulfilling all the shipments, subject to capacity constraints of the containers. In this paper, we show that no constant factor approximation exists for FCP, and propose a series of greedy based heuristics for solving the problem. We also test our heuristics with simulated data and show that our heuristics achieve small optimality gaps.
Cite as
Zuguang Gao, John R. Birge, Richard Li-Yang Chen, and Maurice Cheung. Greedy Algorithms for the Freight Consolidation Problem. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 4:1-4:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{gao_et_al:OASIcs.ATMOS.2022.4,
author = {Gao, Zuguang and Birge, John R. and Chen, Richard Li-Yang and Cheung, Maurice},
title = {{Greedy Algorithms for the Freight Consolidation Problem}},
booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
pages = {4:1--4:19},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-259-4},
ISSN = {2190-6807},
year = {2022},
volume = {106},
editor = {D'Emidio, Mattia and Lindner, Niels},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.4},
URN = {urn:nbn:de:0030-drops-171086},
doi = {10.4230/OASIcs.ATMOS.2022.4},
annote = {Keywords: Freight consolidation, heuristics, greedy algorithm}
}
Document
A Bilevel Model for the Frequency Setting Problem
Abstract
Based on a partnership between IMT Atlantique and the French company Lumiplan, this work is part of a process of strengthening the Heurès software currently offered by Lumiplan to public transport operators to support their bus and driver scheduling operations. This work addresses the frequency setting problem which aims at defining the frequencies of the bus lines of a network for different time periods of a day. This operation complements a study on line planning with more accurate estimations of the demand, necessary bus types and passengers behaviors. In this paper, the operator’s exploitation costs are minimized while respecting service-levels constraints, based on the predictions of the path choice made by the passengers. The problem is solved by an easily implementable process and a case study based on a real network is presented to show the efficiency of our method.
Cite as
Hector Gatt, Jean-Marie Freche, Arnaud Laurent, and Fabien Lehuédé. A Bilevel Model for the Frequency Setting Problem. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 5:1-5:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{gatt_et_al:OASIcs.ATMOS.2022.5,
author = {Gatt, Hector and Freche, Jean-Marie and Laurent, Arnaud and Lehu\'{e}d\'{e}, Fabien},
title = {{A Bilevel Model for the Frequency Setting Problem}},
booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
pages = {5:1--5:8},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-259-4},
ISSN = {2190-6807},
year = {2022},
volume = {106},
editor = {D'Emidio, Mattia and Lindner, Niels},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.5},
URN = {urn:nbn:de:0030-drops-171091},
doi = {10.4230/OASIcs.ATMOS.2022.5},
annote = {Keywords: Frequency Setting, Service Performance, Bilevel, Passenger Assignment}
}
Document
Dynamic Traffic Assignment for Electric Vehicles
Abstract
We initiate the study of dynamic traffic assignment for electrical vehicles addressing the specific challenges such as range limitations and the possibility of battery recharge at predefined charging locations. We pose the dynamic equilibrium problem within the deterministic queueing model of Vickrey and as our main result, we establish the existence of an energy-feasible dynamic equilibrium. There are three key modeling-ingredients for obtaining this existence result:
1) We introduce a walk-based definition of dynamic traffic flows which allows for cyclic routing behavior as a result of recharging events en route.
2) We use abstract convex feasibility sets in an appropriate function space to model the energy-feasibility of used walks.
3) We introduce the concept of capacitated dynamic equilibrium walk-flows which generalize the former unrestricted dynamic equilibrium path-flows. Viewed in this framework, we show the existence of an energy-feasible dynamic equilibrium by applying an infinite dimensional variational inequality, which in turn requires a careful analysis of continuity properties of the network loading as a result of injecting flow into walks.
We complement our theoretical results by a computational study in which we design a fixed-point algorithm computing energy-feasible dynamic equilibria. We apply the algorithm to standard real-world instances from the traffic assignment community illustrating the complex interplay of resulting travel times, energy consumption and prices paid at equilibrium.
Cite as
Lukas Graf, Tobias Harks, and Prashant Palkar. Dynamic Traffic Assignment for Electric Vehicles. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 6:1-6:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{graf_et_al:OASIcs.ATMOS.2022.6,
author = {Graf, Lukas and Harks, Tobias and Palkar, Prashant},
title = {{Dynamic Traffic Assignment for Electric Vehicles}},
booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
pages = {6:1--6:15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-259-4},
ISSN = {2190-6807},
year = {2022},
volume = {106},
editor = {D'Emidio, Mattia and Lindner, Niels},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.6},
URN = {urn:nbn:de:0030-drops-171104},
doi = {10.4230/OASIcs.ATMOS.2022.6},
annote = {Keywords: Electromobility, Dynamic Traffic Assignment, Dynamic Flows, Fixed Point Algorithm}
}
Document
Delay Management with Integrated Decisions on the Vehicle Circulations
Abstract
The task of delay management in public transport is to decide whether a vehicle should wait for a delayed vehicle in order to maintain the connection for transferring passengers. So far, the vehicle circulations are often ignored in the optimization process, although they have an influence on the propagation of the delay through the network. In this paper we consider different ways from literature to incorporate vehicle circulations in the delay management stage of public transport planning. Since the IP formulation for the integrated problem is hard to solve, we investigate bounds and develop several heuristics for the integrated problem. Our experiments on close-to real-world instances show that integrating delay management and decisions on vehicle circulations may reduce the overall delay by up to 39 percent. We also compare the runtimes and objective function values of the different heuristics. We conclude that we can find competitive solutions in a reasonable amount of time.
Cite as
Vera Grafe, Alexander Schiewe, and Anita Schöbel. Delay Management with Integrated Decisions on the Vehicle Circulations. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 7:1-7:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{grafe_et_al:OASIcs.ATMOS.2022.7,
author = {Grafe, Vera and Schiewe, Alexander and Sch\"{o}bel, Anita},
title = {{Delay Management with Integrated Decisions on the Vehicle Circulations}},
booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
pages = {7:1--7:18},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-259-4},
ISSN = {2190-6807},
year = {2022},
volume = {106},
editor = {D'Emidio, Mattia and Lindner, Niels},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.7},
URN = {urn:nbn:de:0030-drops-171119},
doi = {10.4230/OASIcs.ATMOS.2022.7},
annote = {Keywords: Public Transport, Delay Management, Vehicle Circulations, Integer Programming}
}
Document
Algorithms and Hardness for Non-Pool-Based Line Planning
Abstract
Line planning, i.e. choosing paths which are operated by one vehicle end-to-end, is an important aspect of public transport planning. While there exist heuristic procedures for generating lines from scratch, most theoretical observations consider the problem of choosing lines from a predefined line pool. In this paper, we consider the complexity of the line planning problem when all simple paths can be used as lines. Depending on the cost structure, we show that the problem can be NP-hard even for paths and stars, and that no polynomial time approximation of sub-linear performance is possible. Additionally, we identify polynomially solvable cases and present a pseudo-polynomial solution approach for trees.
Cite as
Irene Heinrich, Philine Schiewe, and Constantin Seebach. Algorithms and Hardness for Non-Pool-Based Line Planning. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 8:1-8:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{heinrich_et_al:OASIcs.ATMOS.2022.8,
author = {Heinrich, Irene and Schiewe, Philine and Seebach, Constantin},
title = {{Algorithms and Hardness for Non-Pool-Based Line Planning}},
booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
pages = {8:1--8:21},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-259-4},
ISSN = {2190-6807},
year = {2022},
volume = {106},
editor = {D'Emidio, Mattia and Lindner, Niels},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.8},
URN = {urn:nbn:de:0030-drops-171124},
doi = {10.4230/OASIcs.ATMOS.2022.8},
annote = {Keywords: line planning, public transport, discrete optimization, complexity, algorithm design}
}
Document
The Edge Investment Problem: Upgrading Transit Line Segments with Multiple Investing Parties
Abstract
Bus Rapid Transit (BRT) systems can provide a fast and reliable service to passengers at lower costs compared to tram, metro and train systems. Therefore, they can be of great value to attract more passengers to use public transport, which is vital in reaching the Paris Agreement Targets. However, the main advantage of BRT systems, namely their flexible implementation, also leads to the risk that the system is only implemented partially to save costs. This paper focuses therefore on the Edge Investment Problem: Which edges (segments) of a bus line should be upgraded to full-level BRT? Motivated by the construction of a new BRT line around Copenhagen, we consider a setting in which multiple parties are responsible for different segments of the line. Each party has a limited budget and can adjust its investments according to the benefits provided to its passengers. We suggest two ways to determine the number of newly attracted passengers, prove that the corresponding problems are NP-hard and identify special cases that can be solved in polynomial time. In addition, problem relaxations are presented that yield dual bounds. Moreover, we perform an extensive numerical comparison in which we evaluate the extent to which these two ways of modeling demand impact the computational performance and the choice of edges to be upgraded.
Cite as
Rowan Hoogervorst, Evelien van der Hurk, Philine Schiewe, Anita Schöbel, and Reena Urban. The Edge Investment Problem: Upgrading Transit Line Segments with Multiple Investing Parties. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 9:1-9:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{hoogervorst_et_al:OASIcs.ATMOS.2022.9,
author = {Hoogervorst, Rowan and van der Hurk, Evelien and Schiewe, Philine and Sch\"{o}bel, Anita and Urban, Reena},
title = {{The Edge Investment Problem: Upgrading Transit Line Segments with Multiple Investing Parties}},
booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
pages = {9:1--9:19},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-259-4},
ISSN = {2190-6807},
year = {2022},
volume = {106},
editor = {D'Emidio, Mattia and Lindner, Niels},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.9},
URN = {urn:nbn:de:0030-drops-171137},
doi = {10.4230/OASIcs.ATMOS.2022.9},
annote = {Keywords: Network Design, Public Transport, Bus Rapid Transit, Modeling}
}
Document
A Formulation of MIP Train Rescheduling at Terminals in Bidirectional Double-Track Lines with a Moving Block and ATO
Abstract
When delays in trains occur, train schedules are rescheduled to reduce the impact. Despite many existing studies of automated train rescheduling, this study focuses on automated rescheduling considering a moving block and Automatic Train Operation (ATO). This study enables such automated rescheduling by formalizing this problem as a mixed integer programming (MIP) model. In previous work, the formulation was achieved for unidirectional single-track railway lines. In this paper, we aim to achieve the formulation for bidirectional double-track lines. Specifically, we propose a formulation of constraints about trains’ running terminal stations. To evaluate our automated rescheduling approach, we implemented an MIP model consisting of a combination of the new constraints with the previous MIP model. We demonstrated the feasibility of our approach by applying it to a bidirectional double-track line with eight delay scenarios. We also evaluate the delay reduction and computation overhead of our approach by comparing it with a baseline with these eight scenarios. The results show that the total delay of all trains from our approach reduced from 20% to 30% than one from the baseline. On the other hand, the computation time increased from less than 1 second to a minimum of about 20 seconds and a maximum of about 1600 seconds.
Cite as
Kosuke Kawazoe, Takuto Yamauchi, and Kenji Tei. A Formulation of MIP Train Rescheduling at Terminals in Bidirectional Double-Track Lines with a Moving Block and ATO. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 10:1-10:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{kawazoe_et_al:OASIcs.ATMOS.2022.10,
author = {Kawazoe, Kosuke and Yamauchi, Takuto and Tei, Kenji},
title = {{A Formulation of MIP Train Rescheduling at Terminals in Bidirectional Double-Track Lines with a Moving Block and ATO}},
booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
pages = {10:1--10:18},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-259-4},
ISSN = {2190-6807},
year = {2022},
volume = {106},
editor = {D'Emidio, Mattia and Lindner, Niels},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.10},
URN = {urn:nbn:de:0030-drops-171148},
doi = {10.4230/OASIcs.ATMOS.2022.10},
annote = {Keywords: Train rescheduling, Mixed integer programming, ATO, Moving block}
}
Document
Does Laziness Pay Off? - A Lazy-Constraint Approach to Timetabling
Abstract
Timetabling is a classical and complex task for public transport operators as well as for railway undertakings. The general question is: Which vehicle is taking which route through the transportation network in which order? In this paper, we consider the special setting to find optimal timetables for railway systems under a moving block regime. We directly set up on our work of [T. Schlechte et al., 2022], i.e., we consider the same model formulation and real-world instances of a moving block headway system. In this paper, we present a repair heuristic and a lazy-constraint approach utilizing the callback features of Gurobi, see [Gurobi Optimization, 2022]. We provide an experimental study of the different algorithmic approaches for a railway network with 100 and up to 300 train requests. The computational results show that the lazy-constraint approach together with the repair heuristic significantly improves our previous approaches.
Cite as
Torsten Klug, Markus Reuther, and Thomas Schlechte. Does Laziness Pay Off? - A Lazy-Constraint Approach to Timetabling. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 11:1-11:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{klug_et_al:OASIcs.ATMOS.2022.11,
author = {Klug, Torsten and Reuther, Markus and Schlechte, Thomas},
title = {{Does Laziness Pay Off? - A Lazy-Constraint Approach to Timetabling}},
booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
pages = {11:1--11:8},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-259-4},
ISSN = {2190-6807},
year = {2022},
volume = {106},
editor = {D'Emidio, Mattia and Lindner, Niels},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.11},
URN = {urn:nbn:de:0030-drops-171159},
doi = {10.4230/OASIcs.ATMOS.2022.11},
annote = {Keywords: Moving Block, Railway Track Allocation, Timetabling, Train Routing}
}
Document
REX: A Realistic Time-Dependent Model for Multimodal Public Transport
Abstract
We present the non-FIFO time-dependent graph model with REalistic vehicle eXchange times (REX) for schedule-based multimodal public transport, along with a novel query algorithm called TRIP-based LAbel-correction propagation (TRIPLA) algorithm that efficiently solves the realistic earliest-arrival routing problem. The REX model possesses all strong features of previous time-dependent graph models without suffering from their deficiencies. It handles non-negligible exchanges from one vehicle to another, as well as supports non-FIFO instances which are typical in public transport, without compromising space efficiency. We conduct a thorough experimental evaluation with real-world data which demonstrates that TRIPLA significantly outperforms all state-of-the-art query algorithms for multimodal earliest-arrival routing in schedule-based public transport.
Cite as
Spyros Kontogiannis, Paraskevi-Maria-Malevi Machaira, Andreas Paraskevopoulos, and Christos Zaroliagis. REX: A Realistic Time-Dependent Model for Multimodal Public Transport. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 12:1-12:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{kontogiannis_et_al:OASIcs.ATMOS.2022.12,
author = {Kontogiannis, Spyros and Machaira, Paraskevi-Maria-Malevi and Paraskevopoulos, Andreas and Zaroliagis, Christos},
title = {{REX: A Realistic Time-Dependent Model for Multimodal Public Transport}},
booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
pages = {12:1--12:16},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-259-4},
ISSN = {2190-6807},
year = {2022},
volume = {106},
editor = {D'Emidio, Mattia and Lindner, Niels},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.12},
URN = {urn:nbn:de:0030-drops-171164},
doi = {10.4230/OASIcs.ATMOS.2022.12},
annote = {Keywords: multimodal journey planning, REX model, TRIPLA query algorithm, schedule-based timetables}
}
Document
Passenger-Aware Real-Time Planning of Short Turns to Reduce Delays in Public Transport
Abstract
Delays and disruptions are commonplace in public transportation. An important tool to limit the impact of severely delayed vehicles is the use of short turns, where a planned trip is shortened in order to be able to resume the following trip in the opposite direction as close to the schedule as possible. Short turns have different effects on passengers: some suffer additional delays and have to reschedule their route, while others can benefit from them. Dispatchers therefore need decision support in order to use short turns only if the overall delay of all affected passengers is positively influenced. In this paper, we study the planning of short turns based on passenger flows. We propose a simulation framework which can be used to decide upon single short turns in real time. An experimental study with a scientific model (LinTim) of an entire public transport system for the German city of Stuttgart including busses, trams, and local trains shows that we can solve these problems on average within few milliseconds. Based on features of the current delay scenario and the passenger flow we use machine learning to classify cases where short turns are beneficial. Depending on how many features are used, we reach a correct classification rate of more than 93% (full feature set) and 90% (partial feature set) using random forests. Since precise passenger flows are often not available in urban public transportation, our machine learning approach has the great advantage of working with significantly less detailed passenger information.
Cite as
Julian Patzner, Ralf Rückert, and Matthias Müller-Hannemann. Passenger-Aware Real-Time Planning of Short Turns to Reduce Delays in Public Transport. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 13:1-13:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{patzner_et_al:OASIcs.ATMOS.2022.13,
author = {Patzner, Julian and R\"{u}ckert, Ralf and M\"{u}ller-Hannemann, Matthias},
title = {{Passenger-Aware Real-Time Planning of Short Turns to Reduce Delays in Public Transport}},
booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
pages = {13:1--13:18},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-259-4},
ISSN = {2190-6807},
year = {2022},
volume = {106},
editor = {D'Emidio, Mattia and Lindner, Niels},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.13},
URN = {urn:nbn:de:0030-drops-171171},
doi = {10.4230/OASIcs.ATMOS.2022.13},
annote = {Keywords: Public Transportation, Delays, Real-time Dispatching, Passenger Flows}
}
Document
Efficient Algorithms for Fully Multimodal Journey Planning
Abstract
We study the journey planning problem for fully multimodal networks consisting of public transit and an arbitrary number of non-schedule-based transfer modes (e.g., walking, e-scooter, bicycle). Obtaining reasonable results in this setting requires multicriteria optimization, making the problem highly complex. Previous approaches were either limited to a single transfer mode or suffered from prohibitively slow running times. We establish a fully multimodal journey planning model that excludes undesirable solutions and can be solved efficiently. We extend existing efficient bimodal algorithms to our model and propose a new algorithm, HydRA, which enables even faster queries. On metropolitan and mid-sized country networks with walking and e-scooter as transfer modes, HydRA achieves query times of around 30 ms, which is fast enough for interactive applications.
Cite as
Moritz Potthoff and Jonas Sauer. Efficient Algorithms for Fully Multimodal Journey Planning. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 14:1-14:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
Copy BibTex To Clipboard
@InProceedings{potthoff_et_al:OASIcs.ATMOS.2022.14,
author = {Potthoff, Moritz and Sauer, Jonas},
title = {{Efficient Algorithms for Fully Multimodal Journey Planning}},
booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)},
pages = {14:1--14:15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-259-4},
ISSN = {2190-6807},
year = {2022},
volume = {106},
editor = {D'Emidio, Mattia and Lindner, Niels},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.14},
URN = {urn:nbn:de:0030-drops-171181},
doi = {10.4230/OASIcs.ATMOS.2022.14},
annote = {Keywords: Algorithms, Journey Planning, Multimodal, Multicriteria, Public Transit}
}