Unfortunately, given the restrictions imposed by the COVID-19 pandemic, the Organizing Committee and the Technical Programa Chairs of ALGO 2021 were forced to run the meetings fully online, using a specialised platform. Instructions for authors and attendees on how to participate in the virtual meeting will be provided shortly..
The Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems is an international forum for researchers in the area of optimization methods and algorithms to facilitate planning and operational management of freight and passenger transportation and traffic. It is colocated with ALGO 2021.
The Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems is an international forum for researchers in the area of algorithms and optimization methods to facilitate planning and operational management of freight and passenger transportation and traffic. ATMOS brings together researchers and practitioners who are interested in all aspects of algorithmic methods and models for transport optimization. The symposium provides a forum for the exchange and dissemination of new ideas and techniques. The aim of making transportation better gives rise to very complex and large-scale optimization problems requiring innovative solution techniques and ideas from algorithms, mathematical optimization, theoretical computer science, and operations research.
Authors are invited to submit high-quality manuscripts reporting original unpublished research in the topics
related to the symposium. Simultaneous submission to other journals or conferences with published
is not allowed. By submitting a paper, the authors acknowledge that in case of acceptance at least one of
authors must register for ALGO/ATMOS 2021 and present the paper.
Submissions must be in the form of a single PDF file prepared using the LaTeX OASIcs style file (https://submission.dagstuhl.de/documentation/authors) and must be submitted electronically via the EasyChair submission system (https://easychair.org/conferences/?conf=atmos2021). ATMOS 2021 accepts two types of submissions (new in this year!), both of which will be reviewed with the same quality standards by the Program Committee.
Regular paper submissions: a regular paper submission should clearly motivate the importance of the problem being addressed, discuss prior work and its relationship to the paper, explicitly and precisely state its key contributions, and outline the key technical ideas and methods used to achieve the main results. A regular paper submission should not exceed 12 pages including title page and abstract, but excluding references and an optional appendix. Authors should include all necessary details in their submission so that the Program Committee can judge correctness, importance and originality of their work. Any material (e.g., proofs or experimental results) omitted (from the main part of 12 pages) due to space limitations can be put into the optional appendix, which will be read at the Program Committee's discretion. Regular papers will be allotted up to 20 pages in the proceedings.
Short paper submissions: a short paper submission may present preliminary results or work-in-progress on a specific topic. Authors should clearly motivate the importance of the problem being addressed, discuss prior work and its relationship to the paper, explicitly and precisely state the paper’s key contributions, and outline the key technical ideas and methods used to achieve the main claims. A short paper submission should have at least 4 and at most 6 pages.
Authors should provide sufficient details in their submission so that the Program Committee can judge correctness, importance and originality of their work. Short papers will be allotted up to 6 pages in the proceedings.
The symposium welcomes but is not limited to papers addressing the following topics:
The symposium welcomes but is not limited to papers applying and advancing the following techniques: Algorithmic Game Theory, Approximation Algorithms, Combinatorial Optimization, Graph and Network Algorithms, Heuristics and Meta-heuristics, Mathematical Programming, Methods for the Integration of Planning Stages, Online and Real-time Algorithms, Simulation Tools, Stochastic and Robust Optimization.
1) Carlo S. Sartori, Pieter Smet and Greet Vanden Berghe: Efficient duration-based workload balancing for interdependent vehicle routes 2) Niels Lindner, Christian Liebchen and Berenike Masing: Forward Cycle Bases and Periodic Timetabling 3) Matthias Müller-Hannemann, Ralf Rückert, Alexander Schiewe and Anita Schöbel: Towards Improved Robustness of Public Transport by a Machine-Learned Oracle 4) Syu-Ning Johnn, Yiran Zhu, Andrés Miniguano-Trujillo and Akshay Gupte: Solving the Home Service Assignment, Routing, and Appointment scheduling (H-SARA) problem with Uncertainties 5) Elia Costa and Francesco Silvestri: On the Bike Spreading Problem 6) Marc Goerigk, Anita Schöbel and Felix Spühler: A Phase I Simplex Method for Finding Feasible Periodic Timetables 7) Natividad González-Blanco, Antonio J. Lozano, Juan A. Mesa and Vladimir Marianov: An integrated model for rapid and slow transit network design (short paper) 8) Daniela Gaul, Kathrin Klamroth and Michael Stiglmayr: Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph 9) Vera Grafe and Anita Schöbel: Solving the periodic scheduling problem: An assignment approach in non-periodic networks 10) Daniel Chen, Christian Sommer and Daniel Wolleb: Fast Map Matching with Vertex-Monotone Fréchet Distance 11) Payas Rajan, Moritz Baum, Michael Wegner, Tobias Zündorf, Christian West, Dennis Schieferdecker and Daniel Delling: Robustness Generalizations of the Shortest Feasible Path Problem for Electric Vehicles 12) Marco Silva, Joao Pedro Pedroso, Ana Viana and Xenia Klimentova: A branch-price-and-cut algorithm for stochastic crowd shipping last-mile delivery with correlated marginals 13) Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh and Junichi Teruyama: Locating Evacuation Centers Optimally in Path and Cycle Networks 14) Peter Damaschke: Distance-based Solution of Patrolling Problems with Individual Waiting Times 15) Guvenc Sahin, Amin Ahmadi Digehsara and Ralf Borndörfer: Efficient Algorithms for the Multi-Period Line Planning Problem in Public Transportation (short paper) 16) Diptendu Chatterjee and Bimal K. Roy: An Improved Scheduling Algorithm for Traveling Tournament Problem with Maximum Trip Length Two 17) Vassilissa Lehoux-Lebacque and Christelle Loiodice: Transfer customization with the Trip-Based Public Transit Routing Algorithm 18) Niels Lindner, Pedro Maristany de Las Casas and Philine Schiewe: Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data 19) Hector Gatt, Jean-Marie Freche, Fabien Lehuede and Thomas Yeung: A column generation-based heuristic for the Line Planning Problem with Service Levels (short paper)
University of Kaiserslautern and ITWM
Anita is a mathematician working in the field of optimization, operations research, and applied mathematics with special interest in multi-criteria optimization, robust optimization, and facility location. She is well-known for her contributions to different aspects of public transport, in particular for her work on delay management, line planning and timetabling. Currently, she is coordinator of the DFG research unit on integrated traffic planning. Anita is head of the Fraunhofer Institute for Industrial Mathematics (ITWM) and full professor for Applied Mathematics at the University of Kaiserslautern, Germany. In 2019 and 2020, she served as the President of the German Operations Research Society (GOR).