船用柴油机组调速系统仿真研究

模拟电力系统的模拟研究中,柴油机及其调速系统直接影响系统机电暂态过程的准确性,对于判别系统受到大扰动后的暂态稳定和受到小扰动后的静态稳定性具有重要意义。从电站柴油发电机组的运动方程出发,在柴油机及其调速器数学模型的基础上,利用数字仿真计算机实时计算模拟转矩指令,用以控制一套高性能交流调速系统,从而实现电站柴油发电机组中柴油机及其调速器与系统转动惯量的数模混合模拟。实验表明,该模拟系统通用性强,响应速度快,准确性较高。     

船用曳引式升降机动力学建模及仿真分析

对船用升降机动态特性的研究一直以来都是升降机研究领域的一个薄弱环节。针对船用升降机的特殊性,根据曳引式升降机的物理模型建立升降机垂直方向上的动力学模型,并结合模态分析法研究该模型,得出升降机位置对其固有频率的影响。以船体振动中螺旋桨和主机振动频率为激励频率,将理想电气速度曲线引入系统中,运用Matlab软件模拟系统响应的全过程,得出船用升降机的一些基本运行特性。     

轮胎式龙门起重机转向阻力动态分析

介绍了龙门吊的转向台车.应用ADAMS/Tire模块建立仿真模型对轮胎式龙门起重机原地转向过程中的阻力变化进行动态分析,得出转向阻力与转向速度之间的关系.对龙门吊转向提出合理建议.     

A generic class of first order node models for dynamic macroscopic simulation of traffic flows

Node models for macroscopic simulation have attracted relatively little attention in the literature. Nevertheless, in dynamic network loading (DNL) models for congested road networks, node models are as important as the extensively studied link models. This paper provides an overview of macroscopic node models found in the literature, explaining both their contributions and shortcomings. A formulation defining a generic class of first order macroscopic node models is presented, satisfying a list of requirements necessary to produce node models with realistic, consistent results. Defining a specific node model instance of this class requires the specification of a supply constraint interaction rule and (optionally) node supply constraints. Following this theoretical discussion, specific macroscopic node model instances for unsignalized and signalized intersections are proposed. These models apply an oriented capacity proportional distribution of the available supply over the incoming links of a node. A computationally efficient algorithm to solve the node models exactly is included.     

Schedule-based transit assignment model with vehicle capacity and seat availability

In this paper, we propose a new schedule-based equilibrium transit assignment model that differentiates the discomfort level experienced by sitting and standing passengers. The notion of seat allocation has not been considered explicitly and analytically in previous schedule-based frameworks. The model assumes that passengers use strategies when traveling from their origin to their destination. When loading a vehicle, standing on-board passengers continuing to the next station have priority to get available seats and waiting passengers are loaded on a First-Come-First-Serve (FCFS) principle. The stimulus of a standing passenger to sit increases with his/her remaining journey length and time already spent on-board. When a vehicle is full, passengers unable to board must wait for the next vehicle to arrive. The equilibrium conditions can be stated as a variational inequality involving a vector-valued function of expected strategy costs. To find a solution, we adopt the method of successive averages (MSA) that generates strategies during each iteration by solving a dynamic program. Numerical results are also reported to show the effects of our model on the travel strategies and departure time choices of passengers.     

Clockwise hysteresis loops in the Macroscopic Fundamental Diagram: An effect of network instability

A recent study reported that the Macroscopic Fundamental Diagram of a medium size city exhibited a clockwise hysteresis loop on a day in which a major disturbance caused many drivers to use unfamiliar routes. It is shown below that, even in a perfectly symmetric network with uniform demand, clockwise loops are to be expected when there are disturbances, especially if the disturbances cause a significant fraction of the drivers to not change routes adaptively. It is also shown that when drivers are not adaptive networks are inherently more unstable as they recover from congestion than as they are loaded. In other words, during recovery congestion tends more strongly toward unevenness because very congested areas clear more slowly than less congested areas. Since it is known that uneven congestion distributions reduce network flows, it follows that lower network flows should arise during recovery, resulting in clockwise loops. Fortunately, the presence of a sufficient number of drivers that choose routes adaptively to avoid congested areas helps to even out congestion during recovery, increasing flow. Thus, clockwise loops are less likely to occur when driver adaptivity is high.     

Frequency-based transit assignment considering seat capacities

This paper proposes a frequency-based assignment model that considers travellers probability of finding a seat in their perception of route cost and hence also their route choice. The model introduces a “fail-to-sit” probability at boarding points with travel costs based on the likelihood of travelling seated or standing. Priority rules are considered; in particular it is assumed that standing on-board passengers will occupy any available seats of alighting passengers before newly boarding passengers can fill any remaining seats. At the boarding point passengers are assumed to mingle, meaning that FIFO is not observed, as is the case for many crowded bus and metro stops, particularly in European countries. The route choice considers the common lines problem and an user equilibrium solution is sought through a Markov type network loading process and the method of successive averages. The model is first illustrated with a small example network before being applied to the inner zone of London’s underground network. The effect of different values passengers might attach to finding a seat are illustrated. Applications of the model for transit planning as well as for information provision at the journey planner stage are discussed.     

Modeling heterogeneous risk-taking behavior in route choice: A stochastic dominance approach

This paper proposes a unified approach to modeling heterogonous risk-taking behavior in route choice based on the theory of stochastic dominance (SD). Specifically, the first-, second-, and third-order stochastic dominance (FSD, SSD, TSD) are respectively linked to insatiability, risk-aversion and ruin-aversion within the framework of utility maximization. The paths that may be selected by travelers of different risk-taking preferences can be obtained from the corresponding SD-admissible paths, which can be generated using general dynamic programming. This paper also analyzes the relationship between the SD-based approach and other route choice models that consider risk-taking behavior. These route choice models employ a variety of reliability indexes, which often make the problem of finding optimal paths intractable. We show that the optimal paths with respect to these reliability indexes often belong to one of the three SD-admissible path sets. This finding offers not only an interpretation of risk-taking behavior consistent with the SD theory for these route choice models, but also a unified and computationally viable solution approach through SD-admissible path sets, which are usually small and can be generated without having to enumerate all paths. A generic label-correcting algorithm is proposed to generate FSD-, SSD-, and TSD-admissible paths, and numerical experiments are conducted to test the algorithm and to verify the analytical results.     

Real time queue length estimation for signalized intersections using travel times from mobile sensors

We study how to estimate real time queue lengths at signalized intersections using intersection travel times collected from mobile traffic sensors. The estimation is based on the observation that critical pattern changes of intersection travel times or delays, such as the discontinuities (i.e., sudden and dramatic increases in travel times) and non-smoothness (i.e., changes of slopes of travel times), indicate signal timing or queue length changes. By detecting these critical points in intersection travel times or delays, the real time queue length can be re-constructed. We first introduce the concept of Queue Rear No-delay Arrival Time which is related to the non-smoothness of queuing delay patterns and queue length changes. We then show how measured intersection travel times from mobile sensors can be processed to generate sample vehicle queuing delays. Under the uniform arrival assumption, the queuing delays reduce linearly within a cycle. The delay pattern can be estimated by a linear fitting method using sample queuing delays. Queue Rear No-delay Arrival Time can then be obtained from the delay pattern, and be used to estimate the maximum and minimum queue lengths of a cycle, based on which the real-time queue length curve can also be constructed. The model and algorithm are tested in a field experiment and in simulation.     

基于应变模态的车轴动应力仿真计算

基于动车组的动车车轴和拖车车轴的应变模态分析结果,结合线路实测数据,运用模态叠加法对动车组车轴进行了动应力的仿真计算,得出了两种车轴上相应测点的应力时间历程,并与线路测试数据进行了比较．结果表明：经过仿真计算得到的测点应力时间历程与实测结果比较吻合,从而验证了将应变模态与测试数据结合计算动应力的可行性,可以进一步开展疲劳强度分析．