OASIcs, Volume 48
ATMOS 2015, September 17, 2015, Patras, Greece
Editors: Giuseppe F. Italiano and Marie Schmidt
Published in: OASIcs, Volume 115, 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023)
Pedro José Correia Duarte, Marie Schmidt, Dennis Huisman, and Lucas P. Veelenturf. Fewer Trains for Better Timetables: The Price of Fixed Line Frequencies in the Passenger-Oriented Timetabling Problem. In 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023). Open Access Series in Informatics (OASIcs), Volume 115, pp. 8:1-8:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{correiaduarte_et_al:OASIcs.ATMOS.2023.8, author = {Correia Duarte, Pedro Jos\'{e} and Schmidt, Marie and Huisman, Dennis and Veelenturf, Lucas P.}, title = {{Fewer Trains for Better Timetables: The Price of Fixed Line Frequencies in the Passenger-Oriented Timetabling Problem}}, booktitle = {23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023)}, pages = {8:1--8:18}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-302-7}, ISSN = {2190-6807}, year = {2023}, volume = {115}, editor = {Frigioni, Daniele and Schiewe, Philine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2023.8}, URN = {urn:nbn:de:0030-drops-187695}, doi = {10.4230/OASIcs.ATMOS.2023.8}, annote = {Keywords: PESP, Passenger Oriented Timetabling, Perceived Travel Time} }
Published in: OASIcs, Volume 85, 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)
Johann Hartleb and Marie Schmidt. A Rolling Horizon Heuristic with Optimality Guarantee for an On-Demand Vehicle Scheduling Problem. In 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020). Open Access Series in Informatics (OASIcs), Volume 85, pp. 15:1-15:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{hartleb_et_al:OASIcs.ATMOS.2020.15, author = {Hartleb, Johann and Schmidt, Marie}, title = {{A Rolling Horizon Heuristic with Optimality Guarantee for an On-Demand Vehicle Scheduling Problem}}, booktitle = {20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)}, pages = {15:1--15:18}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-170-2}, ISSN = {2190-6807}, year = {2020}, volume = {85}, editor = {Huisman, Dennis and Zaroliagis, Christos D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2020.15}, URN = {urn:nbn:de:0030-drops-131513}, doi = {10.4230/OASIcs.ATMOS.2020.15}, annote = {Keywords: Rolling Horizon Heuristic, Vehicle Scheduling, Network Flow} }
Published in: OASIcs, Volume 48, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)
15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@Proceedings{italiano_et_al:OASIcs.ATMOS.2015, title = {{OASIcs, Volume 48, ATMOS'15, Complete Volume}}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-99-6}, ISSN = {2190-6807}, year = {2015}, volume = {48}, editor = {Italiano, Giuseppe F. and Schmidt, Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015}, URN = {urn:nbn:de:0030-drops-54712}, doi = {10.4230/OASIcs.ATMOS.2015}, annote = {Keywords: Analysis of Algorithms and Problem Complexity, Optimization, Combinatorics, Graph Theory, Applications} }
Published in: OASIcs, Volume 48, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)
15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, pp. i-x, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{italiano_et_al:OASIcs.ATMOS.2015.i, author = {Italiano, Giuseppe F. and Schmidt, Marie}, title = {{Front Matter, Table of Contents, Preface, Organization}}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)}, pages = {i--x}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-99-6}, ISSN = {2190-6807}, year = {2015}, volume = {48}, editor = {Italiano, Giuseppe F. and Schmidt, Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.i}, URN = {urn:nbn:de:0030-drops-54505}, doi = {10.4230/OASIcs.ATMOS.2015.i}, annote = {Keywords: Front Matter, Table of Contents, Preface, Organization} }
Published in: OASIcs, Volume 48, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)
Simeon Andreev, Julian Dibbelt, Martin Nöllenburg, Thomas Pajor, and Dorothea Wagner. Towards Realistic Pedestrian Route Planning. In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{andreev_et_al:OASIcs.ATMOS.2015.1, author = {Andreev, Simeon and Dibbelt, Julian and N\"{o}llenburg, Martin and Pajor, Thomas and Wagner, Dorothea}, title = {{Towards Realistic Pedestrian Route Planning}}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)}, pages = {1--15}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-99-6}, ISSN = {2190-6807}, year = {2015}, volume = {48}, editor = {Italiano, Giuseppe F. and Schmidt, Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.1}, URN = {urn:nbn:de:0030-drops-54592}, doi = {10.4230/OASIcs.ATMOS.2015.1}, annote = {Keywords: pedestrian routing, realistic model, shortest paths, speed-up technique} }
Published in: OASIcs, Volume 48, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)
Jan Hrncir, Pavol Zilecky, Qing Song, and Michal Jakob. Speedups for Multi-Criteria Urban Bicycle Routing. In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, pp. 16-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{hrncir_et_al:OASIcs.ATMOS.2015.16, author = {Hrncir, Jan and Zilecky, Pavol and Song, Qing and Jakob, Michal}, title = {{Speedups for Multi-Criteria Urban Bicycle Routing}}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)}, pages = {16--28}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-99-6}, ISSN = {2190-6807}, year = {2015}, volume = {48}, editor = {Italiano, Giuseppe F. and Schmidt, Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.16}, URN = {urn:nbn:de:0030-drops-54584}, doi = {10.4230/OASIcs.ATMOS.2015.16}, annote = {Keywords: bicycle routing, multi-criteria shortest path, heuristic speedups} }
Published in: OASIcs, Volume 48, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)
Sören Merting, Christian Schwan, and Martin Strehler. Routing of Electric Vehicles: Constrained Shortest Path Problems with Resource Recovering Nodes. In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, pp. 29-41, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{merting_et_al:OASIcs.ATMOS.2015.29, author = {Merting, S\"{o}ren and Schwan, Christian and Strehler, Martin}, title = {{Routing of Electric Vehicles: Constrained Shortest Path Problems with Resource Recovering Nodes}}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)}, pages = {29--41}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-99-6}, ISSN = {2190-6807}, year = {2015}, volume = {48}, editor = {Italiano, Giuseppe F. and Schmidt, Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.29}, URN = {urn:nbn:de:0030-drops-54559}, doi = {10.4230/OASIcs.ATMOS.2015.29}, annote = {Keywords: routing of electric vehicles, constrained shortest paths, FPTAS, con- strained network flow} }
Published in: OASIcs, Volume 48, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)
Niklas Paulsen, Florian Diedrich, and Klaus Jansen. Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows. In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, pp. 42-55, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{paulsen_et_al:OASIcs.ATMOS.2015.42, author = {Paulsen, Niklas and Diedrich, Florian and Jansen, Klaus}, title = {{Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows}}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)}, pages = {42--55}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-99-6}, ISSN = {2190-6807}, year = {2015}, volume = {48}, editor = {Italiano, Giuseppe F. and Schmidt, Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.42}, URN = {urn:nbn:de:0030-drops-54608}, doi = {10.4230/OASIcs.ATMOS.2015.42}, annote = {Keywords: TSPTW, minimum tour duration, dynamic programming, heuristics} }
Published in: OASIcs, Volume 48, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)
Tadao Takaoka. Single Source Shortest Paths for All Flows with Integer Costs. In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, pp. 56-67, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{takaoka:OASIcs.ATMOS.2015.56, author = {Takaoka, Tadao}, title = {{Single Source Shortest Paths for All Flows with Integer Costs}}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)}, pages = {56--67}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-99-6}, ISSN = {2190-6807}, year = {2015}, volume = {48}, editor = {Italiano, Giuseppe F. and Schmidt, Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.56}, URN = {urn:nbn:de:0030-drops-54611}, doi = {10.4230/OASIcs.ATMOS.2015.56}, annote = {Keywords: information sharing, shortest path problem for all flows, priority queue, limited edge cost, transportation network} }
Published in: OASIcs, Volume 48, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)
Katerina Böhmová, Matúš Mihalák, Peggy Neubert, Tobias Pröger, and Peter Widmayer. Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past. In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, pp. 68-81, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bohmova_et_al:OASIcs.ATMOS.2015.68, author = {B\"{o}hmov\'{a}, Katerina and Mihal\'{a}k, Mat\'{u}\v{s} and Neubert, Peggy and Pr\"{o}ger, Tobias and Widmayer, Peter}, title = {{Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past}}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)}, pages = {68--81}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-99-6}, ISSN = {2190-6807}, year = {2015}, volume = {48}, editor = {Italiano, Giuseppe F. and Schmidt, Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.68}, URN = {urn:nbn:de:0030-drops-54542}, doi = {10.4230/OASIcs.ATMOS.2015.68}, annote = {Keywords: public transportation, route planning, robustness, optimization, experiments} }
Published in: OASIcs, Volume 48, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)
Matúš Mihalák and Sandro Montanari. Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks. In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, pp. 82-94, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{mihalak_et_al:OASIcs.ATMOS.2015.82, author = {Mihal\'{a}k, Mat\'{u}\v{s} and Montanari, Sandro}, title = {{Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks}}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)}, pages = {82--94}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-99-6}, ISSN = {2190-6807}, year = {2015}, volume = {48}, editor = {Italiano, Giuseppe F. and Schmidt, Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.82}, URN = {urn:nbn:de:0030-drops-54561}, doi = {10.4230/OASIcs.ATMOS.2015.82}, annote = {Keywords: shortest path, time-dependent, bi-criteria, bi-directional search, min-max relative regret} }
Published in: OASIcs, Volume 48, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)
Gabriel Gutiérrez-Jarpa, Gilbert Laporte, Vladimir Marianov, and Luigi Moccia. A Mixed Integer Linear Program for the Rapid Transit Network Design Problem with Static Modal Competition (Short Paper). In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, pp. 95-96, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{gutierrezjarpa_et_al:OASIcs.ATMOS.2015.95, author = {Guti\'{e}rrez-Jarpa, Gabriel and Laporte, Gilbert and Marianov, Vladimir and Moccia, Luigi}, title = {{A Mixed Integer Linear Program for the Rapid Transit Network Design Problem with Static Modal Competition}}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)}, pages = {95--96}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-99-6}, ISSN = {2190-6807}, year = {2015}, volume = {48}, editor = {Italiano, Giuseppe F. and Schmidt, Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.95}, URN = {urn:nbn:de:0030-drops-54519}, doi = {10.4230/OASIcs.ATMOS.2015.95}, annote = {Keywords: metro network design, multi-objective optimization, modal competition} }
Published in: OASIcs, Volume 48, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)
Frank Fischer. Ordering Constraints in Time Expanded Networks for Train Timetabling Problems. In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, pp. 97-110, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{fischer:OASIcs.ATMOS.2015.97, author = {Fischer, Frank}, title = {{Ordering Constraints in Time Expanded Networks for Train Timetabling Problems}}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)}, pages = {97--110}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-99-6}, ISSN = {2190-6807}, year = {2015}, volume = {48}, editor = {Italiano, Giuseppe F. and Schmidt, Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.97}, URN = {urn:nbn:de:0030-drops-54524}, doi = {10.4230/OASIcs.ATMOS.2015.97}, annote = {Keywords: combinatorial optimization, train timetabling, Lagrangian relaxation, ordering constraints} }
Published in: OASIcs, Volume 48, 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)
Ralf Borndörfer and Markus Reuther. Regional Search for the Resource Constrained Assignment Problem. In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015). Open Access Series in Informatics (OASIcs), Volume 48, pp. 111-129, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{borndorfer_et_al:OASIcs.ATMOS.2015.111, author = {Bornd\"{o}rfer, Ralf and Reuther, Markus}, title = {{Regional Search for the Resource Constrained Assignment Problem}}, booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)}, pages = {111--129}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-99-6}, ISSN = {2190-6807}, year = {2015}, volume = {48}, editor = {Italiano, Giuseppe F. and Schmidt, Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.111}, URN = {urn:nbn:de:0030-drops-54536}, doi = {10.4230/OASIcs.ATMOS.2015.111}, annote = {Keywords: assignment problem, local search, branch and bound, rolling stock rota- tion problem, vehicle routing problem} }
Feedback for Dagstuhl Publishing