Optimal hyperpaths with non-additive link costs
place - north america, policy - fares, planning - methods
Non-additive costs, Bellman principle, Hyperpath, Optimal strategies, Frequency-based assignment
Non-additive fares are common in public transport as well as important for a range of other assignment problems. We discuss the problem of finding optimal hyperpaths under such conditions assuming a cost vector with a limited number of marginal decreasing costs depending on the number of links already traversed. We illustrate that these non-additive costs lead to violation of Bellman's optimality principle which in turn means that standard procedures to obtain optimal destination specific hyperpath trees are not feasible. To overcome the problem we introduce the concepts of a “travel history vector” and critical vs fixed nodes. The former records the expected number of traversed links until a node, and the latter distinguishes nodes for which the fare cost can be determined deterministically. With this we develop a 2-stage solution approach. In the first stage we test whether the optimal hyperpath can be obtained by backward search. If this is not the case, we propose a selective hyperpath generation to a (small) number of critical nodes and combine this with standard hyperpath search. We illustrate our approach by applying it to the Sioux Falls network showing that even for link cost functions (fare stages) with large step changes we are able to obtain all optimal hyperpaths in a reasonable computational time.
Permission to publish the abstract has been given by Elsevier, copyright remains with them.
Maadi, S., & Schmöcker, J. (2017). Optimal hyperpaths with non-additive link costs. Transportation Research Part B: Methodological, Vol. 105, pp. 235-248.