Geometric design safety estimation based on tire–road side friction

A closed-loop drive–vehicle–road–environment system (DVRES) model was established using Adams/Car and Matlab/Simulink. Dynamic responses of lateral tire forces based on tire–road side friction and road geometric characteristics are used to investigate vehicle side slip for geometric design safety estimation. The root mean square, the maximum values of lateral tire forces, comfort limit on curves and vehicle trajectories are used to quantify the safety margin of side friction. The simulation results show that the safety margins of lateral tire forces for radius, operating speed and superelevation rate were 18.2%, 19.3% and 17.6%, respectively, to guarantee good vehicle lateral reliability and ride comfort, while lower speeds are optimal in wet and slippery roads. Finally, a case study was conducted to illustrate the analysis of road design safety, and on-site experiment testing further validated the accuracy and reliability of the closed-loop DVRES model.     

贝雷架钢桥的静动力荷载试验研究

文章结合工程实例,通过对贝雷梁桥梁静动力荷载试验,指出贝雷架钢桥连接部分存在联系不够紧密、桥梁横向分配性较差、桥面的振动感觉明显及钢梁易锈蚀等问题。提出了改善贝雷架钢桥结构的力学性能和使用状况,加强结构的定期检查及监测等相关建议。     

A frequency-based maritime container assignment model

This paper transfers the classic frequency-based transit assignment method of Spiess and Florian to containers demonstrating its promise as the basis for a global maritime container assignment model. In this model, containers are carried by shipping lines operating strings (or port rotations) with given service frequencies. An origin–destination matrix of full containers is assigned to these strings to minimize sailing time plus container dwell time at the origin port and any intermediate transhipment ports. This necessitated two significant model extensions. The first involves the repositioning of empty containers so that a net outflow of full containers from any port is balanced by a net inflow of empty containers, and vice versa. As with full containers, empty containers are repositioned to minimize the sum of sailing and dwell time, with a facility to discount the dwell time of empty containers in recognition of the absence of inventory. The second involves the inclusion of an upper limit to the maximum number of container moves per unit time at any port. The dual variable for this constraint provides a shadow price, or surcharge, for loading or unloading a container at a congested port. Insight into the interpretation of the dual variables is given by proposition and proof. Model behaviour is illustrated by a simple numerical example. The paper concludes by considering the next steps toward realising a container assignment model that can, amongst other things, support the assessment of supply chain vulnerability to maritime disruptions.     

The price of uncertainty in pavement infrastructure management planning: An integer programming approach

Currently there is a true dichotomy in the pavement maintenance and rehabilitation (M&R) literature. On the one hand, there are integer programming-based models that assume that parameters are deterministically known. On the other extreme, there are stochastic models, with the most popular class being based on the theory of Markov decision processes that are able to account for various sources of uncertainties observed in the real-world. In this paper, we present an integer programming-based alternative to account for these uncertainties. A critical feature of the proposed models is that they provide – a priori – probabilistic guarantees that the prescribed M&R decisions would result in pavement condition scores that are above their critical service levels, using minimal assumptions regarding the sources of uncertainty. By construction of the models, we can easily determine the additional budget requirements when additional sources of uncertainty are considered, starting from a fully deterministic model. We have coined this additional budget requirement the price of uncertainty to distinguish from previous related work where additional budget requirements were studied due to parameter uncertainties in stochastic models. A numerical case study presents valuable insights into the price of uncertainty and shows that it can be large.     

Compromising system and user interests in shelter location and evacuation planning

Traffic management during an evacuation and the decision of where to locate the shelters are of critical importance to the performance of an evacuation plan. From the evacuation management authority’s point of view, the desirable goal is to minimize the total evacuation time by computing a system optimum (SO). However, evacuees may not be willing to take long routes enforced on them by a SO solution; but they may consent to taking routes with lengths not longer than the shortest path to the nearest shelter site by more than a tolerable factor. We develop a model that optimally locates shelters and assigns evacuees to the nearest shelter sites by assigning them to shortest paths, shortest and nearest with a given degree of tolerance, so that the total evacuation time is minimized. As the travel time on a road segment is often modeled as a nonlinear function of the flow on the segment, the resulting model is a nonlinear mixed integer programming model. We develop a solution method that can handle practical size problems using second order cone programming techniques. Using our model, we investigate the importance of the number and locations of shelter sites and the trade-off between efficiency and fairness.     

水平地震作用下土工格栅填土边坡动力研究

文章基于三维拉格朗日有限差分的原理,用拟静力法和动力法来分析土工格栅填土边坡的动力特性和抗震性能。研究结果表明土工格栅能很好地提高填土体的强度和抗震性能;动力法计算结果比拟静立法计算结果更为安全,且只有动力法才能分析出填土边坡失稳的主因。     

Tradable network permits: A new scheme for the most efficient use of network capacity

Akamatsu et al. (2006) proposed a new transportation demand management scheme called “tradable bottleneck permits” (TBP), and proved its efficiency properties for a single bottleneck model. This paper explores the properties of a TBP system for general networks. An equilibrium model is first constructed to describe the states under the TBP system with a single OD pair. It is proved that equilibrium resource allocation is efficient in the sense that the total transportation cost in a network is minimized. It is also shown that the “self-financing principle” holds for the TBP system. Furthermore, theoretical relationships between TBP and congestion pricing (CP) are discussed. It is demonstrated that TBP has definite advantages over CP when demand information is not perfect, whereas both TBP and CP are equivalent for the perfect information case. Finally, it is shown that the efficiency result also holds for more general demand conditions.     

Who you are is how you travel: A framework for transportation mode detection using individual and environmental characteristics

With the increasing prevalence of geo-enabled mobile phone applications, researchers can collect mobility data at a relatively high spatial and temporal resolution. Such data, however, lack semantic information such as the interaction of individuals with the transportation modes available. On the other hand, traditional mobility surveys provide detailed snapshots of the relation between socio-demographic characteristics and choice of transportation modes. Transportation mode detection is currently approached using features such as speed, acceleration and direction either on their own or in combination with GIS data. Combining such information with socio-demographic characteristics of travellers has the potential of offering a richer modelling framework that could facilitate better transportation mode detection using variables such as age and disability. In this paper, we explore the possibility to include both elements of the environment and individual characteristics of travellers in the task of transportation mode detection. Using dynamic Bayesian Networks, we model the transition matrix to account for such auxiliary data by using an informative Dirichlet prior constructed using data from traditional mobility surveys. Results have shown that it is possible to achieve comparable accuracy with the most widely used classification algorithms while having a rich modelling framework, even in the case of sparse mobility data.     

基于时空网络的铁路空车调配动态优化模型

为合理配置空车资源,研究了路局（公司）管内空车调配的动态优化问题。构建区分时段长度的时空网络,以准确描述车站作业能力的变化。借鉴运输问题（TP）的基本思想,通过引入空车供需约束,将动态空车调配问题转化为基于时空网络的多商品网络流问题。结合空车调配的特点,设置2组整数决策变量,将分界站排空与局（公司）管内配空分开考虑。设置0-1辅助变量构建车种代用约束。在此基础上,以总费用最小为目标,构建了空车调配动态优化的混合整数规划模型。以中国铁路昆明局集团有限公司管内空车调配为例,验证了模型的可行性与有效性。算例结果表明,与静态空车调配方法相比,构建的动态空车调配模型不仅降低了空车调配总成本,而且调配方案更加贴合实际。与现有动态空车调配方法相比,通过改变时空网络中时段的划分方式,降低了模型求解的复杂度,构建的模型在获取空车调配方案的同时能够更加直观的看出空车在不同时间的作业状态。