文章基本信息

标题：Cost Projection Methods for the Shortest Path Problem with Crossing Costs
本地全文：下载
作者：Marco Blanco ; Ralf Bornd{\"o}rfer ; Nam Dung Ho{\`a}ng 等
期刊名称：OASIcs : OpenAccess Series in Informatics
电子版ISSN：2190-6807
出版年度：2017
卷号：59
页码：1-14
DOI：10.4230/OASIcs.ATMOS.2017.15
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：shortest path problem; resource constrained shortest path; crossing costs; flight trajectory optimization; overflight fees; cost projection