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

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

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

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

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

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

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.     

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.     

基于流体逼近的路段交通流动态加载研究

路段交通流动态加载是动态交通网络分配模型中的重要组成部分,在路段交通流动态加载中,离散形式或者连续形式的点排队模型被广泛使用.本文在以往研究的基础上,提出基于流体逼近的连续型点排队模型,克服了原有点排队模型中排队负值的情况.通过分析可以发现,原有点排队模型实质上属于具有单一服务台和无限容量的排队模型,基于流体逼近的思想重新定义了原有点排队模型.其中3 个主要部分是流量守恒模型,车辆流出模型和时间相关的服务台模型,这3 个模型全部都是连续的.由于连续点排队对计算需求较高,本文将连续的排队模型离散化,模拟了3 种不同场景下车辆驶出、路段排队情况.本文模型克服了原有点排队中的负排队现象,并且排队过程满足先进先出的原则,模型具有良好的模拟效果.     

提高级配指标计算精度方法研究

级配曲线是颗粒分析试验的重要成果图件,用其计算的不均匀系数Cu与曲率系数Cc是路基填料划分的重要指标。传统作图法整理级配曲线时,工作量大且精度不高。在分析线性插值、多项式插值、Lagrange插值与分段抛物线插值算法的基础上,提出了修正样条函数拟合的方法,得到土的光滑颗粒级配曲线。针对非单调样条函数,采用最佳逼近算法求解,克服了曲线出现平台时病态函数问题。文中提供了求解的关键代码,实践表明该法可以提高计算级配指标的精度和自动化程度。     

Properties and Relations of Several Operators Based on Covering Rough Sets

The covering rough sets theory is a generalization of traditional rough set theory,and can also describe information with incompleteness and fuzziness in information systems.In this paper,we first provide the definitions of several upper and lower covering approximation operators on the covering approximation space.Then,we study the properties of these operators.Finally,we propose the mutual relations between approximation operators and similar relations of the operator(Ⅰ)based on the covering rough sets.     

拟“车-桥耦合系统”的动态近似分析法

目前对于车体通过桥梁的动力响应问题,通常是将车辆子系统和桥梁结构耦合为一个系统,同时进行分析.文中提出一种近似但具有足够精度的方法用以计算车-桥耦合系统的动力响应.将车-桥耦合方程分解为两个部分,忽略作用在桥梁上的由移动车辆产生的惯性力项,只剩下移动力项.计算出桥梁在移动力作用下的响应,并把此响应作为车体动力响应的激励源反馈给车体,从而计算出车体的响应.从数值计算的角度,采用MATLAB编程并与车桥耦合系统精确的数值解作对比,验证了轻车过重桥情况下本文方法的可行性.通过分析表明,此方法能避免车-桥耦合系统计算时的庞大运算.