ATMOS C

20 papers

YearTitle / Authors
202121st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2021, Lisbon, Portugal (Virtual Conference), September 9-10, 2021
Matthias Müller-Hannemann, Federico Perea
2021A Branch-Price-And-Cut Algorithm for Stochastic Crowd Shipping Last-Mile Delivery with Correlated Marginals.
Marco Silva, João Pedro Pedroso, Ana Viana, Xenia Klimentova
2021A Column Generation-Based Heuristic for the Line Planning Problem with Service Levels (Short Paper).
Hector Gatt, Jean-Marie Freche, Fabien Lehuédé, Thomas G. Yeung
2021A Phase I Simplex Method for Finding Feasible Periodic Timetables.
Marc Goerigk, Anita Schöbel, Felix Spühler
2021An Improved Scheduling Algorithm for Traveling Tournament Problem with Maximum Trip Length Two.
Diptendu Chatterjee, Bimal Kumar Roy
2021An Integrated Model for Rapid and Slow Transit Network Design (Short Paper).
Natividad González-Blanco, Antonio J. Lozano, Vladimir Marianov, Juan A. Mesa
2021Distance-Based Solution of Patrolling Problems with Individual Waiting Times.
Peter Damaschke
2021Efficient Algorithms for the Multi-Period Line Planning Problem in Public Transportation (Short Paper).
Güvenç Sahin, Amin Ahmadi Digehsara, Ralf Borndörfer
2021Efficient Duration-Based Workload Balancing for Interdependent Vehicle Routes.
Carlo S. Sartori, Pieter Smet, Greet Vanden Berghe
2021Fast Map Matching with Vertex-Monotone Fréchet Distance.
Daniel Chen, Christian Sommer, Daniel Wolleb
2021Forward Cycle Bases and Periodic Timetabling.
Niels Lindner, Christian Liebchen, Berenike Masing
2021Locating Evacuation Centers Optimally in Path and Cycle Networks.
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama
2021On the Bike Spreading Problem.
Elia Costa, Francesco Silvestri
2021Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data.
Niels Lindner, Pedro Maristany de las Casas, Philine Schiewe
2021Robustness Generalizations of the Shortest Feasible Path Problem for Electric Vehicles.
Payas Rajan, Moritz Baum, Michael Wegner, Tobias Zündorf, Christian J. West, Dennis Schieferdecker, Daniel Delling
2021Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph.
Daniela Gaul, Kathrin Klamroth, Michael Stiglmayr
2021Solving the Home Service Assignment, Routing, and Appointment Scheduling (H-SARA) Problem with Uncertainties.
Syu-Ning Johnn, Yiran Zhu, Andrés Miniguano-Trujillo, Akshay Gupte
2021Solving the Periodic Scheduling Problem: An Assignment Approach in Non-Periodic Networks.
Vera Grafe, Anita Schöbel
2021Towards Improved Robustness of Public Transport by a Machine-Learned Oracle.
Matthias Müller-Hannemann, Ralf Rückert, Alexander Schiewe, Anita Schöbel
2021Transfer Customization with the Trip-Based Public Transit Routing Algorithm.
Vassilissa Lehoux-Lebacque, Christelle Loiodice