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.     

基于MIMO法的行星齿轮减速器的模态试验

针对行星齿轮减速器,采用MIMO方法进行模态试验,将方案一(弹性绳悬挂)和方案二(弹性绳和充气轮胎混合支撑)两种形式下高频信号和低频信号得到的六组试验数据用LMS模态分析软件进行处理,得到七阶模态频率及其振型,及各阶模态的模态质量、模态刚度和模态阻尼等信息。最后分别对两种方案进行模态可信度和有效性分析,分析结果表明,两种方案在模态参数估计上都能取得相对合理的结果,方案二在获取低频模态信息方面效果较好,而方案一在获取高频模态信息方面效果较好,具体应用时应根据所关心的频段和模态参数选取不同方案的数据进行参考。     

非完美信息下京津冀区域物流设施选址研究

针对大规模物流设施选址问题,本文构建了非完美信息下设施可靠性选址的连续逼近模型.该模型不仅考虑了设施存在损坏的可能性,而且考虑了由于信息缺失顾客无法获得设施状态且存在返回出发地的行为.由于该模型的结果无法直接确定设施选址点,因此采用Disk算法对该模型的结果进行离散化,获得物流设施选址方案.以京津冀区域物流设施选址为例,验证了该模型有效性并对设施布局特性进行了分析.最后,通过灵敏度分析探讨了不同参数对京津冀区域物流设施选址的影响.     

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

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

材料性能对薄板成型影响的研究

在薄板成型过程中，材料的性能对成型过程影响很大，阐述了采用ＬＳ－ＤＹＮＡ３Ｄ中Ｈｕｇｈｅｓ－Ｌｉｕ壳理论，Ｈｉｌｌ各向异性屈服函数有限元数值模拟的过程，在方盒拉伸过程中，计算了二种不同材料－０８Ａｌ和０８Ｆ在完全相同条件下拉探成型的结果，这些结果表明，在分析薄板成型过程中ＬＳ－ＤＹＮＡ３Ｄ是一个极有效的工具。     

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

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

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

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

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

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