18th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems
We invite authors to present work that advances optimization methods and algorithms to facilitate planning and operational management of freight and passenger transportation and traffic. The workshop welcomes but is not limited to papers addressing the following challenges:
The workshop welcomes but is not limited to papers applying and advancing the following techniques: Graph and Network Algorithms, Combinatorial Optimization, Mathematical Programming, Approximation Algorithms, Methods for the Integration of Planning Stages, Stochastic and Robust Optimization, Online and Real-time Algorithms, Algorithmic Game Theory, Heuristics for Real-world Instances, Simulation Tools.
Authors are invited to submit an extended abstract or full paper of at most 12 pages (including title page and abstract, but not counting references and an optional appendix). Submissions must be formatted in LaTeX, using the OASIcs style file. The paper should contain a succinct statement of the issues and of their motivation, a summary of the main results, and a brief explanation of their significance, accessible to non-specialist readers. Proofs omitted due to space constraints can be put into an appendix to be read by the program committee members at their discretion. Papers must be submitted electronically via the EasyChair submisson system at
The submission must be received by June 24, 2018. By submitting a paper the authors acknowledge that in case of acceptance at least one of the authors must register at ALGO 2018 or ATMOS 2018, attend the conference, and present the paper.
The proceedings of ATMOS 2018 will be published online and as open-access in the Dagstuhl Open Access Series in Informatics (OASIcs).
Selected papers will be invited for publication in a special issue of 'NETWORKS'.
There will be a Best Paper Award as well as a Best VGI Paper Award for the paper that best leverages volunteered geographic information in meaningful and novel ways.