Browsing by Author "Geroliminis, Nikolas"
Now showing 1 - 4 of 4
- Results Per Page
- Sort Options
Item Cordon Pricing Consistent with the Physics of Overcrowding.(Springer, 2009) Geroliminis, Nikolas; Levinson, David MThis paper describes the modeling of recurring congestion in a network. It is shown that the standard economic models of marginal cost cannot describe precisely traffic congestion in networks during time-dependent conditions. Following a macroscopic traffic approach, we describe the equilibrium solution for a congested network in the no-toll case. A dynamic model of cordon-based congestion pricing (such as for the morning commute) for networks is developed consistent with the physics of traffic. The paper combines Vickrey’s theory with a macroscopic traffic model, which is readily observable with existing monitoring technologies. The paper also examines some policy implications of the cordon-based pricing to treat equity and reliability issues, i.e. in what mobility level a city should choose to operate. An application of the model in a downtown area shows that these schemes can improve mobility and relieve congestion in cities.Item Development of the Next Generation Stratified Ramp Metering Algorithm Based on Freeway Density(Center for Transportation Studies, 2011-03) Geroliminis, Nikolas; Srivastava, Anupam; Michalopoulos, PanosA new coordinated, traffic-responsive ramp metering algorithm has been designed for Minnesota’s freeways based on density measurements, rather than flows. This is motivated in view of recent research indicating that the critical value of density at which capacity is observed is less sensitive and more stable than the value of capacity, thereby resulting in m ore effective control. Firstly, we develop a methodology to estimate densities with space and time based on data from loop detectors. The methodology is based on solving a flow conservation differential equation (using LWR theory) with intermediate (internal) freeway mainline boundaries, which is fast er and more accurate from previous resear ch using only external boundaries. To capture the capacity drop phenomenon into the first-order model we utilize a fundamental diagram with two values of capacity and we provide a memory-based methodology to choose the appropriate value in the numerical solution of the problem. Secondly, with respect to ramp metering, the main goals of the algorithm are to delay the onset of the breakdown and to accelerate system recovery when ramp metering is unable due to the violation of maximum allowable ramp waiting time. The effectiveness of the new control strategy is being assessed by comparison with the currently deployed version of the Stratified Zone Algorithm (SZM) through microscopic simulation of a real 12-mile, 17 ramp freeway section. Simulations show a decrease in the delays of mainline and ramp traffic, an improvement 8% in the overall delays and avoidance of the maximum ramp delay violations.Item Field Implementation, Testing, and Refinement of Density Based Coordinated Ramp Control Strategy(Center for Transportation Studies, University of Minnesota, 2015-06) Hourdos, John; Geroliminis, Nikolas; Zitzow, Stephen; Limniati, Ypatia StefaniaIn the Twin Cities metropolitan area, freeway ramp metering goes back as early as 1969, when the Minnesota Department of Transportation (MnDOT) first tested ramp metering in an I-35E pilot project. To date, the Twin Cities ramp metering system has grown to include more than 433 ramp meters. Research on better, improved ramp control strategies has continued over the years and MnDOT has implemented minor and major changes in the control logic. Two independent studies both aimed at developing the next generation in ramp metering by focusing on density. Based on these efforts, two new algorithms were developed: the UMN Density and the UMD KAdaptive, named based on the campus at which they were developed. The goal of this project was to implement both algorithms and test them under real conditions. Priorities and technical problems prevented the evaluation of the UMN algorithms, so this report focuses on the evaluation of the UMD KAdaptive algorithm on two freeway corridors in the Twin Cities, MN. The first site, a section of TH-100 northbound between 50th Street and I-394, was selected to compare the then current logic, the Stratified Zone algorithm, with the new one. During the course of this project, the UMD algorithm eventually replaced the Stratified Zone algorithm and was implemented in the entire system. This full deployment also included corridors that were not controlled before. The second evaluation site on eastbound TH-212 was a site that allowed for a with/without control evaluation of the UMD algorithm. This report describes the experiments conducted at both sites and includes a comprehensive review of the state of ramp metering strategies around the world to date.Item The Importance of Being Early(Kluwer Academic Publishers, 2011) Parthasarathi, Pavithra; Srivastava, Anupam; Geroliminis, Nikolas; Levinson, David MThe assumption that the penalty for being early is less than that for being late was put forward by Vickrey (1963) who analyzed how commuters compare penalties in the form of schedule delay (due to peak hour congestion), against penalties in the form of reaching their destination (ahead or behind their desired time of arrival). This assumption has been tested by many researchers since then for various applications, especially in modeling congestion pricing (Arnott et al., 1990) where it is critical to understand the tradeoff between schedule delay and travel delay. Key findings are summarized in the second section of this paper. This research aims to test this hypothesis of earliness being less expensive than lateness using empirical data at different levels and across different regions. New methods to estimate the ratio of earliness to lateness for different types of datasets are developed, which could be used by agencies to implement control policies like congestion pricing or other schemes more accurately. Travel survey data from metropolitan areas provide individual travel patterns while loop detector data provide link level traffic flow data.