2026-07-26T17:14:49Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7893 2024-03-06T10:30:13Z ddc:004 open_access

Cost Projection Methods for the Shortest Path Problem with Crossing Costs Blanco, Marco Borndörfer, Ralf Dung Hoàng, Nam Kaier, Anton Casas, Pedro M. Schlechte, Thomas Schlobach, Swen shortest path problem resource constrained shortest path crossing costs flight trajectory optimization overflight fees cost projection Real world routing problems, e.g., in the airline industry or in public and rail transit, can feature complex non-linear cost functions. An important case are costs for crossing regions, such as countries or fare zones. We introduce the shortest path problem with crossing costs (SPPCC) to address such situations; it generalizes the classical shortest path problem and variants such as the resource constrained shortest path problem and the minimum label path problem. Motivated by an application in flight trajectory optimization with overflight costs, we focus on the case in which the crossing costs of a region depend only on the nodes used to enter or exit it. We propose an exact Two-Layer-Dijkstra Algorithm as well as a novel cost-projection linearization technique that transforms crossing costs into shadow costs on individual arcs, thus approximating the SPPCC by a standard shortest path problem. We evaluate all algorithms' performance on real-world flight trajectory optimization instances, obtaining very good à posteriori error bounds. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Marco Blanco and Ralf Borndörfer and Nam Dung Hoàng and Anton Kaier and Pedro M. Casas and Thomas Schlechte and Swen Schlobach 2017 Is Part Of OASIcs, Volume 59, 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2017.15 urn:nbn:de:0030-drops-78939 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2017.15 eng https://creativecommons.org/licenses/by/3.0/legalcode