Delaunay三角网剖分中嵌入约束边的局部调整算法

提出了一种建立约束Delaunay三角网（CDT）的算法，该算法对约束数据集先建立非约束Delaunay三角网，然后嵌入约束边对其影响域按角度最大原则进行局部调整，同时使其满足CDT的性质。详细地说明了在CDT中嵌入约束边的过程，同时给出了三角网拓扑关系更新的方法，最后对算法的时间效率进行了分析。该算法执行效率高，并且运行稳定。     

PECAS——城市用地和交通集成化模型系统

PECAS是用于城市用地分析和交通预测的集成化模型系统。该系统假定在一个相对较短的时期(通常为一年)内,在整个分析区域生产和消费的各种产品,包括商品、服务、劳工等,能在其各自的交易市场上达到购销平衡。进而,该系统应用一系列NL模型,在各分区之间分派/分布各类生产和消费活动,并据此预测交通需求。同时,该系统还根据各类用地开发几率,对不进入运输市场的用地供应进行单独模拟。这里阐述了PECAS模型系统的基本概念、系统结构、模型构造、计算流程和参数标定,以及与其他用地分析和交通预测模型之间的关系,并扼要介绍了PECAS的实际应用情况。     

中国铁路项目融资模式

在研究铁路项目融资模式设计的原则和铁路建设项目类别的基础上 ,对项目融资的融资模式进行了深入的研究 ,认为 BOT、ABS等五种融资模式可适用于中国铁路项目融资 ,并对以上融资模式在铁路建设项目中的运用作了进一步的探讨。     

磁浮轴承系统的数学模型与控制分析

磁浮轴是一种依赖电磁力支承转子的新型无接触轴承,与传统油润滑轴承相比,具有许多优越性。介绍了磁浮轴承的基本原理和结构,在建立磁浮轴承一对径向定位电磁铁单自由度数学模型的基础上,对该不稳定系统进行了ＰＩＤ补偿控制,研究了控制器参数对系统稳定性的影响。     

柴油机配气机构动力学分析的有限元模型

本文把有限元法应用于柴油机配气机构的动力学分析，建立了配气机构动力学分析的有限元模型，文中采用变长度凸轮单元模拟凸轮升程，把凸轮轴作为一个单元，以考虑凸轮轴的弹性变形；建立了考虑支座弹性变形的摇臂单元模型，简化了有限元计算；针对配气机构的特点，分阶段进行计算，不同阶段取不同计算对象，从而解决了柴油机配气机构动力学有限元计算中的一些难题，提高了计算精度。     

机车控制系统数学模型的研究

分析了电传动内燃机车控制系统结构及电机转速的变化，电机磁路的饱和，电枢反应对模型参数的影响；建立了内燃机车控制系统的数学模型结构，并通过实验数据获得模型参数，解决了系统线性化问题。     

SUE�����м��ֳ���·��ѡ��ģ�͵ıȽ��о�

对SUE问题中几种常用的路线选择模型进行了分类研究，重点介绍了它们各自的理论基础并比较了其差异，且通过多个算例分析了它们各自的表现效果．结果表明，同一网络中各个模型的表现效果不一定相同，不同网络中同一模型的表现效果也有所差异．这一研究对交通配流中的路线选择问题具有重要的指导意义，表明现有研究中常出现的通过单个选择模型或单个网络得出的结论并不一定可靠，应该根据模型和网络的特点谨慎选择．     

Border crossing delay prediction using transient multi-server queueing models

As a result of the continued increase in travel demand coupled with the need for tighter security and inspection procedures after September 11, border crossing delay has recently become a critical issue with tremendous economic and social costs. The current paper develops multi-server queuing models to estimate border crossing delay in support of a predictive traveler information system for the crossings. Two classes of multi-server models are considered: (1) models with exponential inter-arrival times and Erlang service times; and (2) a more generic model with a Batch Markovian Arrival Process (BMAP) and phase types (PH) services. As a case study, the models are developed based on real-time traffic volume and inspection time data collected at one of the major US–Canada border crossings, the Peace Bridge, and their transient solution is obtained using heuristic methods. For validation, the queueing models’ estimates are compared to the results from a detailed microscopic traffic simulation model of the Peace Bridge border crossing. The comparison shows that the transient queueing model, along its heuristic solution algorithm, is capable of predicting border crossing delay. Finally, a set of sensitivity analysis tests are conducted, and the developed models are incorporated within an optimization framework to help inform border crossing management strategies.     

System optimal dynamic traffic assignment: Properties and solution procedures in the case of a many-to-one network

Thanks to its high dimensionality and a usually non-convex constraint set, system optimal dynamic traffic assignment remains one of the most challenging problems in transportation research. This paper identifies two fundamental properties of the problem and uses them to design an efficient solution procedure. We first show that the non-convexity of the problem can be circumvented by first solving a relaxed problem and then applying a traffic holding elimination procedure to obtain the solution(s) of the original problem. To efficiently solve the relaxed problem, we explore the relationship between the relaxed problems based on different traffic flow models (PQ, SQ, CTM) and a minimal cost flow (MCF) problem for a special space-expansion network. It is shown that all the four problem formulations produce the same minimal system cost and share one common solution which does not involve inside queues in the network. Efficient solution algorithms such as the network simplex method can be applied to solve the MCF problem and identify such an optimal traffic pattern. Numerical examples are also presented to demonstrate the efficiency of the proposed solution procedure.     

Implementing first-in–first-out in the cell transmission model for networks

In traffic assignment models with time-varying flows (dynamic network loading or dynamic traffic assignment), overtaking behaviour is normally not included in the model and, in that case, it is important that the model at least approximates first-in–first-out (FIFO), to prevent deviations from FIFO that are arbitrary or unrealistic or not physically possible. For the cell transmission model (CTM) it has recently been shown that the usual recommended method for preserving FIFO will ensure FIFO for each cell taken separately but does not fully ensure FIFO in the transition between cells and hence does not fully ensure FIFO for sequences of cells or for links or for routes. As a result, deviations from FIFO can easily occur and cumulate along the links or routes. In view of that, we define and analyse three different levels of satisfaction or approximation of FIFO, together with corresponding methods for achieving them. Two of these are existing methods and one is new. We develop, analyse and compare the three methods and the extent to which each of them adheres to FIFO for sequences of cells and links or routes. Also, for two of the methods we present a more detailed algorithm for applying them within the CTM. The paper is concerned with how to implement FIFO in the CTM and not with testing for FIFO or measuring deviations from FIFO.