Invited Speaker<\/h2>\n\n\n\n\n\n\n![\"Invited](\"https:\/\/algo2022.eu\/wp-content\/uploads\/2022\/08\/csommer-1.png\")
Christian Sommer
Apple Inc.<\/figcaption><\/figure>\n<\/div>\n\n\n\n\nChristian Sommer<\/a><\/strong>, Apple Inc.<\/p>\n\n\n\nSpeaker:<\/strong> Christian Sommer joined Apple in 2012, two weeks after the initial release of Maps. For the last ten years, he\u2018s been working on various aspects of navigation, including route planning, turn-by-turn navigation, traffic, and road incidents. He\u2019s currently leading an engineering team in Apple\u2018s Zurich office. Prior to industry, he was a researcher in algorithms and data structures during a postdoc at MIT, a PhD at the University of Tokyo, and an MSc at ETH Zurich.<\/p>\n\n\n\nTitle: <\/strong>On Map Matching GPS Traces<\/p>\n\n\n\nAbstract:<\/em> With the widespread availability of receivers for the Global Positioning System (GPS) in modern cars and smartphones came the rise of large databases of GPS traces. These are valuable sources for various applications like map construction, map refinement and correction, traffic estimation, travel time estimation, dynamic routing, and many more.\u00a0As a first step, GPS traces often get mapped to a road network via a non-trivial process called map matching. Given a GPS trace as a sequence of (latitude, longitude) pairs, possibly equipped with time stamps and auxiliary information, a map matching algorithm is expected to return a sequence of road segments (edges in the road network) that the input trace likely traversed. In this talk we review problems and approaches around map matching GPS traces at scale.<\/p>\n<\/div>\n<\/div>\n<\/div>\n\n\n\nImportant Dates<\/h2>\n\n\n\n- Paper submission deadline:
27 June 2022<\/s> extended to 11 July 2022 (anywhere on earth)<\/li>- Notification: 1st August 2022<\/li>
- Conference: 8-9 September, 2022, in Potsdam (Germany)<\/li><\/ul>\n\n\n\n
Accepted Papers<\/h2>\n\n\n\n- Irene Heinrich, Philine Schiewe and Constantin Seebach
Algorithms and Hardness for Non-Pool-Based Line Planning<\/em><\/li>- Ralf Bornd\u00f6rfer, Fabian Danecker and Martin Weiser
A Discrete-Continuous Algorithm for Globally Optimal Free Flight Trajectory Optimization<\/em><\/li>- Torsten Klug, Thomas Schlechte and Markus Reuther
Does Laziness Pay Off? – A Lazy-Constraint Approach to Timetabling<\/em><\/li>- Julian Patzner, Ralf R\u00fcckert and Matthias M\u00fcller-Hannemann
Passenger-Aware Real-Time Planning of Short Turns to Reduce Delays in Public Transport<\/em><\/li>- Hector Gatt, Jean-Marie Freche, Fabien Lehu\u00e9d\u00e9 and Arnaud Laurent
A bilevel model for the frequency setting problem<\/em><\/li>- Enrico Bortoletto, Niels Lindner and Berenike Masing
Tropical Neighbourhood Search: A New Heuristic for Periodic Timetabling<\/em><\/li>- Marco Blanco, Ralf Borndoerfer and Pedro Maristany de Las Casas
An A* Algorithm for Flight Planning based on Idealized Vertical Profiles<\/em><\/li>- Vera Grafe, Alexander Schiewe and Anita Sch\u00f6bel
Delay Management with Integrated Decisions on the Vehicle Circulations<\/em><\/li>- Spyros Kontogiannis, Paraskevi-Maria-Malevi Machaira, Andreas Paraskevopoulos and Christos Zaroliagis
REX: A Realistic Time-dependent Model for Multimodal Public Transport<\/em><\/li>- Zuguang Gao, John R. Birge, Richard L.-Y. Chen and Maurice Cheung
Greedy Algorithms for the Freight Consolidation Problem<\/em><\/li>- Moritz Potthoff and Jonas Sauer
Efficient Algorithms for Fully Multimodal Journey Planning<\/em><\/li>- Rowan Hoogervorst, Evelien van der Hurk, Philine Schiewe, Anita Sch\u00f6bel and Reena Urban
The Edge Investment Problem: Upgrading Transit Line Segments with Multiple Investing Parties<\/em><\/li>- 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<\/em><\/li>- Lukas Graf, Tobias Harks and Prashant Palkar
Dynamic Traffic Assignment for Electric Vehicles<\/em><\/li><\/ul>\n\n\n\nCall for Papers<\/h2>\n\n\n\n
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.<\/p>\n\n\n\n
Paper Submission<\/h3>\n\n\n\n
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 proceedings is not allowed. By submitting a paper, the authors acknowledge that in case of acceptance at least one of the authors must register for ALGO\/ATMOS 2022 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<\/a>) and must be submitted electronically via the EasyChair submission system (https:\/\/easychair.org\/conferences\/?conf=atmos2022<\/a>).<\/p>\n\n\n\nATMOS 2022 accepts two types of submissions, both of which will be reviewed with the same quality standards by the Program Committee.
Regular paper submissions:<\/strong> 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 the 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:<\/strong> 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\u2019s 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 the correctness, importance and originality of their work. Short papers will be allotted up to 6 pages in the proceedings.<\/p>\n\n\n\nTopics<\/h3>\n\n\n\n
The symposium welcomes but is not limited to papers addressing the following topics:<\/p>\n\n\n\n
- Congestion Modelling and Reduction<\/strong><\/li>
- Crew and Duty Scheduling<\/strong><\/li>
- Demand Forecasting<\/strong><\/li>
- Delay Management<\/strong><\/li>
- Design of Pricing Systems<\/strong><\/li>
- Electromobility<\/strong><\/li>
- Infrastructure Planning<\/strong><\/li>
- Intelligent Transportation Systems<\/strong><\/li>
- Models for User Behaviour<\/strong><\/li>
- Line Planning<\/strong><\/li>
- Mobile Applications for Transport<\/strong><\/li>
- Mobility-as-a-Service<\/strong><\/li>
- Multi-modal Transport Optimization<\/strong><\/li>
- Routing and Platform Assignment<\/strong><\/li>
- Route Planning in Road and Public Transit Networks<\/strong><\/li>
- Rostering<\/strong><\/li>
- Timetable Generation<\/strong><\/li>
- Tourist Tour Planning<\/strong><\/li>
- Traffic Guidance<\/strong><\/li>
- Vehicle Scheduling<\/strong><\/li><\/ul>\n\n\n\n
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.<\/p>\n\n\n\n
Awards<\/h3>\n\n\n\n
There will be a Best Paper Award.<\/p>\n\n\n\n
Committees<\/h2>\n\n\n\nProgram Committee Chairs<\/h3>\n\n\n\n- Mattia D’Emidio<\/strong><\/a>, University of L’Aquila, Italy<\/li>
- Niels Lindner<\/strong><\/a>, Zuse Institute Berlin, Germany<\/li><\/ul>\n\n\n\n
Program Committee Members<\/h3>\n\n\n\n- Bastian Amberg, FU Berlin, Germany<\/li>
- Moritz Baum, Apple Inc., USA<\/li>
- Nikola Be\u0161inovi\u0107, TU Delft, Netherlands<\/li>
- Valentina Cacchiani, University of Bologna, Italy<\/li>
- Serafino Cicerone<\/a>, University of L\u2019Aquila, Italy<\/li>
- David Coudert<\/a>, INRIA and Universit\u00e9 C\u1ed1t\u00e9 d\u2019Azur, France<\/li>
- Gianlorenzo D\u2019Angelo<\/a>, Gran Sasso Science Institute, Italy<\/li>
- Yann Disser<\/a>, TU Darmstadt, Germany<\/li>
- Stefan Funke<\/a>, University of Stuttgart, Germany<\/li>
- Christian Liebchen, TH Wildau, Germany<\/li>
- Mat\u00fa\u0161 Mihal\u00e1k<\/a>, Maastricht University, Netherlands<\/li>
- Joseph S. B. Mitchell<\/a>, Stony Brook University, USA<\/li>
- Matthias M\u00fcller-Hannemann, MLU Halle-Wittenberg, Germany<\/li>
- Philine Schiewe, TU Kaiserslautern, Germany<\/li>
- Pieter Vansteenwegen, KU Leuven, Belgium<\/li>
- Christos Zaroliagis<\/a>, CTI and University of Patras, Greece<\/li><\/ul>\n\n\n\n
Proceedings<\/h2>\n\n\n\n
The proceedings of ATMOS 2022 will be published online and as open-access in the Dagstuhl Open Access Series in Informatics<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"Scope The Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) 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. It is part of ALGO, the major European event for researchers, students and practitioners in … <\/p>\n
Apple Inc.<\/figcaption><\/figure>\n<\/div>\n\n\n\n
Christian Sommer<\/a><\/strong>, Apple Inc.<\/p>\n\n\n\n Speaker:<\/strong> Christian Sommer joined Apple in 2012, two weeks after the initial release of Maps. For the last ten years, he\u2018s been working on various aspects of navigation, including route planning, turn-by-turn navigation, traffic, and road incidents. He\u2019s currently leading an engineering team in Apple\u2018s Zurich office. Prior to industry, he was a researcher in algorithms and data structures during a postdoc at MIT, a PhD at the University of Tokyo, and an MSc at ETH Zurich.<\/p>\n\n\n\n Title: <\/strong>On Map Matching GPS Traces<\/p>\n\n\n\n Abstract:<\/em> With the widespread availability of receivers for the Global Positioning System (GPS) in modern cars and smartphones came the rise of large databases of GPS traces. These are valuable sources for various applications like map construction, map refinement and correction, traffic estimation, travel time estimation, dynamic routing, and many more.\u00a0As a first step, GPS traces often get mapped to a road network via a non-trivial process called map matching. Given a GPS trace as a sequence of (latitude, longitude) pairs, possibly equipped with time stamps and auxiliary information, a map matching algorithm is expected to return a sequence of road segments (edges in the road network) that the input trace likely traversed. In this talk we review problems and approaches around map matching GPS traces at scale.<\/p>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n 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.<\/p>\n\n\n\n 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 proceedings is not allowed. By submitting a paper, the authors acknowledge that in case of acceptance at least one of the authors must register for ALGO\/ATMOS 2022 and present the paper. ATMOS 2022 accepts two types of submissions, both of which will be reviewed with the same quality standards by the Program Committee. The symposium welcomes but is not limited to papers addressing the following topics:<\/p>\n\n\n\n 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.<\/p>\n\n\n\n There will be a Best Paper Award.<\/p>\n\n\n\n The proceedings of ATMOS 2022 will be published online and as open-access in the Dagstuhl Open Access Series in Informatics<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":" Scope The Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) 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. It is part of ALGO, the major European event for researchers, students and practitioners in … <\/p>\nImportant Dates<\/h2>\n\n\n\n
27 June 2022<\/s> extended to 11 July 2022 (anywhere on earth)<\/li>Accepted Papers<\/h2>\n\n\n\n
Algorithms and Hardness for Non-Pool-Based Line Planning<\/em><\/li>
A Discrete-Continuous Algorithm for Globally Optimal Free Flight Trajectory Optimization<\/em><\/li>
Does Laziness Pay Off? – A Lazy-Constraint Approach to Timetabling<\/em><\/li>
Passenger-Aware Real-Time Planning of Short Turns to Reduce Delays in Public Transport<\/em><\/li>
A bilevel model for the frequency setting problem<\/em><\/li>
Tropical Neighbourhood Search: A New Heuristic for Periodic Timetabling<\/em><\/li>
An A* Algorithm for Flight Planning based on Idealized Vertical Profiles<\/em><\/li>
Delay Management with Integrated Decisions on the Vehicle Circulations<\/em><\/li>
REX: A Realistic Time-dependent Model for Multimodal Public Transport<\/em><\/li>
Greedy Algorithms for the Freight Consolidation Problem<\/em><\/li>
Efficient Algorithms for Fully Multimodal Journey Planning<\/em><\/li>
The Edge Investment Problem: Upgrading Transit Line Segments with Multiple Investing Parties<\/em><\/li>
A formulation of MIP train rescheduling at terminals in bidirectional double-track lines with a moving block and ATO<\/em><\/li>
Dynamic Traffic Assignment for Electric Vehicles<\/em><\/li><\/ul>\n\n\n\nCall for Papers<\/h2>\n\n\n\n
Paper Submission<\/h3>\n\n\n\n
Submissions must be in the form of a single PDF file prepared using the LaTeX OASIcs style file (https:\/\/submission.dagstuhl.de\/documentation\/authors<\/a>) and must be submitted electronically via the EasyChair submission system (https:\/\/easychair.org\/conferences\/?conf=atmos2022<\/a>).<\/p>\n\n\n\n
Regular paper submissions:<\/strong> 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 the 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:<\/strong> 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\u2019s 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 the correctness, importance and originality of their work. Short papers will be allotted up to 6 pages in the proceedings.<\/p>\n\n\n\nTopics<\/h3>\n\n\n\n
Awards<\/h3>\n\n\n\n
Committees<\/h2>\n\n\n\n
Program Committee Chairs<\/h3>\n\n\n\n
Program Committee Members<\/h3>\n\n\n\n
Proceedings<\/h2>\n\n\n\n