Published in: OASIcs, Volume 106, 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)
Marco Blanco, Ralf Borndörfer, and Pedro Maristany de las Casas. An A* Algorithm for Flight Planning Based on Idealized Vertical Profiles. In 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022). Open Access Series in Informatics (OASIcs), Volume 106, pp. 1:1-1:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{blanco_et_al:OASIcs.ATMOS.2022.1, author = {Blanco, Marco and Bornd\"{o}rfer, Ralf and Maristany de las Casas, Pedro}, title = {{An A* Algorithm for Flight Planning Based on Idealized Vertical Profiles}}, booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)}, pages = {1:1--1:15}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-259-4}, ISSN = {2190-6807}, year = {2022}, volume = {106}, editor = {D'Emidio, Mattia and Lindner, Niels}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.1}, URN = {urn:nbn:de:0030-drops-171052}, doi = {10.4230/OASIcs.ATMOS.2022.1}, annote = {Keywords: shortest path problem, a-star algorithm, flight trajectory optimization, flight planning, heuristics} }
Published in: OASIcs, Volume 96, 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)
Niels Lindner, Pedro Maristany de las Casas, and Philine Schiewe. Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data. In 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021). Open Access Series in Informatics (OASIcs), Volume 96, pp. 7:1-7:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{lindner_et_al:OASIcs.ATMOS.2021.7, author = {Lindner, Niels and Maristany de las Casas, Pedro and Schiewe, Philine}, title = {{Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data}}, booktitle = {21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)}, pages = {7:1--7:15}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-213-6}, ISSN = {2190-6807}, year = {2021}, volume = {96}, editor = {M\"{u}ller-Hannemann, Matthias and Perea, Federico}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.7}, URN = {urn:nbn:de:0030-drops-148767}, doi = {10.4230/OASIcs.ATMOS.2021.7}, annote = {Keywords: Preprocessing Shortest Path Problems, Interval Data, Graph Algorithms} }
Published in: OASIcs, Volume 75, 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)
Adam Schienle, Pedro Maristany, and Marco Blanco. A Priori Search Space Pruning in the Flight Planning Problem. In 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019). Open Access Series in Informatics (OASIcs), Volume 75, pp. 8:1-8:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{schienle_et_al:OASIcs.ATMOS.2019.8, author = {Schienle, Adam and Maristany, Pedro and Blanco, Marco}, title = {{A Priori Search Space Pruning in the Flight Planning Problem}}, booktitle = {19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)}, pages = {8:1--8:14}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-128-3}, ISSN = {2190-6807}, year = {2019}, volume = {75}, editor = {Cacchiani, Valentina and Marchetti-Spaccamela, Alberto}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2019.8}, URN = {urn:nbn:de:0030-drops-114205}, doi = {10.4230/OASIcs.ATMOS.2019.8}, annote = {Keywords: time-dependent shortest path problem, crossing costs, flight trajectory optimization, preprocessing, search space} }
Published in: OASIcs, Volume 75, 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)
Ricardo Euler and Ralf Borndörfer. A Graph- and Monoid-Based Framework for Price-Sensitive Routing in Local Public Transportation Networks. In 19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019). Open Access Series in Informatics (OASIcs), Volume 75, pp. 12:1-12:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{euler_et_al:OASIcs.ATMOS.2019.12, author = {Euler, Ricardo and Bornd\"{o}rfer, Ralf}, title = {{A Graph- and Monoid-Based Framework for Price-Sensitive Routing in Local Public Transportation Networks}}, booktitle = {19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2019)}, pages = {12:1--12:15}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-128-3}, ISSN = {2190-6807}, year = {2019}, volume = {75}, editor = {Cacchiani, Valentina and Marchetti-Spaccamela, Alberto}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2019.12}, URN = {urn:nbn:de:0030-drops-114243}, doi = {10.4230/OASIcs.ATMOS.2019.12}, annote = {Keywords: shortest path, public transit, optimization, price-sensitive, raptor, fare, operations research} }
Feedback for Dagstuhl Publishing