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

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

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项关键技术。将这些技术合理地运用到实际工程施工中,将便于利用已有或新成果分类预防和控制地下工程质量和安全,为解决新型地下工程问题提供新的依据。     

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

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

考虑多目标的城市停车换乘选址优化模型及算法

停车换乘选址问题是城市交通网络设计研究的重点领域,已有研究的优化目标多集中在系统总费用方面,而对交通可持续发展方面考虑不足。为此,提出综合考虑多方面目标的停车换乘设施选址优化模型及其求解算法。首先,基于超网络理论,提出多方式城市交通系统的超网络模型并定义O-D (Origin-destination)间的超路径、有效超路径及子路径,结合出行者出行过程及交通网络拥挤特征,给出超路径费用的数学表达;其次,基于多方式交通网络随机均衡配流结果,构建交通总阻抗、污染物排放量以及交通系统公平性等系统优化指标的计算模型,并建立用以描述停车换乘设施选址问题的多目标优化模型;进而,以多目标系统优化模型为上层问题,以超网络下满足Logit分配的多方式交通网络配流模型为下层问题,构建描述城市多方式交通系统停车换乘设施选址问题的双层规划模型,并基于模型特征,结合“记录-搜索”思想设计非支配排序遗传算法进行求解;最后,基于Sioux Falls网络设计算例。研究结果表明：算法能够在有限的步骤内搜索到90%以上的Pareto最优解;平均而言,停车换乘措施使得交通总阻抗减小了0.31%,污染物排放量减少了7.32%...     

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.     

On the degradation of performance for traffic networks with oblivious users

We consider the problem of characterizing user equilibria and optimal solutions for routing in a given network. We extend the known models by considering users oblivious to congestion in the following sense: While in the typical user equilibrium setting the users follow a strategy that minimizes their individual cost by taking into account the (dynamic) congestion due to the current routing pattern, an oblivious user ignores congestion altogether; instead, he or she decides his routing on the basis of cheapest routes on a network without any flow whatsoever. These cheapest routes can be, for example, the shortest paths in the network without any flow. This model tries to capture the fact that a certain percentage of travelers base their route simply on the distances they observe on a map, without thinking (or knowing, or caring) about the delays experienced on this route due to their fellow travelers. In this work we study the effect of such users using as the measure of network performance its price of anarchy, i.e., the ratio of the total latency experienced by the users (oblivious or not) at equilibrium over the social optimum.     

伴有故障和延迟维修的清空排队系统的均衡分析

考虑一个马氏排队清空系统,将其看成一个在站台服务的容量无限的交通服务系统,顾客按照泊松过程到达系统后接受服务,而服务时间服从指数分布,假设交通工具容易出现故障,并且经过一个服从指数分布的延迟时间后,才能得到修理.在几乎可见情形下,顾客根据前面已进入系统的人数决定是否进入系统,结合一个线性支付函数,获得了顾客的均衡离开策略.     

Optimization of transport investment and pricing policies: the role of transport pricing in network design

This paper investigates the role of transport pricing in network design and describes two facts about flow pattern in a transportation system. The first, illustrated by an example of Braess paradox, is that adding a new link to the network does not necessarily minimize the total travel time. The second is that introducing of appropriate toll pricing may reduce not only the total network time but also the travel time for each individual traveller. It follows with the investigations of different system objectives and different pricing policies (only toll pricing and distance‐based pricing are considered), and shows how they affect the system performance and flow pattern. Lastly, a systematic optimization process is proposed for integrated planning of transport network and pricing policies.     

基于路网子图空间的交通流平衡分析方法

通过定义路网子图空间,提出了基于路网子图空间的Wardrop平衡原理,建立了相应的交通流平衡分析模型,并通过实例阐释了偏态均衡路网交通流的形成机理与演化过程。研究表明:该模型能够很好地解释包括新路开通期的路网交通流、换乘子图空间路网交通流、收费道路偏好子图空间路网交通流等多种情形下由于网络结构被差异性地认知所形成的偏态均衡路网交通流现象,为多标准下交通流的平衡分析建立了新途径;该分析方法有助于道路网络结构设计与道路网络管理方案的优化。