Route swapping in dynamic traffic networks

A dynamic traffic assignment (DTA) model typically consists of a traffic performance model and a route choice model. The traffic performance model describes how traffic propagates (over time) along routes connecting origin-destination (OD) pairs, examples being the cell transmission model, the vertical queueing model and the travel time model. This is implemented in a dynamic network loading (DNL) algorithm, which uses the given route inflows to compute the link inflows (and hence link costs), which are then used to compute the route travel times (and hence route costs). A route swap process specifies the route inflows for tomorrow (at the next iteration) based on the route inflows today (at the current iteration). A dynamic user equilibrium (DUE), where each traveller on the network cannot reduce his or her cost of travel by switching to another route, can be sought by iterating between the DNL algorithm and the route swap process. The route swap process itself takes up very little computational time (although route set generation can be very computationally intensive for large networks). However, the choice of route swap process dramatically affects convergence and the speed of convergence. The paper details several route swap processes and considers whether they lead to a convergent system, assuming that the route cost vector is a monotone function of the route inflow vector.     

Dynamic user equilibrium with side constraints for a traffic network: Theoretical development and numerical solution algorithm

This paper investigates a traffic volume control scheme for a dynamic traffic network model which aims to ensure that traffic volumes on specified links do not exceed preferred levels. The problem is formulated as a dynamic user equilibrium problem with side constraints (DUE-SC) in which the side constraints represent the restrictions on the traffic volumes. Travelers choose their departure times and routes to minimize their generalized travel costs, which include early/late arrival penalties. An infinite-dimensional variational inequality (VI) is formulated to model the DUE-SC. Based on this VI formulation, we establish an existence result for the DUE-SC by showing that the VI admits at least one solution. To analyze the necessary condition for the DUE-SC, we restate the VI as an equivalent optimal control problem. The Lagrange multipliers associated with the side constraints as derived from the optimality condition of the DUE-SC provide the traffic volume control scheme. The control scheme can be interpreted as additional travel delays (either tolls or access delays) imposed upon drivers for using the controlled links. This additional delay term derived from the Lagrange multiplier is compared with its counterpart in a static user equilibrium assignment model. If the side constraint is chosen as the storage capacity of a link, the additional delay can be viewed as the effort needed to prevent the link from spillback. Under this circumstance, it is found that the flow is incompressible when the link traffic volume is equal to its storage capacity. An algorithm based on Euler’s discretization scheme and nonlinear programming is proposed to solve the DUE-SC. Numerical examples are presented to illustrate the mechanism of the proposed traffic volume control scheme.     

Dynamic bus holding strategies for schedule reliability: Optimal linear control and performance analysis

As is well known, bus systems are naturally unstable. Without control, buses on a single line tend to bunch, reducing their punctuality in meeting a schedule. Although conventional schedule-based strategies that hold buses at control points can alleviate this problem these methods require too much slack, which slows buses. This delays on-board passengers and increases operating costs.It is shown that dynamic holding strategies based on headways alone cannot help buses adhere to a schedule. Therefore, a family of dynamic holding strategies that use bus arrival deviations from a virtual schedule at the control points is proposed. The virtual schedule is introduced whether the system is run with a published schedule or not. It is shown that with this approach, buses can both closely adhere to a published schedule and maintain regular headways without too much slack.A one-parameter version of the method can be optimized in closed form. This simple method is shown to be near-optimal. To put it in practice, the only data needed in real time are the arrival times of the current bus and the preceding bus at the control point relative to the virtual schedule. The simple method was found to require about 40% less slack than the conventional schedule-based method. When used only to regulate headways it outperforms headway-based methods.     

A methodology to estimate travel time using dynamic traffic assignment (DTA) under incident conditions

This paper presents results from a research case study that examined the distribution of travel time of origin–destination (OD) pairs on a transportation network under incident conditions. Using a transportation simulation dynamic traffic assignment (DTA) model, incident on a transportation network is executed under normal conditions, incident conditions without traveler information availability, and incident conditions assuming that users had perfect knowledge of the incident conditions and could select paths to avoid the incident location. The results suggest that incidents have a different impact on different OD pairs. The results confirm that an effective traveler information system has the potential to ease the impacts of incident conditions network wide. Yet it is also important to note that the use of information may detriment some OD pairs while benefiting other OD pairs. The methodology demonstrated in this paper provides insights into the usefulness of embedding a fully calibrated DTA model into the analysis tools of a traffic management and information center.     

The effects of social networks on choice set dynamics: Results of numerical simulations using an agent-based approach

Activity-based analysis has slowly shifted gear from the analysis of daily activity patterns to the analysis and modeling of dynamic activity-travel patterns. In this paper, we address one type of dynamics: the formation and adaptation of location choice sets under influence of dyad relationships within social networks. It extends the dynamic model developed in earlier work, which simulates habitual behavior versus exploitation and exploration as a function of discrepancies between dynamic, context-dependent aspiration levels and expected outcomes. Principles of social comparison and knowledge transfer are used in modeling the impact of social networks through information exchange, adaptations of spatial choice sets and formation of common aspiration levels. We demonstrate model properties using numerical simulation with a case study of shopping activities.     

爆破地震波作用下隧道衬砌结构动力响应研究

以地表爆破为振动源,通过控制不同的炸药量和爆心距来模拟不同强度的地震波,并利用工程地震仪实测振动源附近的隧道衬砌结构的动力响应,通过滤波和分离处理得到代表性的速度时程曲线;通过建立数值模型并加载监测到的速度时程曲线,以此来模拟爆破地震波对隧道衬砌不同断面不同部位的动力作用,并来探讨爆破地震对邻近隧道的影响范围和作用方式。     

软土地基处理方案的选择及强夯置换的应用

针对具体工程实例分析了挖除换填、排水固结法、水泥搅拌桩法、碎石桩、CFG桩、强夯置换法等软土地基处理方法的适用性及优缺点,从而确定采用强夯置换法作为本项目的处理方案,并对强夯置换的置换参数、试夯、质量检验等进行了详细设计,得出了在软土地基处理中应重视方案比选及强夯置换法是处理浅层软土的一种行之有效的方法等结论。     

强夯碎石桩在辽开高速公路应用效果分析

结合工程实例,总结了强夯碎石桩处理软土地基的成功经验及施工中应注意的问题。     

浅谈南宁市白沙大桥下引桥动载试验

对南宁市白沙大桥北岸引桥的动载试验结果进行了分析,对桥梁进行了整体的综合评价。     

Understanding ship-grounding events

The paper presents a simple procedure to estimate the damage to a ship bottom and the associated seabed topology that results from a dynamic grounding event. The seabed is modeled as a rigid body and parameterized by a quadratic surface, i.e., a paraboloid, which can in principle model a wide range of seabed topologies. A nonlinear finite element program (LS-DYNA) is used to simulate the contact force versus the lateral penetration, from which the horizontal force component of powered grounding is estimated. The simplified procedure for analyzing dynamic and static grounding events is outlined. Simulations are performed for different ship speeds and for different initial levels of obstruction over the keel. It is shown that a static approach may replace the dynamic grounding simulation, thereby considerably reducing the computational work. The static approach allows for the quick estimation of the energy absorption during powered grounding, which is imperative for decision making during critical situations. The ultimate goal of the study is to provide a near real-time prediction of the risk of rupture of the cargo tanks and hull girder failure. Moreover, the residual strength of damaged ships is an important issue that is related to operations involved in the salvage of wrecked vessels, such as re-floatation and towing.