Network design for personal rapid transit under transit-oriented development

This study addresses guideway network design for personal rapid transit (PRT) favoring transit-oriented development. The guideway network design problem seeks to minimize both the guideway construction cost and users’ travel time. In particular, a set of optional points, known as Steiner points, are introduced in the graph to reduce the guideway length. The model is formulated as a combined Steiner and assignment problem, and a Lagrangian relaxation based solution algorithm is developed to solve the optimal solution. Numerical studies are carried on a real-sized network, and illustrate that the proposed model and solution algorithm can solve the PRT guideway network design problem effectively.     

基于时空等待特征系数的大型活动出行规划研究

高效、合理的综合交通路径规划是成功举办大型活动的前提之一.本文针对观众群体参与大型活动的出行路径规划问题,引入乘客出行偏好,转换为时空等待优化问题,再根据大型活动中乘客通过多模式公共交通出行特点,构建多维时间-空间-交通方式网络,以乘客出行时间总成本最小为目标建立整数线性规划模型.为提高模型的求解效率与质量,提出一种基...     

在役高压管式反应器残余应力松弛试验研究

自增强反应器管壁残余应力因交变压力及温度、温差的作用随时间而减小。在操作状态下，残余应力的松弛规律及其计算对反应管安全分析是十分重要的。用和反应管相同材料及相同截面尺寸的试件模拟反应管在设计温度、温差作用下，以及开停工引起的压力变化的作用下反应管内壁残余应力的松弛。温度和温差引起的管内壁残余应力的松弛率(或剩余率)随时间的变化可用自然对数函数来描述，压力变动导致的管内壁残余应力松弛率(或剩余率)随压力循环次数的变化为指数函数。给出了温度、压力循环作用下反应管内壁剩余残余应力计算式。该式计算结果不但和本文试验结果符合很好，而且和其他作者报道的实验数据相吻合。预测了一根服务了九年的反应管(4340钢)，其剩余残余应力误差在10％以内。因此，该方法不但适用于30CrNiMo8材料的反应器也适用于4340钢制的聚乙烯反应器。     

Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach

Path travel time reliability is an essential measure of the quality of service for transportation systems and an important attribute in travelers’ route and departure time scheduling. This paper investigates a fundamental problem of finding the most reliable path under different spatial correlation assumptions, where the path travel time variability is represented by its standard deviation. To handle the non-linear and non-additive cost functions introduced by the quadratic forms of the standard deviation term, a Lagrangian substitution approach is adopted to estimate the lower bound of the most reliable path solution through solving a sequence of standard shortest path problems. A subgradient algorithm is used to iteratively improve the solution quality by reducing the optimality gap. To characterize the link travel time correlation structure associated with the end-to-end trip time reliability measure, this research develops a sampling-based method to dynamically construct a proxy objective function in terms of travel time observations from multiple days. The proposed algorithms are evaluated under a large-scale Bay Area, California network with real-world measurements.     

空间扭曲混凝土箱梁短线匹配法预制拼装施工关键技术

厦漳跨海大桥的北汊南引桥为预制节段拼装箱梁桥,文章介绍了其技术特色,包括空间扭曲箱梁短线匹配法预制、架桥机拼装工艺,自动化模板与架桥机设备研发,施工控制关键技术等多项研究成果。施工安装符合要求,结构受力状态良好,可为类似工程参考。     

基于法兰联接系统松弛特性的多锥面法兰研究

文中针对现有普通法兰联接系统的应力松弛特性问题,设计了一种新型多锥面法兰,通过对法兰联接系统结构上的改进,去掉了原有法兰连接系统的垫片,明显减少了法兰连接系统的应力松弛,并通过法兰多锥面配合联接和法兰螺纹联接,增强了法兰联接的联接刚度,进一步减小了法兰连接系统的蠕变松弛,改进了法兰联接性能。实验测定和实际应用证明：该新型多锥面法兰可以有效减小法兰联接系统的应力松弛,防止法兰联接失效。     

老化沥青混合料的松弛模量模型

通过对沥青混合料AC-13C进行5种不同程度老化,然后再进行-5℃条件下的应力松弛试验,研究老化对其应力松弛性能的影响并建立耦合老化程度因子的松弛模量模型。对比不同老化程度沥青混合料的松弛模量曲线,发现老化程度与松弛时间之间存在一定的等效性;基于材料黏度的自由体积理论,通过假设沥青混合料的自由体积分数与老化程度间呈线性关系,研究并建立了沥青混合料的老化程度-松弛时间等效移位因子;对松弛模量主曲线分别采用Burgers模型和不同单元数目的广义Maxwell模型进行非线性拟合,表明广义Maxwell模型在表征松弛模量变化时优于Burgers模型,且单元数越多,拟合精度越高,考虑到拟合精度和参数数目,推荐采用六单元广义Maxwell模型,并建立耦合老化程度因子的松弛模量模型。     

Interactive flexural-torsional buckling behaviour of stiffened plating

Results from a series of studies on stiffened plates under axial compression are presented in this paper. The large-deflection elasto-plastic behaviour of each panel component is described by the von Karman equations, thus enabling the lateral-torsional buckling of the stiffener to be modelled in a rigorous manner. Material nonlinearity is represented using the von Mises yield criterion in conjunction with the Prandtl-Reuss flow rule. Results are presented in the form of average stress-strain curves which are used to generate maximum strength curves for the stiffener and plate.     

Equity-oriented skip-stopping schedule optimization in an oversaturated urban rail transit network

In this study, we focus on improving system-wide equity performance in an oversaturated urban rail transit network based on multi-commodity flow formulation. From the system perspective, an urban rail transit network is a distributed system, where a set of resources (i.e., train capacity) is shared by a number of users (i.e., passengers), and equitable individuals and groups should receive equal shares of resources. However, when oversaturation occurs in an urban rail transit network during peak hours, passengers waiting at different stations may receive varying shares of train capacity leading to the inequity problem under train all-stopping pattern. Train skip-stopping pattern is an effective operational approach, which holds back some passengers at stations and re-routes their journeys in the time dimension based on the available capacity of each train. In this study, the inequity problem in an oversaturated urban rail transit network is analyzed using a multi-commodity flow modeling framework. In detail, first, discretized states, corresponding to the number of missed trains for passengers, are constructed in a space-time-state three-dimensional network, so that the system-wide equity performance can be viewed as a distribution of all passengers in different states. Different from existing flow-based optimization models, we formulate individual passenger and train stopping pattern as commodity and network structure in the multi-commodity flow-modeling framework, respectively. Then, we aim to find an optimal commodity flow and well-designed network structure through the proposed multi-commodity flow model and simultaneously achieve the equitable distribution of all passengers and the optimal train skip-stopping pattern. To quickly solve the proposed model and find an optimal train skip-stopping pattern with preferable system-wide equity performance, the proposed linear programming model can be effectively decomposed to a least-cost sub-problem with positive arc costs for each individual passenger and a least-cost sub-problem with negative arc costs for each individual train under a Lagrangian relaxation framework. For application and implementation, the proposed train skip-stopping optimization model is applied to a simple case and a real-world case based on Batong Line in the Beijing Subway Network. The simple case demonstrates that our proposed Lagrangian relaxation framework can obtain the approximate optimal solution with a small-gap lower bound and a lot of computing time saved compared with CPLEX solver. The real-world case based on Batong Line in the Beijing Subway Network compares the equity and efficiency indices under the operational approach of train skip-stopping pattern with those under the train all-stopping pattern to state the advantage of the train skip-stopping operational approach.     

Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem

Using a sample-based representation scheme to capture spatial and temporal travel time correlations, this article constructs an integer programming model for finding the a priori least expected time paths. We explicitly consider the non-anticipativity constraint associated with the a priori path in a time-dependent and stochastic network, and propose a number of reformulations to establish linear inequalities that can be easily dualized by a Lagrangian relaxation solution approach. The relaxed model is further decomposed into two sub-problems, which can be solved directly by using a modified label-correcting algorithm and a simple single-value linear programming method. Several solution algorithms, including a sub-gradient method, a branch and bound method, and heuristics with additional constraints on Lagrangian multipliers, are proposed to improve solution quality and find approximate optimal solutions. The numerical experiments investigate the quality and computational efficiency of the proposed solution approach.