Multiple equilibria in a dynamic traffic network

This study provides an example in which the dynamic user equilibrium (DUE) assignment of a congested road network with bottlenecks is non-unique. In previous studies, the uniqueness of DUE assignments with the bottleneck model has been shown in limited cases such as single-origin and single-destination networks. Consequently, it is still an important issue whether or not uniqueness is a general property of DUE assignments. The present study describes a network in which multiple patterns of link travel time are found, thus providing a negative answer to this question. The network has a loopy structure with multiple bottlenecks and multiple origin-destination (OD) pairs. Given a certain demand pattern of departure times for vehicles leaving their origins, a non-convex set of equilibria with a non-unique pattern of link travel times is shown to exist.     

On a mean field game approach modeling congestion and aversion in pedestrian crowds

In this paper we present a new class of pedestrian crowd models based on the mean field games theory introduced by Lasry and Lions in 2006. This macroscopic approach is based on a microscopic model, that considers smart pedestrians who rationally interact and anticipate the future. This leads to a forward-backward structure in time. We focus on two-population interactions and validate the modeling with simple examples. Two complementary classes of problems are addressed, namely the case of crowd aversion and the one of congestion. In both cases we describe the model and present numerical solvers (based on the optimization formulation and the partial differential equations respectively). Finally we present numerical tests involving anticipation phenomena and complex group behaviors such as lane formation.     

半潜式平台极限状态评估

对某半潜式钻井平台,采用ANSYS建立有限元计算模型,进行了典型波浪荷载作用下平台非线性垮塌性分析,不考虑几何非线性和初始缺陷的影响。分析结果表明,平台最终的失效形式和水动力荷载作用形式十分相关,初始失效部位和最终失效状态各不相同。文中对ANSYS计算模型和SESAM计算模型进行了对比,在相同的荷载条件下分别计算了两个模型,比较ANSYS计算结果和SESAM计算结果及ABS和DNV规范理论结果,三者结果吻合较好。对非线性垮塌分析结果进行了讨论,通过对截面力作用形式的分析,建立了两类半潜式平台极限状态方程。文中半潜式平台非线性垮塌分析结果可以作为基于ABS和DNV规范的半潜式平台极限状态的基准性研究。     

软土中无筋刚性桩复合地基支承路堤的整体稳定实用计算方法

为了合理评估无筋刚性桩复合地基支承路堤的稳定性,基于已进行的软土地基上刚性桩复合地基支承路堤的破坏机理研究,提出了刚性桩复合地基的整体稳定性简化分析方法,结合3个典型算例,与基于桩身抗剪强度的传统复合地基稳定方法进行了对比分析。结果表明：基于传统的复合地基稳定计算方法,采用桩身抗剪强度将显著高估路堤稳定性,桩身等效抗剪强度法可更好地反映刚性桩复合地基的破坏机理;采用等效荷载法、等效砂桩法和等效抗剪强度法计算得到的路堤稳定安全系数很接近;采用英国BS 8006规范方法、等效荷载法、摩擦接触法计算得到的路堤稳定安全系数显著依赖于桩土应力比。建议对无筋刚性桩复合地基支承路堤采用多种简化分析方法进行分析,保证设计的冗余度。     

基于Hoek理论考虑地震力作用的楔形体稳定性计算分析

Hoek理论是楔形体问题分析及计算的常用理论,它假定各滑面均为平面,以各滑面总抗滑力与楔形体总下滑力的比值来确定安全系数。但传统的Hoek理论未考虑地震力的影响,对需要考虑地震作用的地区其应用受限。基于Hoek理论采用极限平衡法的分析原理,将地震对楔形体的作用力纳入Hoek理论,从而得到一个考虑地震作用下楔形体稳定性的计算方法,并应用在临岳高速公路边坡的稳定性分析上,与实际情况吻合,说明推导的计算方法是正确的。     

Reliability-based network flow estimation with day-to-day variation: A model validation on real large-scale urban networks

Day-to-day variation in the travel times of congested urban transportation networks is a frustrating phenomenon to the users of these networks. These users look pessimistically at the path travel times, and learn to spend additional time to safeguard against serious penalties that await late arrivals at the destinations. These additional expenses are charges similar to the tolls in system equilibrium flow problem, but may not be collected. With this conjecture, the user equilibrium (UE) formulation of congested network flow problem would lack some necessary factors in addressing appropriate path choices. This study, following a previous work proposing pessimistic UE (PUE) flow, aims to show how to measure this additional travel cost for a link, and investigates how different is PUE from UE, and when such differences are pronounced. Data are collected from the peak-hour travel times for the links of paths in the city of Tehran, to estimate the variance of travel times for typical links. Deterministic functions are obtained by calibrating the standard deviation of the daily variations of link travel times, and probabilistic functions by the technique of copula. UE and PUE traffic assignment models are built and applied to three large cities of Mashhad, Shiraz, and Tehran in Iran. The results show that the estimated flows by PUE model replicate the observed flows in screen lines much better than the UE model, particularly for longer trips. Since PUE is computationally equivalent to UE, this improvement is attained virtually at no cost.     

论企业服务质量

本文对企业提高服务质量的特性、特征进行了分析，提出了企业服务质量的测定和管理方法。     

串列双圆柱桥墩局部冲刷精细化模拟

为研究不同墩心距下沿流向串列布置的双圆柱桥墩局部冲刷坑形态的变化规律，提出1种平衡湍流边界层模型以获得稳定的湍流来流边界条件；利用雷诺时均N-S方程和标准k-ε湍流模型求解河床上双圆柱桥墩周围的复杂绕流场；基于能考虑河床面任意斜坡和泥沙坍塌效应的泥沙输运模型和动网格技术模拟双圆柱桥墩局部冲刷的动态演化过程，得到平衡冲刷坑形态，揭示冲刷发展过程的流动特征和冲刷机理。模拟结果与中美规范局部冲刷预测结果比较表明：串列双圆柱桥墩之间存在干扰效应；受下游桥墩施扰，最大冲刷都发生在上游桥墩，冲刷深度比单圆柱桥墩大，当墩心距L与桥墩直径D之比L/D=4时，达到最大值；而下游桥墩受上游桥墩遮挡的影响，最大冲刷深度在L/D=2时达到最小值，随着墩心距的增大，下游冲刷深度增大；当墩心距大于5倍桥墩直径后，下游桥墩可不考虑遮挡效应；获得的串列双圆柱桥墩最大冲刷深度值与美国规范预测值较为接近，而中国规范公式预测值偏小，提出的下游桥墩冲刷深度遮挡因子可为桥梁抗冲刷设计提供参考。     

Toll sequence operation to realize target flow pattern under bounded rationality

Because boundedly rational user equilibrium (BRUE) always has a set of solutions instead of a unique one, from a static network equilibrium viewpoint, under BRUE there is no guarantee of attainability of any specific target flow by implementing tolls. In this study, from a disequilibrium flow evolution perspective, we design toll sequence operations (TS-operations) to guide the network flow to evolve towards the traditional Wardrop user equilibrium (UE) flow pattern. Under homogeneous bounded rationality (BR), iteratively implementing our TS-operations can make the network flow pattern converge to UE, which essentially solves the nonuniqueness problem of BRUE and re-establishes the effectiveness of link tolls in realizing any target link flow pattern. In particular we show that under homogenous BR the best-case untolled link-based BRUE can be realized as the untolled equilibrium. Under heterogeneous BR among different OD pairs, our TS-operations can make the flow converge to reduced BRUE and/or sub-network UE, which give smaller estimate intervals of the equilibrium flow pattern as compared to the original BRUE.