带转向延误的非对称多模式用户平衡模型及算法

为了在网络建模中更精确地反映交通网络和出行行为的复杂特征,从多模式用户平衡原理出发,综合考虑多模式和转向延误因素以及不同模式、路段和转向之间的非对称作用,利用变分不等式理论建立了带转向延误的非对称多模式用户平衡模型,并在精简对角化算法的框架内设计了求解算法。该模型集成了交通网络的诸多特征,且能直接刻画转向延误与转向流量之间的互动关系,避免了传统扩展网络法的缺陷。算例表明:该模型及其算法对问题的描述与求解是有效的。     

降级路网的认知及交通流平衡分析模型

为定量衡量因路段降级原因导致路网通行能力的丧失量,分析出行者在降级路网中的路径选择行为将导致何种网络交通流平衡状态,通过将降级路网划分为车流外界因素导致路段可通行能力降级和路段上车流量增加导致道路服务水平的下降两种类型,辨别旅行时间长短与旅行时间波动对出行者路径选择行为的影响,推导出同时考虑这两方面因素影响的可变路径旅行时间风险度量;在此基础上建立了降级路网中的交通流平衡分析模型,该模型满足存在性和惟一性,并能正确描述出行者对降级路网结构认知差异性情况下的网络交通流平衡状态。通过实例展示了不同旅行可靠性要求下,出行者对路径旅行时间长短的权衡关系以及整个路网交通流平衡结果。     

回转支承应用于平地机驱动桥与平衡箱联接

针对平地机后驱动桥与平衡箱联接存在零件加工和安装精度要求高、联接受力复杂、普通轴承易损坏、可靠性差等问题。提出了采用专用、特殊的轴承——回转支承联接的方法。通过适当选型并经过计算验证，该方法满足了平地机后驱动桥和平衡箱联接的强度和工作要求，且方便可行。     

基于用户平衡分析的铁路旅客列车票额分配计划制定及评价方法

票额分配计划必须最大限度地满足旅客集体乘车选择行为下长途旅客的出行需求,其中的旅客集体乘车选择行为表现为基于客车开行方案的换乘网络上的用户平衡态,据此平衡态提出以直接人公里数最大为目标的票额分配计划制定方法。进而根据短途套用、票额共用和席位复用等售票策略、以及这些策略对旅客集体乘车选择行为的影响,设计基于票额分配计划的换乘网络,依据该换乘网络上的用户平衡态,提出以旅客出行费用和票额分配计划的直接人公里数两项指标组成的评价方法。通过算例展示了票额分配计划的制定过程,并对不同票额分配计划进行了评价分析。     

混合交通平衡分配方法的研究

针对我国机动车与非机动车混合行驶、相互干扰的混合交通机制，把机动车和非机动车的相互影响因素考虑到交通阻抗函数中，在此基础上，建立混合交通UE分配模型及其算法。最后，将该算法运用到云南省保山市隆阳区的局部路网中。     

环梁-桁架支撑体系在大型基坑工程中的应用

研究目的：北京西站地下行包库是北京西站改扩建工程中的一个重大项目,对整个工程的进度起着控制作用。通过本研究,拟找到一个施工便捷、结构合理的支护体系。研究方法：根据地质情况、周围环境要求、工程功能、当地的常用施工工艺设备以及经济技术条件综合考虑、因地制宜地选择支护结构的类型。采用理正单元计算、理正整体计算与SAP84计算相校核的计算方法,并对极限平衡法和弹性支点法的计算结果进行对比分析。研究结果：采用人工挖孔桩围护结构＋圆形环梁-桁架支撑的支护体系,其结构受力体系合理,便于施工,经济指标合理。研究结论：圆形环梁-桁架支撑的支护体系结构受力合理,适用于平面尺寸大、长宽尺寸接近、四周地层性质接近、抗力接近的基坑;混凝土圆形环梁结构受压合理,整体稳定性好;桁架体系整体性强,采用钢构件施工速度快;单撑式围护结构可以采用极限平衡法计算。     

强震区板桩结构成层土地震土压力的计算方法

物部-冈部公式广泛应用于地震作用下的土压力计算,但因其适用条件的局限性,不能用于板桩墙后既含砂土又含有黏土的非均质土,且国内外规范对此类成层土的地震土压力计算没有统一的规定。总结国内外规范中成层土地震动土压力计算方法,找出其本质差异,在前人研究基础上引进整体极限平衡方法,结合SLOPE软件,得出强震区板桩结构成层土地震土压力的计算方法,并通过海外强震区港口工程实例验证,为同类工程提供参考。     

Approximate network loading and dual-time-scale dynamic user equilibrium

In this paper we present a dual-time-scale formulation of dynamic user equilibrium (DUE) with demand evolution. Our formulation belongs to the problem class that Pang and Stewart (2008) refer to as differential variational inequalities. It combines the within-day time scale for which route and departure time choices fluctuate in continuous time with the day-to-day time scale for which demand evolves in discrete time steps. Our formulation is consistent with the often told story that drivers adjust their travel demands at the end of every day based on their congestion experience during one or more previous days. We show that analysis of the within-day assignment model is tremendously simplified by expressing dynamic user equilibrium as a differential variational inequality. We also show there is a class of day-to-day demand growth models that allow the dual-time-scale formulation to be decomposed by time-stepping to yield a sequence of continuous time, single-day, dynamic user equilibrium problems. To solve the single-day DUE problems arising during time-stepping, it is necessary to repeatedly solve a dynamic network loading problem. We observe that the network loading phase of DUE computation generally constitutes a differential algebraic equation (DAE) system, and we show that the DAE system for network loading based on the link delay model (LDM) of Friesz et al. (1993) may be approximated by a system of ordinary differential equations (ODEs). That system of ODEs, as we demonstrate, may be efficiently solved using traditional numerical methods for such problems. To compute an actual dynamic user equilibrium, we introduce a continuous time fixed-point algorithm and prove its convergence for effective path delay operators that allow a limited type of nonmonotone path delay. We show that our DUE algorithm is compatible with network loading based on the LDM and the cell transmission model (CTM) due to Daganzo (1995). We provide a numerical example based on the much studied Sioux Falls network.     

Schedule-based transit assignment model with vehicle capacity and seat availability

In this paper, we propose a new schedule-based equilibrium transit assignment model that differentiates the discomfort level experienced by sitting and standing passengers. The notion of seat allocation has not been considered explicitly and analytically in previous schedule-based frameworks. The model assumes that passengers use strategies when traveling from their origin to their destination. When loading a vehicle, standing on-board passengers continuing to the next station have priority to get available seats and waiting passengers are loaded on a First-Come-First-Serve (FCFS) principle. The stimulus of a standing passenger to sit increases with his/her remaining journey length and time already spent on-board. When a vehicle is full, passengers unable to board must wait for the next vehicle to arrive. The equilibrium conditions can be stated as a variational inequality involving a vector-valued function of expected strategy costs. To find a solution, we adopt the method of successive averages (MSA) that generates strategies during each iteration by solving a dynamic program. Numerical results are also reported to show the effects of our model on the travel strategies and departure time choices of passengers.