Optimal joint distance and time toll for cordon-based congestion pricing

This paper addresses the optimal toll design problem for the cordon-based congestion pricing scheme, where both a time-toll and a nonlinear distance-toll (i.e., joint distance and time toll) are levied for each network user’s trip in a pricing cordon. The users’ route choice behaviour is assumed to follow the Logit-based stochastic user equilibrium (SUE). We first propose a link-based convex programming model for the Logit-based SUE problem with a joint distance and time toll pattern. A mathematical program with equilibrium constraints (MPEC) is developed to formulate the optimal joint distance and time toll design problem. The developed MPEC model is equivalently transformed into a semi-infinite programming (SIP) model. A global optimization method named Incremental Constraint Method (ICM) is designed for solving the SIP model. Finally, two numerical examples are used to assess the proposed methodology.     

Cost scaling based successive approximation algorithm for the traffic assignment problem

This paper presents a cost scaling based successive approximation algorithm, called ε-BA (ε-optimal bush algorithm), to solve the user equilibrium traffic assignment problem by successively refining ε-optimal flows. As ε reduces to zero, the user equilibrium solution is reached. The proposed method is a variant of bush-based algorithms, and also a variant of the min-mean cycle algorithm to solve the min-cost flow by successive approximation. In ε-BA, the restricted master problem, implying traffic equilibration restricted on a bush, is solved to ε-optimality by cost scaling before bush reconstruction. We show that ε-BA can reduce the number of flow operations substantially in contrast to Dial’s Algorithm B, as the former operates flows on a set of deliberately selected cycles whose mean values are sufficiently small. Further, the bushes can be constructed effectively even if the restricted master problem is not solved to a high level of convergence, by leveraging the ε-optimality condition. As a result, the algorithm can solve a highly precise solution with faster convergence on large-scale networks compared to our implementation of Dial’s Algorithm B.     

嵌入粘弹性包覆层的吸声覆盖层低频性能研究

在单层牯弹性圆柱管吸声覆盖层的基础上,发展了嵌入低剪切波波速包覆层即双层粘弹性圆柱管的吸声结构的理论模型.推导了轴对称波特征方程的低频近似解,并根据牛顿迭代法进一步计算精确解,为吸声覆盖层的低频性能快速预报提供基础.数值分析表明包覆层嵌入比例的增加、或者包覆材料剪切波速的减小能有效地改善低频吸声性能.     

高频雷达信号的双线性时频分布性能研究

针对海杂波背景下高频地波雷达的目标探测问题,采用时频分析方法研究对海杂波中的非平稳多分量目标探测。讨论了海杂波背景下的目标检测问题,以及信号的双线性时频分布,通过仿真研究了时频分布性能,尤其是核函数抑制多分量目标的交叉项作用。仿真结果显示,伪Wigner-Ville分布较Wigner-Ville分布对于交叉项的抑制作用较大,而平滑伪Wigner-Ville分布降低交叉项的效果更好。     

考虑疲劳损伤约束的车辆焊接结构轻量化设计

针对车辆焊接结构轻量化与疲劳寿命问题,提出考虑焊缝疲劳损伤约束的轻量化设计方法.采用国际焊接学会(IIW)的焊接接头与部件的疲劳设计评估标准,基于迈纳尔损伤累积理论,预测焊缝的疲劳累积损伤;以结构质量最小为目标,在应力、位移等常规约束基础上,加入焊缝疲劳累积损伤约束,建立了车辆焊接结构的轻量化模型.研究基于有限元分析的结构轻量化优化设计策略,采用试验设计方法对设计空间合理抽样,以样本数据建立近似响应模型,采用数值优化算法寻优,提高复杂工程问题优化计算的效率.利用该方法对某焊接构架进行了考虑焊缝疲劳损伤约束的轻量化设计,采用均匀设计法对14个设计变量进行50次试验,以样本数据及响应值建立径向基神经网络近似模型,采用序列二次规划算法进行优化设计,质量减轻12.5%.对实例的计算证明该方法的可行性与实用性.     

船舶横摇混沌阈值的数值方法研究

为计算梅尔尼科夫函数的简单零点,文章比较分析了两种数值算法:类帕德逼近和高斯—勒让德积分,作为验证,计算了某激励频率下系统的李雅普诺夫指数谱。然后选取某型船,采用梅尔尼科夫函数方法计算了横摇动力系统的混沌阈值,观察了横摇系统的安全池随外激励增大而逐渐破损的过程,并追踪了破损域中某点的相轨迹。研究计算表明:类帕德逼近可以较精确地得到同(异)宿轨道的参数方程,但在方程的设解形式上需要一定的技巧性,且计算量较大;高斯—勒让德积分不关注参数方程具体形式,处理简单,便于工程计算。     

基于星敏感器的载体角速度测定方法研究

提出了一种新的测定航天器角速度矢量的方法。该方法只需得到来自星敏感器的载体矢量测量信息,就可确定载体角速度。提出了基于各种不同差分法的运算规则,表示出了每种近似法的估计误差协方差。仿真结果表明,结合简单的滤波,该方法能够提供非常精确的角速度估计值,而且计算量远比卡尔曼滤波小得多。     

基于核函数变换的NLPCC分析在洪水分类中的应用

通过拟线性化变换和降维去噪,得出多维分类指标的低维主成分值,然后通过对每一待分类样本的低维主成分值进行聚类分析,最终得出洪水的自然分类结果.洪水分类实例结果表明,该计算方法不需要复杂的计算机专业知识和优化算法知识,原理清楚,计算简单,结果客观有效,不失为一种洪水分类评价的新途径.选择适宜的非线性变换函数是正确应用该方法的关键,同时对于能够预先给出分类指标值且数值范围较小时,需要指标标准数值判定和聚类效果判定相结合.     

基于AOK-TFR的轨道电路故障诊断方法

为弥补现有补偿电容检测方法在检测及时性和检测成本等方面的不足,基于传输线理论,提出了机车信号感应电压幅值包络(IVECS)仿真模型;在此基础上,分析了补偿电容故障对IVECS的影响规律,建立并验证了基于频率的IVECS等效回归模型;利用补偿电容故障位置前后IVECS的频率变化,提出了基于自适应最优核时-频分布的补偿电容故障诊断方法.该方法基于机车信号的实际数据,采用B样条离散二进小波对数据进行滤波降噪处理,并利用自适应最优核时-频分布提取处理结果的时-频信息,再通过检测时-频信息中频率的变化实现对故障电容的定位.经过对随机抽取的100段实际数据的测试,准确率约为92.58%,表明该方法能准确检测轨道电路发生故障的补偿电容位置.     

Continuous approximation for skip-stop operation in rail transit

Operating speed of a transit corridor is a key characteristic and has many consequences on its performance. It is generally accepted that an increased operating speed for a given fleet leads to reduced operating costs (per kilometer), travel and waiting times (three changes that can be computed precisely), an improved comfort and level of service, which can attract new passengers who are diverted from automobile (items harder to estimate precisely). That is why several operation schemes which aim to increase the operating speed are studied in the literature, such as deadheading, express services, and stop skipping.A novel category of solutions to this problem for one-way single-track rail transit is to perform accelerated transit operations with fixed stopping schedules. The concept is quite simple: as the time required for stopping at each station is an important part of travel time, reducing it would be a great achievement. Particular operations that take advantage of this idea already exist. This paper focuses on one of them: the skip-stop operation for rail transit lines using a single one-way track. It consists in defining three types of stations: AB stations where all the trains stop, and A and B stations where only half of the trains stop (stations type A and B are allocated interchangeably). This mode of operation is already described in the literature (Vuchic, 1973, Vuchic, 1976, Vuchic, 2005) and has been successfully implemented in the Metro system of Santiago, Chile.This work tackles the problem with a continuous approximation approach. The problem is described with a set of geographically dependent continuous parameters like the density of stations for a given line. Cost functions are built for a traditional (all-stop) operation and for skip-stop operation as described above. A simple example is presented to support this discussion. Finally, a discussion about the type of scenarios in which skip-stop operations are more beneficial is presented.