Impact of environmental assessment and budgetary restrictions in pavement maintenance decisions: Application to an urban network

Road agencies are facing the challenges of aging pavements, deteriorating networks, and insufficient maintenance budgets. This study addresses two limitations in the current state of practice in pavement management. First, because the evaluation of maintenance strategies has traditionally focused on economic and technical aspects, it neglects the environmental impact of maintenance decisions. Second, current management systems often provide a unique, optimised pavement maintenance strategy based on a specific objective(s) and constraint(s). The main objective of the study is to analyse the effect of including environmental aspects and funding availability in the design of maintenance strategies. To achieve this objective, the study followed a three-step methodology. First, this study reviews existing practices on pavement maintenance and the criteria considered to trigger the application of maintenance treatments and their effects on pavement condition. Then, maintenance strategies are optimised considering three levels of budgetary capacity and a sustainable evaluation which incorporates technical, economic, and environmental aspects over the pavement lifecycle. Finally, a case study dealing with an urban pavement network in Chile is analysed. Results obtained from this case study show that an increment of 2% in maintenance budget allows to account for more sustainable maintenance decisions, such as cold in-place recycling and full-depth slab repair, whose greenhouse gas emissions are lower than other alternatives. Results also show that functional asphalt overlay and microsurfacing are more recommended in flexible pavements when budgetary restrictions are low, whereas recommended treatments for rigid pavements exhibit small variability with budgetary restrictions.     

基于模糊时序网络的城市路网关键交叉口识别方法

在城市路网拓扑结构和动力学过程的基础上，增加对其时序特性的考虑，提出适用于城市路网关键交叉口识别的模糊时序网络模型。首先，阐述一般时序网络的描述方法和超邻接矩阵时序网络模型的原理，分析其优势以及将其用于城市路网分析的局限性；然后，提出优化措施，一 方面结合交通网络的功能特性，以动态交通参数构造单个时间步网络的层内交叉口交互强度模糊指标，另一方面借鉴并改进邻居拓扑重叠系数，对其进行模糊化处理，实现两相邻时间步网络层间交叉口关联强度的差异化表达；之后，在改进时间步层内、层间关联描述矩阵基础上，搭建模糊超邻接矩阵(Fuzzy Supra-adjacency Matrix, FSAM)时序网络模型(FSAM模型)；最后，以某城市核心区域147个交叉口构成的路网数据验证模型有效性。结果表明：以时序网络模型分析交叉口重要性非常必要，以中位数表达交叉口在时段内的重要性排序更为可靠；FSAM模型对交叉口重要性的排名时间序列有阶段持续性特征，且相比于特定时间步下基于单一指标的关键交叉口识 别结果具有更丰富的内涵；不同时间颗粒度下，FSAM模型对交叉口重要性排序的一致性较好，结果较为稳定。综上，该模型可供城市路网关键交叉口识别之用。     

Adaptive scheduling for real-time and temporal information services in vehicular networks

Vehicular networks represent a research area of significant importance in improving the safety, efficiency and sustainability of transportation systems. One of the key research problems in vehicular networks is real-time data dissemination, which is crucial to the satisfactory performance of many emergent applications providing real-time information services in vehicular networks. Specifically, the two issues need to be addressed in this problem are maintenance of temporal data freshness and timely dissemination of data. Most existing works only considered periodical data update via backbone wired networks in maintaining temporal data freshness. However, many applications rely on passing vehicles to upload their collected information via wireless network, which imposes new challenges as the uplink data update will have to compete with the downlink data dissemination for the limited wireless bandwidth. With such observations, we propose a temporal information service system, in which vehicles are able to collect up-to-date temporal information and upload them to the roadside units (RSU) along their trajectories. Meanwhile, RSU can disseminate its available data items to vehicles based on their specific requests. Particularly, in this paper, we first quantitatively analyze the freshness of temporal data and propose a mathematical model to evaluate the usefulness of the temporal data. Next, we give the formulation of the proposed real-time and temporal information service (RTIS) problem, and prove the NP-hardness of this problem by constructing a polynomial-time reduction from 0–1 knapsack problem. Subsequently, we establish a probabilistic model to theoretically analyze the tradeoff between timely temporal data update and requested data dissemination sharing a common communication resource, which provides a deeper insight of the proposed RTIS. Further, a heuristic algorithm, namely adaptive update request scheduling (AURS), is designed to enhance the efficacy of RTIS by synthesizing the broadcast effect, the real-time service requirement and the service quality in making scheduling decisions. The computational complexity and scalability analysis of AURS is also discussed. Last but not least, a simulation model is implemented and a comprehensive performance evaluation has been carried out to demonstrate the superiority of ARUS against several state-of-the-art approaches in a variety of application scenarios.     

Optimal competitive freight network design as hierarchical variational inequalities programming problems

Freight networks are a case of systems that multiple participants are composing interrelations along the complete supply chain. Their interrelations correspond to alternative behavior, namely, cooperation, non-cooperation and competition, while they are large-scale spatially distributed systems combining multiple means of transportation and the infrastructure and equipment typically utilized for servicing demand, results to a complex system integration. In this paper, the case of the optimal design of freight networks is investigated, aiming to highlight the particularities emerging in this case of transportation facilities strategic and/or operational planning and the multiple game-theoretic and equilibrium problems that are structured in cascade and in hierarchies. The application that is investigated here focuses in the design of a significant ‘player’ of the freight supply chain, namely container terminals, while the proposed framework will aim on analyzing investment strategies built on integrated demand–supply models and the optimal network design format. The approach will build on the multilevel Mathematical Programming with Equilibrium Constraints (MPECs) formulation, but is further extended to cope with the properties introduced by the ‘designers’ (infrastructure authorities), shippers and carriers competition in all levels of MPECs. Since container terminals are typically competing each other, the nomenclature used here for formulating appropriate MPECs problems are based on hierarchies of Variational Inequalities (VI) problems, able to capture the alternative relationships emerging in realistic freight supply chains. The proposed formulations of the competitive network design case is addressed by a novel approach of co-evolutionary agents, which can be regarded as new in equilibrium estimation. Finally, the results are compared with alternative network design cases, namely the centralized cooperative and exchanging design. Under this analysis it is able to highlight the differences among alternative design cases, but moreover an estimation of the ‘price of anarchy’ in transportation systems design is offered, an element of both theoretical as well as practical relevance.     

基于改进OLS算法的RBF神经网络 高速公路事件探测

提出了一种基于模糊聚类技术和RBF神经网络的混合智能高速公路事件自动探测算法,同时改进了用于RBF神经网络训练的Oils(正交最小二乘)选择算法.仿真实验证明,改进的OLS选择算法大大提高了RBF神经网络的训练速度同时具有无须事先确定RBF中心的优点,将之运用于公路事件探测可以获得满意的性能.     

Changes in the design and operational wind due to climate change at the Indian offshore sites

The increasing global warming is most likely to affect the magnitude and pattern of wind at a regional level and such an effect may or not follow the trend predicted at the global scale. Regional level exercises are therefore necessary while making decisions related to engineering infrastructure. In this paper an attempt is made to know the extent of change in design as well as operational wind conditions at two offshore locations along the west coast of India. The design wind speeds with return periods of 10, 50 and 100 years derived for two 30-year time slices in the past and future are compared. In two separate exercises the past and future wind at the local level is simulated by empirical downscaling as well as by interpolation of the general circulation model (GCM) output. Both sets of past and future data are fitted to the Generalized Pareto as well as Weibull distributions using the peak over threshold method to extract long term wind speeds with a specified return. It is noticed that at the given locations the operational and design wind may undergo an increase of around 11%–14% when no downscaling is adopted and 14%–17% when the GCM data are downscaled. Although these figures may suffer from a certain level of statistical uncertainty the study points out to take a relook into the safety margins kept in the design and operation of ocean structures in the light of global warming.     

Vulnerability and resilience of transport systems – A discussion of recent research

The transport system is critical to the welfare of modern societies. This article provides an overview of recent research on vulnerability and resilience of transport systems. Definitions of vulnerability and resilience are formulated and discussed together with related concepts. In the increasing and extensive literature of transport vulnerability studies, two distinct traditions are identified. One tradition with roots in graph theory studies the vulnerability of transport networks based on their topological properties. The other tradition also represents the demand and supply side of the transport systems to allow for a more complete assessment of the consequences of disruptions or disasters for the users and society. The merits and drawbacks of the approaches are discussed. The concept of resilience offers a broader socio-technical perspective on the transport system’s capacity to maintain or quickly recover its function after a disruption or a disaster. The transport resilience literature is less abundant, especially concerning the post-disaster phases of response and recovery. The research on transport system vulnerability and resilience is now a mature field with a developed methodology and a large amount of research findings with large potential practical usefulness. The authors argue that more cross-disciplinary collaborations between authorities, operators and researchers would be desirable to transform this knowledge into practical strategies to strengthen the resilience of the transport system.     

A method to estimate trip O‐D patterns using a neural network approach

This paper proposes a method which identifies the trip origin‐destination (O‐D) matrix when many pairs of values for the right hand side column (B) and the bottom row (A) of the matrix are given. The method considers B and A as the cause (input) and effect (output) of a system, respectively, and that the O‐D matrix represents the relationship between the cause and the effect. The relationship which satisfies all pairs of the cause and the effect data exactly may not be identified, but, should a general pattern of the relationship exist, it should emerge when many data sets of B and A are given. Two steps are involved in the method: the first step examines if a consistent O‐D pattern exists; if a pattern is found to exist, the second step identifies the values of the elements of the O‐D matrix. The first step is based on the shape of the possibility distributions of the values of the matrix elements. The second step uses a simple back‐propagation neural network. The method is useful to problems that require identification of the cause‐effect relationship when many sets of data for the cause and effect are available, for example, the station‐to‐station travel pattern on a rapid transit line when the total entering and exiting passengers are known at each station for many different days. The model can also be applied to other transportation problems which involve input and output relation.