隆林新洲养护站边坡稳定性分析

文章利用SLOPE／W模块,基于确定值方法和可靠度理论的极限平衡法．对隆林新洲养护站边坡在不采取支挡措施和采用锚索抗滑桩支挡措施情况下,如何保持边坡稳定性进行了对比分析。     

On a link-based day-to-day traffic assignment model

In this paper, we perform a rigorous analysis on a link-based day-to-day traffic assignment model recently proposed in He et al. (2010). Several properties, including the invariance set and the constrained stability, of this dynamical process are established. An extension of the model to the asymmetric case is investigated and the stability result is also established under slightly more restrictive assumptions. Numerical experiments are conducted to demonstrate the findings.     

地下工程平衡稳定理论再研究

目前,地下工程结构在计算分析方面主要采用传统松弛荷载理论（类似荷载结构法）和数值分析法;在合理结构构造、施工工法等方面主要采用岩承理论（类似地层结构法）,这些已有理论或方法隐含“变形协调控制”假定,实际应用中往往将这些假定忽视,因而需进一步发展新的理论方法以适应实际应用的需求。在大量工程实践和试验的基础上,揭示地下工程有效承载结构层与围岩荷载转移规律之间的关联性,建立地下工程平衡稳定理论,此理论既能反映传统“松弛荷载理论”和现代“岩承理论”的基本内容,又能拓宽平衡稳定性等内容,是地下工程平衡稳定性的新认识、新理念; 同时提出能量控制技术、预支护技术、受力独立性综合技术、变形协调控制技术4项关键技术。将这些技术合理地运用到实际工程施工中,将便于利用已有或新成果分类预防和控制地下工程质量和安全,为解决新型地下工程问题提供新的依据。     

Direct formulation and algorithms for the probit-based stochastic user equilibrium traffic assignment problem

This paper proposes simple and direct formulation and algorithms for the probit-based stochastic user equilibrium traffic assignment problem. It is only necessary to account for random variables independent of link flows by performing a simple transformation of the perceived link travel time with a normal distribution. At every iteration of a Monte-Carlo simulation procedure, the values of the random variables are sampled based on their probability distributions, and then a regular deterministic user equilibrium assignment is carried out to produce link flows. The link flows produced at each iteration of the Monte-Carlo simulation are averaged to yield the final flow pattern. Two test networks demonstrate that the proposed algorithms and the traditional algorithm (the Method of Successive Averages) produce similar results and that the proposed algorithms can be extended to the computation of the case in which the random error term depends on measured travel time.     

随机交通分配中有效路径的确定方法

对用于随机交通分配的三种不同路径进行了比较和分析,研究了无环简单路径的寻求方法和无环简单路径集上的随机交通分配问题。重新定义了有效路径,提出通过利用求解确定性用户均衡分配问题的迭代过程来产生有效路径的启发式方法,算例表明该方法是有效性的.     

��װ���·�����г�����ģ�ͼ�Ӧ���о�

综合考虑托运人面对集卡运输服务和货运代理报价两大顾客选择因素,构建由多个竞争性集卡运营商和一个货运代理商组成的集装箱道路运输市场竞争模型,通过逆向归纳法求解博弈均衡并以上海港进行算例分析.研究发现:若集卡运营商采取提供增值服务策略,则一方面由于承担了增值服务所需成本而导致集卡运营商利润下降;另一方面,集装箱道路运输市场需求的满足程度不断提高,集卡运营商和货运代理商的整体利润也呈现增加趋势.因此,通过对集装箱运输链建立合理的利益分配机制,就能激励集卡运营商主动提供增值服务,从而改变当前集装箱道路运输市场在基本运输服务方面进行恶性价格竞争的局面,实现集卡运营商和集装箱运输链的健康发展.     

Experiment of boundedly rational route choice behavior and the model under satisficing rule

In this paper, we study the boundedly rational route choice behavior under the Simon’s satisficing rule. A laboratory experiment was carried out to verify the participants’ boundedly rational route choice behavior. By introducing the concept of aspiration level which is specific to each person, we develop a novel model of the problem in a parallel-link network and investigate the properties of the boundedly rational user equilibrium (BRUE) state. Conditions for ensuring the existence and uniqueness of the BRUE solution are derived. A solution method is proposed to find the unique BRUE state. Extensions to general networks are conducted. Numerical examples are presented to demonstrate the theoretical analyses.     

边坡稳定性分析的广义Bishop法

鉴于简化B ishop法作为一种简单实用且精度较高的极限平衡方法却仅限于分析圆弧破坏的缺陷,提出将B ishop法应用于任意滑裂面的广义方法.基于极限平衡理论和简化B ishop法的简化条件,推导其用于一般滑裂面破坏的边坡安全系数计算公式.通过实例分析考证比较该法的精度,并提出取矩中心的确定方法,以保证竖向力简化假设下的精度,为土坡稳定性分析提供了一种简单通用的方法.     

基于Nash平衡的轨道交通列车牵引计算

列车牵引计算是整个城市轨道交通的重要组成部分.就城市轨道交通的牵引计算提出牵引计算的仿真模型,对城市轨道交通的列车运行进行基于Nash平衡的轨道交通研究,着重讨论城市轨道列车在多目标条件下实现多牵引力的列车运行问题,并进行相关的计算研究,可较好地实现在整个列车运行过程中牵引过程的模拟.     

A new schedule-based transit assignment model with travel strategies and supply uncertainties

This paper proposes a new scheduled-based transit assignment model. Unlike other schedule-based models in the literature, we consider supply uncertainties and assume that users adopt strategies to travel from their origins to their destinations. We present an analytical formulation to ensure that on-board passengers continuing to the next stop have priority and waiting passengers are loaded on a first-come-first-serve basis. We propose an analytical model that captures the stochastic nature of the transit schedules and in-vehicle travel times due to road conditions, incidents, or adverse weather. We adopt a mean variance approach that can consider the covariance of travel time between links in a space–time graph but still lead to a robust transit network loading procedure when optimal strategies are adopted. The proposed model is formulated as a user equilibrium problem and solved by an MSA-type algorithm. Numerical results are reported to show the effects of supply uncertainties on the travel strategies and departure times of passengers.