This paper studies strategies to optimize the lane configuration of a transportation network for a given set of Origin-Destination demands using a planning macroscopic network flow model. The lane reversal problem is, in general, NP-hard since the optimization is made over integer variables. To overcome this burden, we reformulate the problem using a piecewise affine approximation of the travel latency function which allows us to exploit the total unimodularity property of Integer Linear Programming (ILP). Consequently, we transform the ILP problem to a linear program by relaxing the integer variables. In addition, our method is capable of solving the problem for a desired number of lane reversals which serves to perform cost-benefit analysis. We perform a case study using the transportation network of Eastern Massachusetts (EMA) and we test our method against the original lane configuration and a projected lower bound solution. Our empirical results quantify the travel time savings for different levels of demand intensity. We observe reduction in travel times up to 40% for certain links in the network.
Planning Strategies for Lane Reversals in Transportation Networks
19.09.2021
559338 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Sketch Planning Analysis of HOT Lane Strategies
British Library Conference Proceedings | 2006
|Information Processing Strategies in Riskless Preference Reversals: The Prominence Effect
Online Contents | 1994
|Effects of Bus Lane Operation on Transportation Networks
Trans Tech Publications | 2014
|Europäisches Patentamt | 2023
|LANE CHANGE PLANNING DEVICE AND LANE CHANGE PLANNING METHOD
Europäisches Patentamt | 2015
|