Prioritizing road extension projects with interdependent benefits under time constraint

Since transportation projects are costly and resources are limited, prioritizing or sequencing the projects is imperative. This study was inspired by a client who asked: “I have tens of approved road extension projects, but my financial resources are limited. I cannot construct all the projects simultaneously, so can you help me prioritize my projects?” To address this question, the benefits and costs of all the possible scenarios must be known. However, the impacts (or benefit) of road extension projects are highly interdependent, and in sizable cases cannot be specified thoroughly. We demonstrate that the problem is analogous to the Traveling Salesman Problem (TSP). Dynamic change in travel demand during construction is another aspect of the complexity of the problem. The literature is yet to provide efficient methods for large cases. To this end, we developed a heuristic methodology in which the variation of travel demand during the construction period is considered. We introduce a geometrical objective function for which a solution-finding policy based on “gradient maximization” is developed. To address the projects’ interdependency, a special neural network (NN) model was devised. We developed a search engine hybridized of Ant Colony and Genetic Algorithm to seek a solution to the TSP-like problem on the NN based on gradient maximization. The algorithm was calibrated and applied to real data from the city of Winnipeg, Canada, as well as two cases based on Sioux-Falls. The results were reliable and identification of the optimum solution was achievable within acceptable computational time.     

基于PSO算法的地铁智能调线调坡系统开发与研究

为解决人工调线调坡费时费力、效率低下，且无有效评价指标评判方案优劣的现状问题，从分析线路平纵断面设计变量入手，依据规范相关规定制定约束条件，创新性地建立带有侵限容忍值惩罚项和合规性惩罚项的目标函数，提出一套基于粒子群优化算法，适用于矩形、马蹄形、圆形等多种隧道断面类型的地铁调线调坡数学分析模型，并以此开发地铁智能调线调坡系统。以长沙地铁4号线某区间右线隧道为例，对比人工设计和智能系统的调线调坡结果。由对比结果可知，智能系统在线路参数选择的合理性和改善侵限情况等方面均明显优于人工调线调坡，且具有可靠性和高效性。     

A model for the biaxial dynamic bending of unbonded flexible pipes

An analytical model is given to investigate the behavior of unbonded flexible pipes under biaxial dynamic bending. The stick-slip conditions of each wire are studied in the framework of incremental analysis by an operator splitting of the time step into a stick-state prediction and a slip-state correction step. The tension gradient is calculated using the classical return-mapping algorithm and the obtained tension gradients are integrated numerically to find the axial tension by imposing appropriate boundary conditions. From the axial tension the bending moments with respect to the principal bending axes of the pipe are obtained. Poisson's effect, bending induced tension in the wire, shear deformations of the supporting plastic layer and the changes of the effective torsion and curvature increments of the wire after slip occurs are taken into account in the model. The results of bending moment–curvature relationship from this model are compared with the test data from simple bending and good correlations are found. The comparison of the biaxial bending moment results between this model and the available model also shows good agreement.     

基于FPGA的里程轮信号优选算法设计

文中通过对里程信号产生机理进行分析,提出了一种基于FPGA架构的里程优选算法,给出了实现算法的硬件架构图,并设计相应硬件电路和模拟实验。结果表明:该算法可以对3个里程轮脉冲信号进行优选采集,当里程轮处于超速或者停转状态时也能输出正确的脉冲信号。     

基于客流导向的长大市域轨道交通组织优化方法研究

以北京市轨道交通平谷线为依托,基于线路功能定位和客流需求,对车辆选型、运营交路方案进行探索性创新研究。提出一种行车组织优化模型及求解算法,并以运力运量、工程投资、客流-车流匹配率等关键性指标为比选目标,确定该市域快线的最佳行车组织方案,以期为类似市域快线行车组织方案的合理选择提供理论支撑。     

基于符号回归算法的地铁盾构刀盘扭矩预测研究

为了提高盾构机工作效率、降低施工成本,依托深圳地铁8号线某盾构区间段工程,基于符号回归(Symbolic Regression)算法,对不同掌子面的刀盘扭矩进行了预测。分析了推力、土仓压力以及贯入度变化及换刀对扭矩的影响。结果表明,贯入度增大会导致扭矩增加,但是土仓压力的增加可能会降低扭矩。扭矩模拟数学模型具有较高精度,模型中自变量变动引起因变量变化的趋势与现实情况一致。     

基于K-Means聚类算法的城市轨道交通站点分类及客流特征分析

文章立足于沈阳市轨道交通站点800 m范围内的人口分布、开发强度、公交接驳、路网长度分布、站点位置属性、站点客流数据等六大维度数据,采用K-Means聚类算法将城市轨道交通站点划分为居住型、商业商务型、综合开发型、产业型、交通枢纽型五大类;基于站点聚类成果,叠合多样化数据分析总结各类站点客流的普适性规律,可为后续站点周边基础设施完善、站点客流预测、车站运营组织方案做出指导。     

地铁网络服务韧性评估与最优恢复策略

针对已有基于拓扑效率的地铁网络韧性指标无法反映地铁运营实际的不足，构建考虑线 路流量影响的路网服务效率指标和基于服务效率的路网服务韧性指标，以及基于路网服务效率 的节点重要度指标；提出以路网服务韧性最大化为目标的优化模型，并基于遗传算法求解模型获 得最优恢复策略。算例结果表明：分别以服务效率和拓扑效率作为路网性能指标，获得的失效节 点恢复次序明显不同；蓄意攻击下，最优恢复策略获得的路网服务韧性分别比基于重要度的优先 恢复策略、基于节点度的优先恢复策略和随机恢复策略高16.76%、72.11%和86.21%。上述结果 表明，必须根据地铁运营实际合理选择路网性能指标和恢复策略，否则可能得到次优甚至明显偏 离实际的方案，无法实现预期目标。     

基于满意优化的模糊多目标预测控制算法研究

提出了以满意优化取代传统的最优控制对模糊预测控制中的性能指标进行优化的方法。以模糊多目标单步预测模型为例，给出了系统对某一控制目标的满意优化控制算法，并在此基础上提出了基于满意优化的模糊多目标预测控制算法。     

A New Explicit Algorithm for Bi-Phasic Mixture Flow in MIM

Metal injection moulding (MIM) is a new technology to manufacture small intricate parts in large quantity. Numerical simulation plays an important role in its development. To predict the specific segregation effect in MIM injection, mixture theory is adopted to model the injection flow by a bi-phasic model. This model conducts to the solution of two-coupled Stokes equations. It is an extremely computational consuming solution in the scope of the traditional algorithms, which induce a serious challenge to cost-effectivity of the MIM simulation. Referred to some methods proposed by Lewis in mono-phasic simulation and the implicit algorithms in MIM simulation, a new explicit algorithm is proposed and realized to perform efficiently this type of bi-phasic flow. Numerically this algorithm is devised to perform the simulation in a fully uncoupled manner except for a global solution of the pressure field in each time step. The physical coupling is taken into account in a sequential pattern by fractional steps. This special algorithm does not need any iteration, so it is straightforward and robust, suitable for MIM simulation and other sorts of simulations for multi-phasic flow.