{"id":49,"date":"2022-11-23T16:08:58","date_gmt":"2022-11-23T15:08:58","guid":{"rendered":"https:\/\/algo-conference.org\/2023\/?page_id=49"},"modified":"2025-09-30T09:25:39","modified_gmt":"2025-09-30T09:25:39","slug":"atmos","status":"publish","type":"page","link":"https:\/\/algo-conference.org\/2025\/atmos\/","title":{"rendered":"ATMOS"},"content":{"rendered":"\n<p class=\"has-large-font-size\"><strong>25th Symposium on Algorithmic Approaches for Transportation Modeling, Optimization and Systems<\/strong><\/p>\n\n\n\n<h3 class=\"wp-block-heading has-link-color has-large-font-size wp-elements-3892aadee759c1eb17fef007f38fe3aa\" style=\"font-style:normal;font-weight:500\">Scope<\/h3>\n\n\n\n<p>The ATMOS 2025 symposium will be held in connection with <a href=\"https:\/\/algo-conference.org\/2025\/\">ALGO 2025<\/a> in Warsaw, Poland on September 18-19, 2025.<\/p>\n\n\n\n<p>Since 2000, <a href=\"https:\/\/atmos-symposium.eu\/\">ATMOS<\/a> 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<h3 class=\"wp-block-heading has-large-font-size\" style=\"font-style:normal;font-weight:500\">Invited Speaker<\/h3>\n\n\n\n<p>L<img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"146\" class=\"wp-image-2068\" style=\"width: 150px;\" src=\"http:\/\/algo-conference.org\/2025\/wp-content\/uploads\/2025\/05\/fotoMarjanGSNS-scaled.jpg\" alt=\"Marjan van den Akker\" srcset=\"https:\/\/algo-conference.org\/2025\/wp-content\/uploads\/2025\/05\/fotoMarjanGSNS-scaled.jpg 2560w, https:\/\/algo-conference.org\/2025\/wp-content\/uploads\/2025\/05\/fotoMarjanGSNS-300x293.jpg 300w, https:\/\/algo-conference.org\/2025\/wp-content\/uploads\/2025\/05\/fotoMarjanGSNS-1024x999.jpg 1024w, https:\/\/algo-conference.org\/2025\/wp-content\/uploads\/2025\/05\/fotoMarjanGSNS-768x749.jpg 768w, https:\/\/algo-conference.org\/2025\/wp-content\/uploads\/2025\/05\/fotoMarjanGSNS-1536x1498.jpg 1536w, https:\/\/algo-conference.org\/2025\/wp-content\/uploads\/2025\/05\/fotoMarjanGSNS-2048x1997.jpg 2048w\" sizes=\"auto, (max-width: 150px) 100vw, 150px\" \/> <\/p>\n\n\n\n<p><strong>Speaker:<\/strong>&nbsp;<a href=\"https:\/\/webspace.science.uu.nl\/~akker103\/\" data-type=\"link\" data-id=\"https:\/\/webspace.science.uu.nl\/~akker103\/\">Marjan va<\/a><a href=\"https:\/\/www.uu.nl\/staff\/JMvandenAkker\" data-type=\"link\" data-id=\"https:\/\/webspace.science.uu.nl\/~akker103\/\">n<\/a><a href=\"https:\/\/webspace.science.uu.nl\/~akker103\/\" data-type=\"link\" data-id=\"https:\/\/webspace.science.uu.nl\/~akker103\/\"> den Akker<\/a>, Utrecht University, the Netherlands <\/p>\n\n\n\n<p><strong>Title:<\/strong>&nbsp;A glimpse into OR for airline operations and why this is (not?) public transportation<\/p>\n\n\n\n<p><strong>Abstract:<\/strong>&nbsp;In this talk, we first consider optimization problems in airline operations based on research done in collaboration with KLM Royal Dutch Airlines. &nbsp;Airline operations are prone to delays and disruptions, due to tight schedules and dependence on various resources. Since the COVID pandemic resource shortages have made the situation worse. In case of disruptions, schedules need to be adjusted in such a way that overall costs as well as impact on passengers are minimized, ideally in near real-time for practical deployment. &nbsp;Since schedules depend on several resources, we take an integrated viewpoint. We will discuss some problems, such as integrated tail and crew recovery, where we will show that our integrated algorithm outperforms a sequential approach.<\/p>\n\n\n\n<p>Then we move to a more general discussion. Within the operations research community, aviation and public transportation are often treated as distinct areas, with separate conference tracks and even dedicated conferences. This separation suggests that aviation is not considered a form of public transportation. We will challenge this assumption by exploring both similarities and differences in optimization problems in aviation, railways, and public bus transportation.<\/p>\n\n\n\n<h3 class=\"wp-block-heading has-large-font-size\"><strong>List of accepted papers<\/strong><\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Sven Mallach.  <em>&#8220;Refined Integer Programs and Polyhedral Results for the Target Visitation Problem&#8221;<\/em><\/li>\n\n\n\n<li>Ugo Rosolia, Marc Bataillou Almagro, George Iosifidis, Martin Gross and Georgios Paschos. <em>&#8220;Speed-Aware Network Design: A Parametric Optimization Approach&#8221;<\/em><\/li>\n\n\n\n<li>Lena Dittrich, Michael Rihlmann, Anita Sch\u00f6bel and Sarah Roth.<em> &#8220;A model for strategic ridepooling and its integration with line planning&#8221;<\/em><\/li>\n\n\n\n<li>Rolf van Lieshout and Bart van Rossum. <em>&#8220;The Fair Periodic Assignment Problem&#8221;<\/em><\/li>\n\n\n\n<li>Shaul Rosner and Tami Tamir. <em>&#8220;Throughput Maximization in a Scheduling Environment with Machine-Dependent Due-dates&#8221;<\/em><\/li>\n\n\n\n<li>Konstantinos Karathanasis, Spyros Kontogiannis, Asterios Pegos, Vasilios Sofianos and Christos Zaroliagis. <em>&#8220;VRP-inspired Techniques for Discrete Dynamic Berth Allocation and Scheduling&#8221;<\/em><\/li>\n\n\n\n<li>Sarah Roth and Anita Sch\u00f6bel.<em> &#8220;Energy-Efficient Line Planning by Implementing Express Lines&#8221;<\/em><\/li>\n\n\n\n<li>Julia Meusel, Matthias M\u00fcller-Hannemann and Klaus Reinhardt. <em>&#8220;Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases&#8221;<\/em><\/li>\n\n\n\n<li>Jonas Barth, Kendra Reiter and Marie Schmidt. <em>&#8220;The Line-Based Dial-a-Ride Problem with Transfers&#8221;<\/em><\/li>\n\n\n\n<li>Fabian L\u00f6bel and Niels Lindner. <em>&#8220;A Geometric Approach to Integrated Periodic Timetabling and Passenger Routing&#8221;<\/em><\/li>\n\n\n\n<li>Caleb Eardley, Dalton Gomez, Ryan Dupois, Michael Papadopoulos and Sean Yaw. <em>&#8220;A Genetic Algorithm for Multi-Capacity Fixed-Charge Flow Network Design&#8221;<\/em><\/li>\n\n\n\n<li>Christopher Hojny, Frits Spieksma and Sten Wessel. <em>&#8220;Evaluating Fairness of Sequential Resource Allocation Policies: a Computational Study&#8221;<\/em><\/li>\n\n\n\n<li>Philine Schiewe, Anita Sch\u00f6bel and Reena Urban. <em>&#8220;Design of Distance Tariffs in Public Transport&#8221;<\/em><\/li>\n\n\n\n<li>Johann Hartleb, Marie Schmidt, Samuel Wolf and Alexander Wolff. <em>&#8220;Visualization of Event Graphs for Train Schedules&#8221;<\/em><\/li>\n\n\n\n<li>Johannes Breitling and Moritz Laupichler. <em>&#8220;Exact and Heuristic Dynamic Taxi Sharing with Transfers using Shortest-Path Speedup Techniques&#8221;<\/em><\/li>\n\n\n\n<li>Carina Truschel and Sabine Storandt. <em>&#8220;Multi-Criteria Route Planning with Little Regret&#8221;<\/em><\/li>\n\n\n\n<li>Stefan Engels and Robert Wille. <em>&#8220;Using A* for Optimal Train Routing on Moving Block Systems&#8221;<\/em><\/li>\n\n\n\n<li>Scott Bacherle, Thomas Bl\u00e4sius and Michael Z\u00fcndorf. <em>&#8220;Separator-Based Alternative Paths in Customizable Contraction Hierarchies&#8221;<\/em><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-large-font-size\" style=\"font-style:normal;font-weight:500\">Important Dates<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Submission deadline: <s>June 30<\/s> July 6, 2025 (AoE)<\/li>\n\n\n\n<li>Notification to authors:&nbsp;August 5, 2025<\/li>\n\n\n\n<li>Camera ready submission:&nbsp;August 24, 2025<\/li>\n\n\n\n<li>Symposium:&nbsp;September 18-19, 2025<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-large-font-size\" style=\"font-style:normal;font-weight:500\">Call for papers<\/h3>\n\n\n\n<p>The symposium welcomes but is not limited to papers addressing the following topics:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Congestion Modelling and Reduction<\/li>\n\n\n\n<li>Crew and Duty Scheduling<\/li>\n\n\n\n<li>Demand Forecasting<\/li>\n\n\n\n<li>Delay Management<\/li>\n\n\n\n<li>Design of Pricing Systems<\/li>\n\n\n\n<li>Electromobility<\/li>\n\n\n\n<li>Infrastructure Planning<\/li>\n\n\n\n<li>Intelligent Transportation Systems<\/li>\n\n\n\n<li>Models for User Behaviour<\/li>\n\n\n\n<li>Line Planning<\/li>\n\n\n\n<li>Mobile Applications for Transport<\/li>\n\n\n\n<li>Mobility-as-a-Service<\/li>\n\n\n\n<li>Multi-modal Transport Optimization<\/li>\n\n\n\n<li>Routing and Platform Assignment<\/li>\n\n\n\n<li>Route Planning in Road and Public Transit Networks<\/li>\n\n\n\n<li>Rostering<\/li>\n\n\n\n<li>Timetable Generation<\/li>\n\n\n\n<li>Tourist Tour Planning<\/li>\n\n\n\n<li>Traffic Guidance<\/li>\n\n\n\n<li>Vehicle Scheduling<\/li>\n<\/ul>\n\n\n\n<p>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<h3 class=\"wp-block-heading has-large-font-size\" style=\"font-style:normal;font-weight:500\">Proceedings<\/h3>\n\n\n\n<p>The proceedings will be published on the Dagstuhl Open Access Series in Informatics (OASIcs) publication service.<\/p>\n\n\n\n<h3 class=\"wp-block-heading has-large-font-size\" style=\"font-style:normal;font-weight:500\">Awards<\/h3>\n\n\n\n<p>Awards will be given to the best regular paper and the best student regular paper. A regular paper is eligible for the best student paper award if at least one of the authors is a full-time student (Bachelor, Master, or Ph.D.) at the time of submission and the student(s) must have made a major contribution to the paper. The PC can decide to decline or to split the awards.<\/p>\n\n\n\n<p>The ATMOS 2025 Best Regular Paper Award was awarded to<br>Rolf van Lieshout and Bart van Rossum. <em>&#8220;The Fair Periodic Assignment Problem&#8221;<\/em>.<br><br>The ATMOS 2025 Best Regular Student Paper Award was awarded to<br>Fabian L\u00f6bel and Niels Lindner. <em>&#8220;A Geometric Approach to Integrated Periodic Timetabling and Passenger Routing&#8221;<\/em>.<\/p>\n\n\n\n<h3 class=\"wp-block-heading has-large-font-size\" style=\"font-style:normal;font-weight:500\">Paper submission<\/h3>\n\n\n\n<p>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 at ALGO\/ATMOS 2025, attend the conference on-site, and present the paper.<br><br>Submissions must be in the form of a single PDF file prepared according to the <a href=\"https:\/\/submission.dagstuhl.de\/series\/details\/OASIcs#author\" data-type=\"link\" data-id=\"https:\/\/submission.dagstuhl.de\/series\/details\/OASIcs#author\">author instructions<\/a> and using the <a href=\"https:\/\/submission.dagstuhl.de\/series\/details\/OASIcs#author\">LaTeX OASIcs style file<\/a> and must be submitted electronically via the <a href=\"https:\/\/easychair.org\/conferences\/?conf=atmos2025\">EasyChair submission system<\/a>.<br><br>ATMOS 2025 accepts two types of submissions, both of which will be reviewed with the same quality standards by the Program Committee.<br><br><strong>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 consist of a main body plus an optional and clearly marked appendix. The target length for the main body (excluding the bibliography, the front page(s) (authors, affiliation, keywords, abstract, &#8230;)) is 12-15 pages. The total paper, including the bibliography, the front page(s) (authors, affiliation, keywords, abstract, &#8230;) and the optional appendix, may not exceed 20 pages. 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 15 pages) due to space limitations can be put into the optional appendix, which will be read at the Program Committee\u2019s discretion. Regular papers will be allotted up to 20 pages in the proceedings.<br><br><strong>Short paper<\/strong> <strong>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\n<h3 class=\"wp-block-heading has-large-font-size\" style=\"font-style:normal;font-weight:500\">Program committee<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Moritz Baum, Apple, Switzerland<\/li>\n\n\n\n<li><a href=\"https:\/\/www.unibo.it\/sitoweb\/valentina.cacchiani\/en\">Valentina Cacchiani<\/a>, University of Bologna, Italy<\/li>\n\n\n\n<li><a href=\"https:\/\/www-sop.inria.fr\/members\/David.Coudert\/index.shtml\">David Coudert<\/a>, INRIA, France<\/li>\n\n\n\n<li><a href=\"https:\/\/www.eur.nl\/people\/twan-dollevoet\">Twan Dollevoet<\/a>, Erasmus University Rotterdam, the Netherlands<\/li>\n\n\n\n<li><a href=\"https:\/\/www.disim.univaq.it\/MattiaDEmidio\">Mattia D&#8217;Emidio<\/a>, University of L&#8217;Aquila, Italy<\/li>\n\n\n\n<li><a href=\"https:\/\/www.fim.uni-passau.de\/mathopt\/team\/dr-lukas-graf\">Lukas Graf<\/a>, University of Passau, Germany<\/li>\n\n\n\n<li><a href=\"https:\/\/people.irisa.fr\/Loic.Helouet\/\">Lo\u00efc H\u00e9lou\u00ebt<\/a>, INRIA Rennes, France<\/li>\n\n\n\n<li><a href=\"https:\/\/orbit.dtu.dk\/en\/persons\/richard-martin-lusby\">Richard Lusby<\/a>, Technical University of Denmark, Denmark<\/li>\n\n\n\n<li><a href=\"https:\/\/research.vu.nl\/en\/persons\/gabor-maroti\" data-type=\"link\" data-id=\"https:\/\/research.vu.nl\/en\/persons\/gabor-maroti\">Gabor Maroti<\/a>, Vrije Universiteit Amsterdam, the Netherlands<\/li>\n\n\n\n<li><a href=\"https:\/\/www.maastrichtuniversity.nl\/m-mihalak\">Matus Mihalak<\/a>, University of Maastricht, the Netherlands<\/li>\n\n\n\n<li><a href=\"https:\/\/investigacion.us.es\/sisius\/sis_showpub.php?idpers=9269\" data-type=\"link\" data-id=\"https:\/\/investigacion.us.es\/sisius\/sis_showpub.php?idpers=9269\">Federico Perea<\/a>, University de Seville, Spain<\/li>\n\n\n\n<li><a href=\"https:\/\/transp-or.epfl.ch\/academic\/RICARD.html\">L\u00e9a Ricard<\/a>, EPFL, Switzerland<\/li>\n\n\n\n<li><a href=\"https:\/\/ca.cs.uni-bonn.de\/doku.php?id=people:sauer\">Jonas Sauer<\/a> (co-chair), University of Bonn, Germany<\/li>\n\n\n\n<li><a href=\"https:\/\/research.aalto.fi\/en\/persons\/philine-schiewe\">Philine Schiewe<\/a>, Aalto University, Finland<\/li>\n\n\n\n<li><a href=\"https:\/\/www.itn.liu.se\/~chrsc91\/\">Christiane Schmidt<\/a>, Link\u00f6ping University, Sweden<\/li>\n\n\n\n<li><a href=\"https:\/\/www.informatik.uni-wuerzburg.de\/en\/algo\/team\/schmidt-marie\/\">Marie Schmidt<\/a> (co-chair), University of W\u00fcrzburg, Germany<\/li>\n\n\n\n<li><a href=\"https:\/\/www.tu-braunschweig.de\/mo\/team\/stiller\">Sebastian Stiller<\/a>, Technical University Braunschweig, Germany<\/li>\n\n\n\n<li><a href=\"https:\/\/ad.informatik.uni-freiburg.de\/staff\/storandt\">Sabine Storandt<\/a>, University of Konstanz, Germany<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading has-large-font-size\" style=\"font-style:normal;font-weight:500\">Steering Committee<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Matthias M\u00fcller-Hannemann, University of Halle, Germany<\/li>\n\n\n\n<li>Marie Schmidt, Universit\u00e4t W\u00fcrzburg, Germany<\/li>\n\n\n\n<li>Anita Sch\u00f6bel, University of Kaiserslautern-Landau, Germany<\/li>\n\n\n\n<li>Christos Zaroliagis, University of Patras, Greece (Chair)<\/li>\n<\/ul>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>25th Symposium on Algorithmic Approaches for Transportation Modeling, Optimization and Systems Scope The ATMOS 2025 symposium will be held in connection with ALGO 2025 in Warsaw, Poland on September 18-19, 2025. Since 2000, ATMOS brings together researchers and practitioners who are interested in all aspects of algorithmic methods and models for transport optimization. The symposium [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"wp-custom-template-page-1","meta":{"footnotes":""},"class_list":["post-49","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/algo-conference.org\/2025\/wp-json\/wp\/v2\/pages\/49","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/algo-conference.org\/2025\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/algo-conference.org\/2025\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/algo-conference.org\/2025\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/algo-conference.org\/2025\/wp-json\/wp\/v2\/comments?post=49"}],"version-history":[{"count":31,"href":"https:\/\/algo-conference.org\/2025\/wp-json\/wp\/v2\/pages\/49\/revisions"}],"predecessor-version":[{"id":2345,"href":"https:\/\/algo-conference.org\/2025\/wp-json\/wp\/v2\/pages\/49\/revisions\/2345"}],"wp:attachment":[{"href":"https:\/\/algo-conference.org\/2025\/wp-json\/wp\/v2\/media?parent=49"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}