超大跨度斜拉桥施工过程力学行为

斜拉桥结构效应在施工过程中具有典型的时空变化特性，但目前对效应的时程特性及时空包络关注较少。建立精细的几何非线性分析模型，分析主跨1088m的苏通大桥施工过程力学行为，包括施工阶段效应增量、效应时程、效应包络及恒载效应。研究结果有助于结构设计和施工控制。     

大直径钢管桩承载力恢复过程试验研究

针对目前预制桩承载力恢复特性研究与工程应用中的不足,依托西非某海工工程,提出高应变法。采用对同一钢管桩进行初打与不同休止时间复打相结合的试验方法,研究了大直径钢管桩沉桩后的承载力恢复过程。结合地质情况、沉桩与试验结果,得到了钢管桩承载力、侧阻力及端阻力随时间变化的一般规律及影响因素,并通过静载试验对研究结果进行了验证。该研究在提高项目施工效率、降低成本的同时,还得到了有意义的规律与结论,可为后续类似项目提供参考。     

Consumer preferences and willingness to pay for advanced vehicle technology options and fuel types

The automotive industry is witnessing a revolution with the advent of advanced vehicular technologies, smart vehicle options, and fuel alternatives. However, there is very limited research on consumer preferences for such advanced vehicular technologies. The deployment and penetration of advanced vehicular technologies in the marketplace, and planning for possible market adoption scenarios, calls for the collection and analysis of consumer preference data related to these emerging technologies. This study aims to address this need, offering a detailed analysis of consumer preference for alternative fuel types and technology options using data collected in stated choice experiments conducted on a sample of consumers from six metropolitan cities in South Korea. The results indicate that there is considerable heterogeneity in consumer preferences for various smart technology options such as wireless internet, vehicle connectivity, and voice command features, but relatively less heterogeneity in the preference for smart vehicle applications such as real-time traveler information on parking and traffic conditions.     

Modeling duration choice in space–time multi-state supernetworks for individual activity-travel scheduling

Multi-state supernetworks have been advanced recently for modeling individual activity-travel scheduling decisions. The main advantage is that multi-dimensional choice facets are modeled simultaneously within an integral framework, supporting systematic assessments of a large spectrum of policies and emerging modalities. However, duration choice of activities and home-stay has not been incorporated in this formalism yet. This study models duration choice in the state-of-the-art multi-state supernetworks. An activity link with flexible duration is transformed into a time-expanded bipartite network; a home location is transformed into multiple time-expanded locations. Along with these extensions, multi-state supernetworks can also be coherently expanded in space–time. The derived properties are that any path through a space–time supernetwork still represents a consistent activity-travel pattern, duration choice are explicitly associated with activity timing, duration and chain, and home-based tours are generated endogenously. A forward recursive formulation is proposed to find the optimal patterns with the optimal worst-case run-time complexity. Consequently, the trade-off between travel and time allocation to activities and home-stay can be systematically captured.     

Dynamic stride length adaptation according to utility and personal space

Pedestrians adjust both speed and stride length when they navigate difficult situations such as tight corners or dense crowds. They try to avoid collisions and to preserve their personal space. State-of-the-art pedestrian motion models automatically reduce speed in dense crowds simply because there is no space where the pedestrians could go. The stride length and its correct adaptation, however, are rarely considered. This leads to artefacts that impact macroscopic observation parameters such as densities in front of bottlenecks and, through this, flow. Hence modelling stride adaptation is important to increase the predictive power of pedestrian models. To achieve this we reformulate the problem as an optimisation problem on a disk around the pedestrian. Each pedestrian seeks the position that is most attractive in a sense of balanced goals between the search for targets, the need for individual space and the need to keep a distance from obstacles. The need for space is modelled according to findings from psychology defining zones around a person that, when invaded, cause unease. The result is a fully automatic adjustment that allows calibration through meaningful social parameters and that gives visually natural results with an excellent fit to measured experimental data.     

Autonomous cars: The tension between occupant experience and intersection capacity

Systems that enable high levels of vehicle-automation are now beginning to enter the commercial marketplace. Road vehicles capable of operating independently of real-time human control under an increasing set of circumstances will likely become more widely available in the near future. Such vehicles are expected to bring a variety of benefits. Two such anticipated advantages (relative to human-driver vehicle control) are said to be increased road network capacity and the freeing up of the driver-occupant’s time to engage in their choice of leisurely or economically-productive (non-driving) tasks.In this study we investigate the implications for intersection capacity and level-of-service of providing occupants of automated (without real-time human control), autonomously-operating (without vehicle-to-X communication) cars with ride quality that is equivalent (in terms of maximum rates of longitudinal and lateral acceleration) to two types of rail systems: [urban] light rail transit and [inter-urban] high-speed rail. The literature suggests that car passengers start experiencing discomfort at lower rates of acceleration than car drivers; it is therefore plausible that occupants of an autonomously-operating vehicle may wish to instruct their vehicle to maneuver in a way that provides them greater ride comfort than if the vehicle-control algorithm simply mimicked human-driving-operation.On the basis of traffic microsimulation analysis, we found that restricting the dynamics of autonomous cars to the acceleration/deceleration characteristics of both rail systems leads to reductions in a signalized intersection’s vehicle-processing capacity and increases in delay. The impacts were found to be larger when constraining the autonomous cars’ dynamics to the more-restrictive acceleration/deceleration profile of high-speed rail. The scenarios we analyzed must be viewed as boundary conditions, because autonomous cars’ dynamics were by definition never allowed to exceed the acceleration/deceleration constraints of the rail systems. Appropriate evidence regarding motorists’ preferences does not exist at present; establishing these preferences is an important item for the future research agenda.This paper concludes with a brief discussion of research needs to advance this line of inquiry.     

Travel time estimation from sparse floating car data with consistent path inference: A fixed point approach

Estimation of urban network link travel times from sparse floating car data (FCD) usually needs pre-processing, mainly map-matching and path inference for finding the most likely vehicle paths that are consistent with reported locations. Path inference requires a priori assumptions about link travel times; using unrealistic initial link travel times can bias the travel time estimation and subsequent identification of shortest paths. Thus, the combination of path inference and travel time estimation is a joint problem. This paper investigates the sensitivity of estimated travel times, and proposes a fixed point formulation of the simultaneous path inference and travel time estimation problem. The methodology is applied in a case study to estimate travel times from taxi FCD in Stockholm, Sweden. The results show that standard fixed point iterations converge quickly to a solution where input and output travel times are consistent. The solution is robust under different initial travel times assumptions and data sizes. Validation against actual path travel time measurements from the Google API and an instrumented vehicle deployed for this purpose shows that the fixed point algorithm improves shortest path finding. The results highlight the importance of the joint solution of the path inference and travel time estimation problem, in particular for accurate path finding and route optimization.     

Mental models of driving and speed: biases,choices and reality

This paper provides a review of research performed by Svenson with colleagues and others work on mental models and their practical implications. Mental models describe how people perceive and think about the world including covariances and relationships between different variables, such as driving speed and time. Research on mental models has detected the time-saving bias [Svenson, O. (1970). A functional measurement approach to intuitive estimation as exemplified by estimated time savings. Journal of Experimental Psychology, 86, 204–210]. It means that drivers relatively overestimate the time that can be saved by increasing speed from an already high speed, for example, 90–130?km/h, and underestimate the time that can be saved by increasing speed from a low speed, for example, 30–45?km/h. In congruence with this finding, mean speed judgments and perceptions of mean speeds are also biased and higher speeds given too much weight and low speeds too little weight in comparison with objective reality. Replacing or adding a new speedometer in the car showing min per km eliminated or weakened the time-saving bias. Information about braking distances at different speeds did not improve overoptimistic judgments of braking capacity, but information about collision speed with an object suddenly appearing on the road did improve judgments of braking capacity. This is relevant to drivers, politicians and traffic regulators.     

A copula-based approach for estimating the travel time reliability of urban arterial

Estimating the travel time reliability (TTR) of urban arterial is critical for real-time and reliable route guidance and provides theoretical bases and technical support for sophisticated traffic management and control. The state-of-art procedures for arterial TTR estimation usually assume that path travel time follows a certain distribution, with less consideration about segment correlations. However, the conventional approach is usually unrealistic because an important feature of urban arterial is the dependent structure of travel times on continuous segments. In this study, a copula-based approach that incorporates the stochastic characteristics of segments travel time is proposed to model arterial travel time distribution (TTD), which serves as a basis for TTR quantification. First, segments correlation is empirically analyzed and different types of copula models are examined. Then, fitting marginal distributions for segment TTD is conducted by parametric and non-parametric regression analysis, respectively. Based on the estimated parameters of the models, the best-fitting copula is determined in terms of the goodness-of-fit tests. Last, the model is examined at two study sites with AVI data and NGSIM trajectory data, respectively. The results of path TTD estimation demonstrate the advantage of the proposed copula-based approach, compared with the convolution model without capturing segments correlation and the empirical distribution fitting methods. Furthermore, when considering the segments correlation effect, it was found that the estimated path TTR is more accurate than that by the convolution model.     

An optimal data-splitting algorithm for aircraft scheduling on a single runway to maximize throughput

In this research, we present a data-splitting algorithm to optimally solve the aircraft sequencing problem (ASP) on a single runway under both segregated and mixed-mode of operation. This problem is formulated as a 0–1 mixed-integer program (MIP), taking into account several realistic constraints, including safety separation standards, wide time-windows, and constrained position shifting, with the objective of maximizing the total throughput. Varied scenarios of large scale realistic instances of this problem, which is NP-hard in general, are computationally difficult to solve with the direct use of commercial solver as well as existing state-of-the-art dynamic programming method. The design of the algorithm is based on a recently introduced data-splitting algorithm which uses the divide-and-conquer paradigm, wherein the given set of flights is divided into several disjoint subsets, each of which is optimized using 0–1 MIP while ensuring the optimality of the entire set. Computational results show that the difficult instances can be solved in real-time and the solution is efficient in comparison to the commercial solver and dynamic programming, using both sequential, as well as parallel, implementation of this pleasingly parallel algorithm.