基于混合算法的大跨度斜拉桥可靠度评估

为研究大跨度顸应力混凝土(PC)斜拉桥的可靠度评估问题,提出了适用于大跨度PC斜拉桥这类复杂结构可靠性分析的混合算法.该方法综合运用了有限元分析(FEA)、径向基函数(RBF)神经网络、遗传算法(GA)和Monte Carlo重要抽样(MCIS)方法,并对算法中的关键步骤(RBF神经网络的初始样本点设计方法、MCIS的抽样中心点位置等)进行了改进,使结构分析模块与可靠度计算模块智能结合.利用数值算例的可靠度分析对该算法的有效性进行了验证.最后,以一座主跨为420 m的双塔PC斜拉桥为工程背景,进行了正常使用极限状态下的可靠度分析.参数分析表明:在汽车荷载作用下,该斜拉桥的主梁跨中位移超限失效概率比最长斜拉索强度失效概率高;汽车荷载的均值和标准差是影响斜拉桥可靠度的重要因素;随着汽车荷载均值系数的增大,主梁跨中位移超限失效的可靠指标下降的趋势较为显著.     

高速公路场景下的电子稳像技术研究

为了去除高速公路监控视频中自身位置不稳定的事物给全局运动矢量估计带来误差,先通过Canny算子检测图像中的直线,并根据车道边界的特征筛选出道路边界,确定道路区域。再检测道路区域内的Harris角点信息,并与背景图中道路区域内的角点位置进行匹配,从而得到全局运动矢量,并计算出稳定的图像。实验表明,该算法能够满足高速公路场景下的稳像需求。     

基于LabVIEW管道泄漏检测系统的研究

介绍了管道泄漏检测系统的设计原理.利用LabVIEW中的小波分析函数对采集到的信号进行处理,并利用小波变换模极大值捕捉压力信号的突变点,从而得出负压波传播到上下游监测点的时间差,进而利用负压波定位原理进行泄漏点的定位.另外,对于优化程序内存和提高CPU的利用率提出了一些有效的解决方法.     

Reliable sensor deployment for network traffic surveillance

New sensor technologies enable synthesis of disaggregated vehicle information from multiple locations. This paper proposes a reliable facility location model to optimize traffic surveillance benefit from synthesized sensor pairs (e.g., for travel time estimation) in addition to individual sensor flow coverage (e.g., for traffic volume statistics), while considering probabilistic sensor failures. Customized greedy and Lagrangian relaxation algorithms are proposed to solve this problem, and their performance is discussed. Numerical results show that the proposed algorithms solve the problem efficiently. We also discuss managerial insights on how optimal sensor deployment and surveillance benefits vary with surveillance objective and system parameters (such as sensor failure probabilities).     

Approximate network loading and dual-time-scale dynamic user equilibrium

In this paper we present a dual-time-scale formulation of dynamic user equilibrium (DUE) with demand evolution. Our formulation belongs to the problem class that Pang and Stewart (2008) refer to as differential variational inequalities. It combines the within-day time scale for which route and departure time choices fluctuate in continuous time with the day-to-day time scale for which demand evolves in discrete time steps. Our formulation is consistent with the often told story that drivers adjust their travel demands at the end of every day based on their congestion experience during one or more previous days. We show that analysis of the within-day assignment model is tremendously simplified by expressing dynamic user equilibrium as a differential variational inequality. We also show there is a class of day-to-day demand growth models that allow the dual-time-scale formulation to be decomposed by time-stepping to yield a sequence of continuous time, single-day, dynamic user equilibrium problems. To solve the single-day DUE problems arising during time-stepping, it is necessary to repeatedly solve a dynamic network loading problem. We observe that the network loading phase of DUE computation generally constitutes a differential algebraic equation (DAE) system, and we show that the DAE system for network loading based on the link delay model (LDM) of Friesz et al. (1993) may be approximated by a system of ordinary differential equations (ODEs). That system of ODEs, as we demonstrate, may be efficiently solved using traditional numerical methods for such problems. To compute an actual dynamic user equilibrium, we introduce a continuous time fixed-point algorithm and prove its convergence for effective path delay operators that allow a limited type of nonmonotone path delay. We show that our DUE algorithm is compatible with network loading based on the LDM and the cell transmission model (CTM) due to Daganzo (1995). We provide a numerical example based on the much studied Sioux Falls network.     

Multi-objective optimization of a road diet network design

The present study focuses on the development of a model for the optimal design of a road diet plan within a transportation network, and is based on rigorous mathematical models. In most metropolitan areas, there is insufficient road space to dedicate a portion exclusively for cyclists without negatively affecting existing motorists. Thus, it is crucial to find an efficient way to implement a road diet plan that both maximizes the utility for cyclists and minimizes the negative effect on motorists. A network design problem (NDP), which is usually used to find the best option for providing extra road capacity, is adapted here to derive the best solution for limiting road capacity. The resultant NDP for a road diet (NDPRD) takes a bi-level form. The upper-level problem of the NDPRD is established as one of multi-objective optimization. The lower-level problem accommodates user equilibrium (UE) trip assignment with fixed and variable mode-shares. For the fixed mode-share model, the upper-level problem minimizes the total travel time of both cyclists and motorists. For the variable mode-share model, the upper-level problem includes minimization of both the automobile travel share and the average travel time per unit distance for motorists who keep using automobiles after the implementation of a road diet. A multi-objective genetic algorithm (MOGA) is mobilized to solve the proposed problem. The results of a case study, based on a test network, guarantee a robust approximate Pareto optimal front. The possibility that the proposed methodology could be adopted in the design of a road diet plan in a real transportation network is confirmed.     

基于蚁群算法和群决策理论的动态路径优化研究

文章针对城市交通信号控制中的动态路径优化问题,综合考虑相邻交叉口间距和路段交通饱和度两个参数的影响,提出了一种基于蚁群算法和群决策理论的动态路径优化算法模型,并通过仿真实验,对比分析了该算法模型的有效性。     

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

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

Scheduling of Intelligent and Autonomous Vehicles under pairing/unpairing collaboration strategy in container terminals

A new class of Intelligent and Autonomous Vehicles (IAVs) has been designed in the framework of Intelligent Transportation for Dynamic Environment (InTraDE) project funded by European Union. This type of vehicles is technologically superior to the existing Automated Guided Vehicles (AGVs), in many respects. They offer more flexibility and intelligence in maneuvering within confined spaces where the logistic operations take place. This includes the ability of pairing/unpairing enabling a pair of 1-TEU (20-foot Equivalent Unit) IAVs dynamically to join, transport containers of any size between 1-TEU and 1-FFE (40-foot Equivalent) and disjoin again. Deploying IAVs helps port operators to remain efficient in coping with the ever increasing volume of container traffic at ports and eliminate the need for deploying more 40-ft transporters in the very confined area of ports. In order to accommodate this new feature of IAVs, we review and extend one of the existing mixed integer programming models of AGV scheduling in order to minimize the makespan of operations for transporting a set of containers of different sizes between quay cranes and yard cranes. In particular, we study the case of Dublin Ferryport Terminal. In order to deal with the complexity of the scheduling model, we develop a Lagrangian relaxation-based decomposition approach equipped with a variable fixing procedure and a primal heuristics to obtain high-quality solution of instances of the problem.     

基于AIGA-WLSSVM的埋地管道腐蚀速率预测方法

为了降低埋地管道腐蚀影响因素之间的复杂相关性,提高腐蚀预测精度,文中提出一种基于自适应免疫遗传算法-加权最小二乘支持向量机(AIGA-WLSSVM)的埋地管道腐蚀速率预测建模方法,并采用AIGA优化模型参数,进一步提高模型的学习能力和稳定性。最后通过实例分析验证了AIGA-WLSSVM建模方法在埋地管道腐蚀速率预测中的可行性和有效性,为埋地管道的检修与更换提供参考。