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.     

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

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

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

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

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

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

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.     

光滑质点流体动力学(SPH)及其算法特性

基于Lagrange观点的无网格方法计算是建立在一群可移动的自适应性的质点基础之上,对特大变形区域和自由表面的捕捉有着较高的精度.光滑质点流体动力学(SPH)是无网格方法的一种,本文阐述其理论基础和计算方法,主要包括:SPH的基本概念、核近似和粒子近似的基本原理,核函数的构造方法、SPH形式的流体运动方程、边界处理方法和数值算例等多方面内容.研究工作在了解SPH方法的理论特点和潜在优势的同时,也为相关问题的深入研究和改进奠定了理论和算法基础.     

Improvement of the second order approximation of the smoothed particle hydrodynamics

The smoothed particle hydrodynamics (SPH), as a fully Lagrangian particle method, has been successfully applied to astrophysical problems and extended to elastic dynamics and computational fluid dynamics.High order derivatives have to be approximated when elastic dynamics problems are modeled. However, the approximation errors in SPH could lead to computational failure in the case that the order of derivative is high.A novel method was proposed in order to improve the accuracy of SPH method, which shows the relationship between the selected functions and their SPH approximations. The entire involved system was represented by a finite number of particles that carry individual mass and occupy individual space, and the integral interpolation was approximated by a summation interpolation. In addition, error comparison was made between SPH method with and without the present improvement.     

矩阵方程AX=B的自反解与反自反解及最佳逼近

给定两个广义反射矩阵P,Q,通常对于矩阵方程AX=B关于P,Q的自反解和反自反解的研究大多是通过矩阵分解或广义奇异值分解来进行的。采用广义逆,建立该方程存在自反解和反自反解的充要条件以及解的一般表达式,并研究与之相关的矩阵最佳逼近问题。     

���ڻ���ʱ�����з������Ķ�ʱ��ͨ��Ԥ���о�

交通流预测分析已成为智能交通的核心研究内容之一。依据混沌时间序列分析方法,建立了短时交通流的预测模型。在对实测的交通流数据进行相空间重构的基础上,综合考虑欧氏距离和均等系数,提出了最邻近点的两步优化选择方法,并采用了局部多项式拟合方法对所选取的最邻近点进行逼近以求得预测公式。本文将此方法运用于东莞东江大道流量预测,比较预测流量和实测流量,得出最大相对误差为0.445％,最小相对误差为0.038％,且单步预测时间仅为38.52秒。结果表明,该预测模型具有较高的精度,同时也能够满足实时性的要求。