鹧鸪山隧道二次衬砌开裂机理及支护时机探讨

隧道二次衬砌开裂成因复杂,只有分清隧道二次衬砌开裂原因,才能对其提出合理的处治对策,以保证隧道施工、运营安全。文章以某高速公路(炭质)千枚岩隧道为例,基于隧道出口段二次衬砌开裂特征,结合现场监控量测以及工程地质条件,分析该隧道二次衬砌开裂主要原因是围岩地质条件差、围岩级别低且二次衬砌施作过早。然后进一步采用数值计算分析不同二次衬砌施作时机下的应力特征,结果表明:二次衬砌施作过早导致边墙和拱腰附近二次衬砌内侧产生较大的拉应力,且二次衬砌施作越早,拉应力越大,这将导致二次衬砌张拉开裂;在初期支护变形量为隧道最终变形收敛值的65%~70%之后施作二次衬砌较适宜。建议在类似隧道施工中加强监控量测,严格控制二次衬砌支护时机。     

高地应力软岩隧道施工动态控制与优化研究

根据兰渝铁路毛羽山隧道出口开挖过程中出现严重大变形的工程实例,利用FLAC3D建立三维数值模型,对不同台阶长度、仰拱闭合时机、锚杆长度以及二次衬砌浇筑时机的隧道施工进行了动态模拟。计算结果表明:台阶长度对大变形控制至关重要,应尽可能减小上台阶长度,采用超短台阶法施工;仰拱对于挤压性围岩隧道大变形控制具有显著的效果,应尽早封闭成环;随着锚杆长度的增加,隧道变形逐渐减小,但是当其长度大于8m时,再增加锚杆长度对控制大变形所起作用不明显;开挖后立即施作二次衬砌,可有效控制围岩蠕变变形。     

乌鞘岭特长隧道软弱围岩大变形特性研究

乌鞘岭特长隧道全长20050m,是我国目前正在修建的国内最长的单线铁路隧道.隧道施工中发生了严重的围岩大变形,主要表现为隧道中部岭脊地段F4～F7断层构成的"挤压构造带"在深埋高地应力条件下的软弱围岩大变形,拱顶最大下沉及侧壁最大水平收敛变形量均达1000mm以上,导致初期支护开裂破坏并严重侵入衬砌净空等,不得不将初期支护全部或部分拆除重做,再施作二次衬砌.文章对隧道区域工程地质环境、软弱围岩变形力学特性及初期支护破坏规律、围岩变形的影响因素等进行了分析研究,并讨论了隧道围岩加固、初期支护预留变形量与二次衬砌施作时机等问题.     

二次衬砌施作时机的弹粘塑性有限元分析

文章针对兰渝线软岩大变形隧道施工的实际情况,对变形速率达到2 mm/d时(此时二次衬砌的最大压应力达到20.25 MPa,最大拉应力为1.68 MPa)施作二次衬砌这一工况,采用弹粘塑性有限元法进行了隧道施工过程的模拟分析.分析结果表明,在变形速率为2 mm/d时施做C35钢筋混凝土二次衬砌以后,衬砌不至于产生强度破坏.此分析结果和计算方法可为二次衬砌施作时机的决策提供参考.     

隧道二次衬砌合理施作时机确定方法研究

隧道二次衬砌合理施作时机的确定关键在于分析评估围岩变形何时达到稳定状态,现场监控量测蕴含整个围岩发展演化过程的所有信息,是其应力、变形状态最直接的反映。文章构建了一种基于监控量测的隧道围岩变形状态动态综合评估模型,克服了传统综合评估方法仅在某一时间截面下进行静态评估的缺陷。该模型基于离差最大化原则对监控量测指标进行动态赋权,监测指标权重随其在评估时域内的稳定度而动态变化,时域内指标值离差越大赋予权重越大。同时,模型通过引入加速度修正系数概念,将监测指标变化速度状态和趋势进行融合考虑。并且模型引入了时间权重向量和时间度的概念,对采集的监测数据按不同时期合理地赋予不同时间权重(近期监测数据时间权重高于远期监测数据)。该模型的有效性通过在杭州紫之隧道设置试验段进行了验证,为确定隧道二次衬砌合理施作时机提供了一种新的可靠方法。     

大直径盾构隧道双层衬砌管片结构计算

目前,大直径盾构隧道的运用日益增多,常用的盾构隧道多为单层衬砌结构。鉴于单层衬砌管片结构存在一些缺点,双层衬砌管片结构的设计与使用逐渐引起人们的注意。文章针对大连地铁5号线跨海段盾构隧道双层衬砌结构,运用Abaqus软件并考虑围岩压力、地震荷载作用、溶洞以及施作方式对于结构的影响,计算分析不同工况下盾构隧道双层衬砌管片结构的变形以及受力特征。研究结果表明:基本荷载下结构受力的主体为初衬,二次衬砌的作用应更多考虑为耐久性和安全储备。地震荷载作用下二次衬砌结构内力显著增大,相对于基本荷载,初衬内力增幅为8.57%～44.1%,二次衬砌内力增幅为123.6%～332.4%,二次衬砌结构将在抵抗地震等偶然荷载作用时发挥较大作用。地震荷载作用下溶洞对双层衬砌结构内力及变形影响很大,相对基本荷载工况,初衬内力增幅为11.0%～216.5%,二次衬砌内力增幅为192.4%～353.1%,轴向变形增幅为58.9%～81.34%,水平向变形增幅约为143.6%。因此,建议对溶洞进行合理加固,以保证隧道安全。     

某高速公路隧道严重变形分析及处理

本文从地质构造、设计和施工等因素分析造成软弱破碎围岩隧道初期支护严重变形的原因，用渐近线和双曲正切函数推导测点最终位移量和各阶段位移速率，研究变形隧道的开挖及支护对策，探讨提前施作二次衬砌的充分必要性。     

崇遵高速公路凉风垭隧道严重变形分析

文章从地质构造、设计和施工等方面分析了造成软弱破碎围岩隧道初期支护严重变形的原因,用渐近线和双曲正切函数推导测点最终位移量和各阶段位移速率,研究变形隧道的开挖及支护对策,并探讨了提前施作二次衬砌的必要性.     

乌鞘岭特长隧道围岩监控量测设计与应用

文章重点介绍了以监控隧道稳定性为目的的围岩监控量测在乌鞘岭隧道工程中的应用.通过监控围岩和支护状态,并对量测数据进行分析,来调整支护参数及最大预留变形量,确定仰拱、二次衬砌的合理施作时间,制定相关施工方案和措施,判定施工方法是否有效,并根据实施效果作出评价.     

广巴高速某隧道不同岩性围岩变形特征分析

通过对某隧道右线典型断面监控量测数据的回归分析,结合该隧道围岩性状的变化,阐述了泥岩和砂岩两种不同岩性围岩变形随时间变化的基本规律,并建立模型分析了其动态变形特征。根据该隧道围岩具有急剧变形和缓慢变形两个明显阶段的特点,在分析和评价围岩稳定性的基础上,预测了与实测结果基本吻合的二次衬砌的施作时间,并通过ANSYS进行了验证。结果表明,应力对岩体稳定时间的影响与模型稳定时间吻合。     

Travel intensity in a city with a barrier

An analytical study is made of the determination of the travel intensity at an arbitrary point of a city with a straight line barrier. For a given origin and destination a trip is made by the shortest path not crossing the barrier or the city perimeter. The joint trip end distribution is arbitrary except for a continuity assumption.     

小净距隧道群控制爆破技术

文章通过对大坪山隧道的工程概况、地形地质特点及工程施工难点的分析,并借助数值研究手段,有针对性地提出了YYK393+581~YYK393+621洞段中导洞超前、大断面循序跟进的施工方法;研究分析了炸药性能及尺寸等控制爆破技术要点及爆破参数,同时就施工安全措施提出了一些建议。     

Understanding parking decisions with a Bayesian network

In this paper, a Bayesian network is developed to investigate three intertwining parking decisions, namely parking period, parking location, and parking duration, and the impacts of a number of parking-related factors on these decisions. With parking information from Beijing, China in 2005, the structure and parameter of a Bayesian network were learnt by employing the K2 algorithm and Bayesian parameter estimation method respectively. The results show that the decision on how long to park follows that on where to park, and both of them are affected by the decision of when to park. This suggests that parking policies aimed at intervening in one specific parking decision may have an indirect influence on other parking decisions, which embraces an integrated view in the development of parking policies. The findings facilitate the development of measures for regulating parking behavior by identifying important contributing factors.     

Spatial allocation on a network with congestion

This article formalizes the land use design problem as a discrete-convex programming problem integrating within a quadratic assignment framework a realistic representation of transportation behavior (automobile congestion and variable demand for travel) as modelled by a combined trip distribution trip assignment model. Hill-climbing algorithms are proposed to solve the resulting optimization problem. Their performance is compared and evaluated on a set of test problems.     

Welfare evaluation with a road capacity constraint

Severe traffic congestion in and around many cities across the world has resulted in programmes of extensive road building and other capacity increasing projects. But traffic congestion has often not fallen in the long run and neither has journey speed increased. Demand for peak period road travel, particularly by car, has grown so strongly that increases in road capacity have been quickly matched by increased road use. This paper develops a model of a road network characterised by insatiable road passenger (car and bus) demand. The model parameters are calibrated on a typical urban road network, and a number of simulations conducted to determine social welfare after the introduction of a road capacity constraint into the optimisation process. The empirical results have an important policy implication for the evaluation of projects that increase road capacity, namely that standard methods of cost-benefit analysis may tend to overestimate the net benefits of such projects by a significant amount. Although the model is developed in the context of roads and road traffic congestion, it could also be applied to air travel.     

Optimizing the demand captured by a railway system with a regular timetable

The railway systems in various European countries adopt regular timetables, in which the trains arrive and depart at constant intervals. In fact, their simple structure provides several advantages both to the passengers and to the management of the service. The design of such timetables has recently received a certain attention in the literature, but the standard model aims to optimize the service for a fixed demand. We relax this unrealistic assumption, taking into account the reciprocal influence between the quality of the timetable and the amount of transport demand captured by the railway. This results into a mixed-integer non linear model with a non-convex continuous relaxation. We solve it by a branch-and-bound algorithm based on a piecewise-linear overestimate of the objective function and a heuristic algorithm which iteratively applies the standard fixed-demand model and a demand-estimation model, feeding each one with data based on the solution obtained from the other one at the previous iteration. The computational results presented concern both random instances and a real-world regional network located in Northwestern Italy.     

某地铁过街通道大断面矩形顶管工程设计

顶管法是采用液压千斤顶等设备,将预制管节按设计方案顶入土层中的一种采用非开挖技术修建隧道的施工方法。将大断面矩形顶管设计应用于城市过街通道工程中,可显著减小工程施工对道路交通、管线迁改等的影响。文章通过对采用大断面矩形顶管方案的某地铁过街通道工程的设计方案实例进行了分析,结果表明大断面矩形顶管方案是解决城市重要道路下地下通道的先进施工方法,不仅施工速度快、工程施工安全可靠,还具有良好的社会效益和经济效益。     

Vehicular event sharing with a mobile peer-to-peer architecture

In vehicular ad hoc networks (VANETs), different types of information can be useful to drivers. Such networks are highly dynamic due to both the movements of the vehicles and the short range of the wireless communications. Thus, the information exchanges between vehicles about relevant information can only rely on short interactions. Therefore, an efficient mechanism to manage and disseminate the relevant information is required. Specifically, we present in this paper a system for data sharing in vehicular networks, which we call Vehicular Event Sharing with a mobile Peer-to-peer Architecture (VESPA). In this system, a new technique based on the concept of Encounter Probability is proposed for vehicles to share information using vehicle-to-vehicle communications. The objective is to facilitate the dissemination of information between vehicles when they meet each other, taking into account the relevance of the data to the drivers. Besides, the relevance must also be considered to inform a driver about the interesting events. Moreover, our proposal takes into account any type of event (e.g., available parking spaces, obstacles in the road, information relative to the coordination of vehicles in emergency situations, etc.) in the network. An experimental evaluation and the implemented prototype show the interest of the system.     

测微器水准仪在隧道拱顶下沉量测中的应用

文章介绍了水准仪测微器的基本工作原理、读数方法及在隧道拱顶下沉量测中的应用,指出需掌握其正确的读数方法,以免进入测微器水准仪读数的误区,使其获得结构的真正变形数据,达到隧道施工监控的目的。     

Traffic assignment in a two-dimensional continuous representation of a traffic network with flow-dependent speeds

The work deals with the assignment of traffic to a two-dimensional continuous representation of a traffic network. An important aspect of the treatment is that the reciprocal of the speed on each road in the network is at all times a linear function of the flow on that road. This speed-flow relationship is generalized to two-dimensional space using travel intensities and taking account of road densities, so that there is direct dependence of speeds upon flows at all points regardless of their location. There is also dependence of flows upon speeds at all points because Wardrop's first assignment principle is adopted. That is, for a given O-D pair, journey times on all routes actually used are identical, and less than journey times on all other possible routes. This results in the identification for each O-D pair of an “assignment zone”, an area within which all trips between that O-D pair are made, and beyond which no such trips are made. For a single O-D pair the assignment zone is identified by ?_m, the maximum angular divergence of a path from the straight line between O and D. Paths are then assumed to be bilinear so that for a single O-D pair the assignment zone is a parallelogram. Journey times, speeds, lateral displacement and other related quantities are obtained as functions of the flow Q between O and D. The work is extended to three O-D pairs located at the extremities of an equilateral triangle and four O-D pairs located at the corners of a square. At low flows these two configurations are trivial extensions of the single O-D pair problem because assignment zones do not overlap. At higher flows account is taken of this tendency to overlapping, so that although they do not overlap they do touch, becoming kite-shaped. Origins and destinations are assumed to be at the periphery of small circles of arbitrary radius. The work is inelegant to the extent that it involves a numerical integration but it is possible that this might eventually be circumvented.