Modeling the Effect of a Road Construction Project on Transportation System Performance

Road construction projects create physical changes on roads that result in capacity reduction and travel time escalation during the construction project period. The reduction in the posted speed limit, the number of lanes, lane width and shoulder width at the construction zone makes it difficult for the road to accommodate high traffic volume. Therefore, the goal of this research is to model the effect of a road construction project on travel time at road link-level and help improve the mobility of people and goods through dissemination or implementation of proactive solutions. Data for a resurfacing construction project on I-485 in the city of Charlotte, North Carolina (NC) was used evaluation, analysis, and modeling. A statistical t-test was conducted to examine the relationship between the change in travel time before and during the construction project period. Further, travel time models were developed for the freeway links and the connecting arterial street links, both before and during the construction project period. The road network characteristics of each link, such as the volume/ capacity (V/C), the number of lanes, the speed limit, the shoulder width, the lane width, whether the link is divided or undivided, characteristics of neighboring links, the time-of-the-day, the day-of-the-week, and the distance of the link from the road construction project were considered as predictor variables for modeling. The results obtained indicate that a decrease in travel time was observed during the construction project period on the freeway links when compared to the before construction project period. Contrarily, an increase in travel time was observed during the construction project period on the connecting arterial street links when compared to the before construction project period. Also, the average travel time, the planning time, and the travel time index can better explain the effect of a road construction project on transportation system performance when compared to the planning time index and the buffer time index. The influence of predictor variables seem to vary before and during the construction project period on the freeway links and connecting arterial street links. Practitioners should take the research findings into consideration, in addition to the construction zone characteristics, when planning a road construction project and developing temporary traffic control and detour plans

Route Planning in Transportation Networks

We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time. Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic. Journey planning on public transportation systems, although conceptually similar, is a significantly harder problem due to its inherent time-dependent and multicriteria nature. Although exact algorithms are fast enough for interactive queries on metropolitan transit systems, dealing with continent-sized instances requires simplifications or heavy preprocessing. The multimodal route planning problem, which seeks journeys combining schedule-based transportation (buses, trains) with unrestricted modes (walking, driving), is even harder, relying on approximate solutions even for metropolitan inputs.Comment: This is an updated version of the technical report MSR-TR-2014-4, previously published by Microsoft Research. This work was mostly done while the authors Daniel Delling, Andrew Goldberg, and Renato F. Werneck were at Microsoft Research Silicon Valle

An Approach for Actions to Prevent Suicides on Commuter and Metro Rail Systems in the United States, MTI Report 12-33

The primary goals of this report are to discuss measures to prevent suicides on commuter and metro rail systems, and to outline an approach for suicide prevention on rail systems. Based on existing literature and analysis of data obtained from the Metrolink system in Southern California, it was found that most suicides occur near station platforms and near access points to the track. Suicides occurred most frequently when relatively more trains were in operation and in areas of high population density. There do not appear to be suicide “hot spots” (e.g., linked to mental hospitals in the proximity, etc.), based on data analyzed for U.S. systems. The suicide prevention measures range from relatively inexpensive signs posting call-for-help suicide hotline information to costly platform barriers that physically prevent people from jumping onto tracks in front of trains. Other prevention measures fall within this range, such as hotlines available at high frequency suicide locations, or surveillance systems that can report possible suicide attempts and provide the opportunity for intervention tactics. Because of the relatively low number of suicides on rail systems, as compared to the overall number of suicides in general, a cost-effective strategy for preventing suicides on rail systems should be approached in a very focused manner. The prevention measures executed by the rail authorities should be focused on the suicides occurring on the rail systems themselves, while the broader problem of suicides should be left to community-based prevention efforts. Moreover, prevention measures, such as surveillance and response, could “piggyback” on surveillance and response systems used for other purposes on the rail systems to make such projects economically feasible

Geometrically-exact time-integration mesh-free schemes for advection-diffusion problems derived from optimal transportation theory and their connection with particle methods

We develop an Optimal Transportation Meshfree (OTM) particle method for advection-diffusion in which the concentration or density of the diffusive species is approximated by Dirac measures. We resort to an incremental variational principle for purposes of time discretization of the diffusive step. This principle characterizes the evolution of the density as a competition between the Wasserstein distance between two consecutive densities and entropy. Exploiting the structure of the Euler-Lagrange equations, we approximate the density as a collection of Diracs. The interpolation of the incremental transport map is effected through mesh-free max-ent interpolation. Remarkably, the resulting update is geometrically exact with respect to advection and volume. We present three-dimensional examples of application that illustrate the scope and robustness of the method.Comment: 19 pages, 8 figure

Formulation, existence, and computation of boundedly rational dynamic user equilibrium with fixed or endogenous user tolerance

This paper analyzes dynamic user equilibrium (DUE) that incorporates the notion of boundedly rational (BR) user behavior in the selection of departure times and routes. Intrinsically, the boundedly rational dynamic user equilibrium (BR-DUE) model we present assumes that travelers do not always seek the least costly route-and-departure-time choice. Rather, their perception of travel cost is affected by an indifference band describing travelers’ tolerance of the difference between their experienced travel costs and the minimum travel cost. An extension of the BR-DUE problem is the so-called variable tolerance dynamic user equilibrium (VT-BR-DUE) wherein endogenously determined tolerances may depend not only on paths, but also on the established path departure rates. This paper presents a unified approach for modeling both BR-DUE and VT-BR-DUE, which makes significant contributions to the model formulation, analysis of existence, solution characterization, and numerical computation of such problems. The VT-BR-DUE problem, together with the BR-DUE problem as a special case, is formulated as a variational inequality. We provide a very general existence result for VT-BR-DUE and BR-DUE that relies on assumptions weaker than those required for normal DUE models. Moreover, a characterization of the solution set is provided based on rigorous topological analysis. Finally, three computational algorithms with convergence results are proposed based on the VI and DVI formulations. Numerical studies are conducted to assess the proposed algorithms in terms of solution quality, convergence, and computational efficiency