公路工程的水土保持生态补偿

就公路工程中所遇到的环境问题,结合设计施工中的解决办法,阐述公路工程的水土保持生态补偿,从而减小因道路施工给沿线自然地形、地貌造成的各种破坏,保护和改善当地环境,提高公路的使用效果,更好地发挥公路的各项功能。     

新时期航海类专业学生教育与管理的探讨

航海类专业学生教育与管理的成效，关系到我国航海事业的发展．对航海职业特点和新时期航海类专业学生的特点进行了分析，提出了航海类专业学生教育与管理的目标，同时就目标的实现途径和保证方面进行了探讨．     

基于物元分析法的公路桥梁损伤等级评定研究

在构建桥梁损伤等级评定指标体系的基础上，采用 AHP确定了各指标的权重，运用物元分析的方法建立了桥梁损伤等级评定的数学模型，并利用模型评定结果，得到了某桥梁的损伤等级。     

混凝土在路桥桩基施工中的作用及技术

路桥桩基混凝土施工中，为了保障灌注桩混凝土的质量，必须加强对准备工作及施工工艺的重视。通过对混凝土及其施工质量要求进行分析，探讨了混凝土在路桥桩基施工中的配合比、泵送等，并阐述了路桥桩基施工技术。     

山区漫水桥梁水毁调查分析及重建设计

重点阐述在涞水县7.21灾后公路恢复重建中，对桥梁水毁状况的调查分析以及工程重建设计要点，可为相关工作提供借鉴。     

新建隧道下穿多座隧道施工技术

以渝黔引入贵阳枢纽铁路龙宝冲隧道下穿6座已建及在建隧道工程为例,结合现场,详细分析、介绍了下穿隧道施工方案、原则、施工方法;提出了新建铁路隧道近距离下穿隧道交叉点附近施工爆破控制、防护方案,以及新建、既有隧道的监控量测、超前地质预报、安全性评估与评价等施工技术;解决了下穿隧道施工中既保证新建隧道施工安全,又保证既有隧道不受影响的问题。     

钩形外锁闭装置锁闭框组优化的探讨

钩形外锁闭装置在实践中逐步暴露出一些诸如转换不畅、卡阻,磨耗严重,适应尖轨窜动性不良等问题.为此研究探讨对既有的外锁闭装置锁闭框组（包括锁闭框、锁闭铁、耐磨板等）进行优化,提高道岔转换的可靠性.     

Plate scanning tools to obtain travel times in traffic networks

The management of vehicle travel times has been shown to be fundamental to traffic network analysis. To collect travel time measurement, some methods focus solely on isolated links or highway segments, and where two measurement points, at the beginning and at the end of a section, are deemed sufficient to evaluate users' travel time. However, in many cases, transport studies involve networks in which the problem is more complex. This article takes advantage of the plate scanning technique to propose an algorithm that minimizes the required number of registering devices and their location in order to identify vehicles candidates to compute the travel times of a given set of routes (or subroutes). The merits of the proposed method are explained using simple examples and are illustrated by its application to the real network of Ciudad Real.     

Subjective-utility travel time budget modeling in the stochastic traffic network assignment

ABSTRACT

In this article, we propose a new model called subjective-utility travel time budget (SU-TTB) model to capture travelers' risk-averse route choices. In the travel time budget (TTB) and mean-excess travel time (METT) model, a predefined confidence level is needed to capture the risk-aversion in route choice. Due to the day-to-day route travel time variations, the exact confidence level is hard to be predicted. With the SU-TTB model, we assume travelers' confidence level belongs to an interval that they may comply with in the route choice. The two main components of SU-TTB are the utility function and the TTB model. We can show that the SU-TTB can be reduced to the TTB and METT model with proper utility function for the confidence levels. We can also prove its equivalence with our recently proposed nonlinear-expectation route travel time (NERTT) model in some cases and give some new interpretation on the NERTT with this equivalence. Finally, we formulate the SU-TTB model as a variational inequality (VI) problem to model the risk-averse user equilibrium (RAUE), termed as generalized RAUE (GRAUE). The GRAUE is solved via a heuristic gradient projection algorithm, and the model and solution algorithm are demonstrated with the Braess's traffic network and the Nguyen and Dupuis's traffic network.     

Robust traffic assignment model: Formulation,solution algorithms and empirical application

ABSTRACT

The deterministic traffic assignment problem based on Wardrop's first criterion of traffic network utilization has been widely studied in the literature. However, the assumption of deterministic travel times in these models is restrictive, given the large degree of uncertainty prevalent in urban transportation networks. In this context, this paper proposes a robust traffic assignment model that generalizes Wardrop's principle of traffic network equilibrium to networks with stochastic and correlated link travel times and incorporates the aversion of commuters to unreliable routes.

The user response to travel time uncertainty is modeled using the robust cost (RC) measure (defined as a weighted combination of the mean and standard deviation of path travel time) and the corresponding robust user equilibrium (UE) conditions are defined. The robust traffic assignment problem (RTAP) is subsequently formulated as a Variational Inequality problem. To solve the RTAP, a Gradient Projection algorithm is proposed, which involves solving a series of minimum RC path sub-problems that are theoretically and practically harder than deterministic shortest path problems. In addition, an origin-based heuristic is proposed to enhance computational performance on large networks. Numerical experiments examine the computational performance and convergence characteristics of the exact algorithm and establish the accuracy and efficiency of the origin-based heuristic on various real-world networks. Finally, the proposed RTA model is applied to the Chennai road network using empirical data, and its benefits as a normative benchmark are quantified through comparisons against the standard UE and System Optimum (SO) models.