Incorporating the extended theory of planned behavior in a school travel mode choice model: a case study of Shaoxing,China

Travel to and from school can have social, economic, and environmental implications for students and their parents. Therefore, understanding school travel mode choice behavior is essential to find policy-oriented approaches to optimizing school travel mode share. Recent research suggests that psychological factors of parents play a significant role in school travel mode choice behavior and the Multiple Indicators and Multiple Causes (MIMIC) model has been used to test the effect of psychological constructs on mode choice behavior. However, little research has used a systematic framework of behavioral theory to organize these psychological factors and investigate their internal relationships. This paper proposes an extended theory of planned behavior (ETPB) to delve into the psychological factors caused by the effects of adults’ cognition and behavioral habits and explores the factors’ relationship paradigm. A theoretical framework of travel mode choice behavior for students in China is constructed. We established the MIMIC model that accommodates latent variables from ETPB. We found that not all the psychological latent variables have significant effects on school travel mode choice behavior, but habit can play an essential role. The results provide theoretical support for demand policies for school travel.     

Emergence of cooperation in congested road networks using ICT and future and emerging technologies: A game-based review

Information and communications technologies (ICT) and future and emerging technologies (FET) are expected to revolutionize transportation in the next generation. Travelers’ behavioral adaptation is a key to their success. We discuss the notion of managing traffic congestion by enhancing cooperation in road networks enabled with ICT and FET. Cooperation is an emergent social state related to the dynamics and complexity of road traffic and reinforced learning. Game theory and research in behavioral economics show that cooperation can be leveraged to efficiently solve social dilemmas similar to traffic congestion. We review the applicability of behavioral economics and game theory concepts to route, mode and departure time choice problems. Beyond advancing theory, research on cooperation in the context of transportation is still in its infancy. We discuss state-of-the-art methodologies and their weaknesses and review the unexplored opportunities inherent in game-based methodologies. A behavioral-technological research agenda for FET is also discussed.     

基于TBM工法的隧洞工程进度定量分析——以引红济石隧洞工程TBM段为例

文章结合QTBM理论,对引红济石隧洞工程前期的开挖进度数据进行了分析统计,结果表明:该工区TBM在Ⅲ类、Ⅳ类围岩中掘进速率较为稳定,而在V类围岩中掘进速率较低;同时,获得了适合该工区的岩体品质参数以及TBM净掘进速率、平均使用率等相关参数;并据此对该工程TBM待开挖段的工程进度进行预测,预测表明剩余6600m的开挖尚需...     

Real time queue length estimation for signalized intersections using travel times from mobile sensors

We study how to estimate real time queue lengths at signalized intersections using intersection travel times collected from mobile traffic sensors. The estimation is based on the observation that critical pattern changes of intersection travel times or delays, such as the discontinuities (i.e., sudden and dramatic increases in travel times) and non-smoothness (i.e., changes of slopes of travel times), indicate signal timing or queue length changes. By detecting these critical points in intersection travel times or delays, the real time queue length can be re-constructed. We first introduce the concept of Queue Rear No-delay Arrival Time which is related to the non-smoothness of queuing delay patterns and queue length changes. We then show how measured intersection travel times from mobile sensors can be processed to generate sample vehicle queuing delays. Under the uniform arrival assumption, the queuing delays reduce linearly within a cycle. The delay pattern can be estimated by a linear fitting method using sample queuing delays. Queue Rear No-delay Arrival Time can then be obtained from the delay pattern, and be used to estimate the maximum and minimum queue lengths of a cycle, based on which the real-time queue length curve can also be constructed. The model and algorithm are tested in a field experiment and in simulation.     

城市下穿式矩形框架隧道的力学分析

文章基于结构-荷载理论对城市下穿式矩形框架隧道进行结构模型简化,同时利用有限元软件ANSYS对隧道进行了结构力学分析。分析结果表明矩形框架隧道在拐角处受力最不利,需在结构的设计及施工中根据结构截面强度验算进行配筋加厚处理,以保证隧道结构的安全。     

A shockwave profile model for traffic flow on congested urban arterials

In this paper a new traffic flow model for congested arterial networks, named shockwave profile model (SPM), is presented. Taking advantage of the fact that traffic states within a congested link can be simplified as free-flow, saturated, and jammed conditions, SPM simulates traffic dynamics by analytically deriving the trajectories of four major shockwaves: queuing, discharge, departure, and compression waves. Unlike conventional macroscopic models, in which space is often discretized into small cells for numerical solutions, SPM treats each homogeneous road segment with constant capacity as a section; and the queuing dynamics within each section are described by tracing the shockwave fronts. SPM is particularly suitable for simulating traffic flow on congested signalized arterials especially with queue spillover problems, where the steady-state periodic pattern of queue build-up and dissipation process may break down. Depending on when and where spillover occurs along a signalized arterial, a large number of queuing patterns may be possible. Therefore it becomes difficult to apply the conventional approach directly to track shockwave fronts. To overcome this difficulty, a novel approach is proposed as part of the SPM, in which queue spillover is treated as either extending a red phase or creating new smaller cycles, so that the analytical solutions for tracing the shockwave fronts can be easily applied. Since only the essential features of arterial traffic flow, i.e., queue build-up and dissipation, are considered, SPM significantly reduces the computational load and improves the numerical efficiency. We further validated SPM using real-world traffic signal data collected from a major arterial in the Twin Cities. The results clearly demonstrate the effectiveness and accuracy of the model. We expect that in the future this model can be applied in a number of real-time applications such as arterial performance prediction and signal optimization.     

城市交通系统通行性影响因素及计算理论

文章分析了震后城市交通系统通行性的影响因素,提出了包含路段单元通行概率、路段连通概率及路网连通概率的城市交通系统通行性计算理论,为城市路网的连通可靠性评价提供参考。     

Stability and bifurcation in network traffic flow: A Poincaré map approach

Previous studies have shown that, in a diverge-merge network with two intermediate links (the DM network), the kinematic wave model always admits stationary solutions under constant boundary conditions, but periodic oscillations can develop from empty initial conditions. Such contradictory observations suggest that the stationary states be unstable. In this study we develop a systematic approach to investigate the stability property of stationary states in this and other networks within the framework of network kinematic wave theories. Based on the observation that kinematic waves propagate in a circular path when only one of the two intermediate links is congested, we derive a one-dimensional, discrete Poincaré map in the out-flux at a Poincaré section. We then prove that the fixed points of the Poincaré map correspond to stationary flow-rates on the two links. With Lyapunov’s first method, we demonstrate that the Poincaré map can be finite-time stable, asymptotically stable, or unstable. When unstable, the map is found to have periodical points of period two, but no chaotic solutions. We further analyze the bifurcation in the stability of the Poincaré map caused by varying route choice proportions. We apply the Poincaré map approach to analyzing traffic patterns in more general (DM)ⁿ and beltway networks, which are sufficient and necessary structures for network-induced unstable traffic and gridlock, respectively. This study demonstrates that the Poincaré map approach can be efficiently applied to analyze traffic dynamics in any road networks with circular information propagation and provides new insights into unstable traffic dynamics caused by interactions among network bottlenecks.     

Free-floating bike sharing: Solving real-life large-scale static rebalancing problems

Free-floating bike sharing (FFBS) is an innovative bike sharing model. FFBS saves on start-up cost, in comparison to station-based bike sharing (SBBS), by avoiding construction of expensive docking stations and kiosk machines. FFBS prevents bike theft and offers significant opportunities for smart management by tracking bikes in real-time with built-in GPS. However, like SBBS, the success of FFBS depends on the efficiency of its rebalancing operations to serve the maximal demand as possible.Bicycle rebalancing refers to the reestablishment of the number of bikes at sites to desired quantities by using a fleet of vehicles transporting the bicycles. Static rebalancing for SBBS is a challenging combinatorial optimization problem. FFBS takes it a step further, with an increase in the scale of the problem. This article is the first effort in a series of studies of FFBS planning and management, tackling static rebalancing with single and multiple vehicles. We present a Novel Mixed Integer Linear Program for solving the Static Complete Rebalancing Problem. The proposed formulation, can not only handle single as well as multiple vehicles, but also allows for multiple visits to a node by the same vehicle. We present a hybrid nested large neighborhood search with variable neighborhood descent algorithm, which is both effective and efficient in solving static complete rebalancing problems for large-scale bike sharing programs.Computational experiments were carried out on the 1 Commodity Pickup and Delivery Traveling Salesman Problem (1-PDTSP) instances used previously in the literature and on three new sets of instances, two (one real-life and one general) based on Share-A-Bull Bikes (SABB) FFBS program recently launched at the Tampa campus of University of South Florida and the other based on Divvy SBBS in Chicago. Computational experiments on the 1-PDTSP instances demonstrate that the proposed algorithm outperforms a tabu search algorithm and is highly competitive with exact algorithms previously reported in the literature for solving static rebalancing problems in SBSS. Computational experiments on the SABB and Divvy instances, demonstrate that the proposed algorithm is able to deal with the increase in scale of the static rebalancing problem pertaining to both FFBS and SBBS, while deriving high-quality solutions in a reasonable amount of CPU time.     

Closed-form multiclass cell transmission model enhanced with overtaking,lane-changing,and first-in first-out properties

A novel multiclass macroscopic model is proposed in this article. In order to enhance first-in, first-out property (FIFO) and transmission function in the multiclass traffic modeling, a new multiclass cell transmission model with FIFO property (herein called FM-CTM) is extended from its prior multiclass cell transmission model (M-CTM). Also, to enhance its analytical compactness and resultant computational convenience, FM-CTM is formulated in this paper as a set of closed-form matrix equations. The objective is to improve the accuracy of traffic state estimation by enforcing FIFO property when a fast vehicle cannot overtake a slow vehicle due to a limitation of a single-lane road. Moreover, the proposed model takes into account a different priority for vehicles of each class to move forward through congested road conditions, and that makes the flow calculation independent from their free-flow speeds. Some hypothetical and real-world freeway networks with a constant or varying number of lanes are selected to verify FM-CTM by comparing with M-CTM and the conventional CTM. Observed densities of VISSIM and real-world dataset of I-80 are selected to compare with the simulated densities from the three CTMs. The numerical results show that FM-CTM outperforms the other two models by 15% of accuracy measures in most cases. Therefore, the proposed model is expected to be well applicable to the road network with a mixed traffic and varying number of lanes.