考虑拥堵空间排队与溢出的道路网静态交通流分配

为刻画拥堵空间排队与溢出现象对交通流分配的影响，提出考虑拥堵空间排队与溢出的道路网静态交通流分配问题，并构建相关的求解算法，用于描述交通需求在起讫点移动过程中路网整体的宏观运行状态。首先，丰富和完善考虑拥堵空间排队与溢出的静态交通流分配的相关假设，提出次生瓶颈、拥堵干扰与渗透和分段化路段阻抗等基本概念和理论，来刻画拥堵交通瓶颈、拥堵空间排队等交通现象；其次，建立网络瓶颈识别算法和空间排队回溯算法，基于此构建考虑拥堵空间排队和溢出的增量分配算法，用于求解交通流分配的结果；最后，通过使用一个具有说明型的算例进行对比分析。研究结果表明：建立的瓶颈识别、排队回溯和增量分配算法可以识别路网中的瓶颈位置及其拥堵排队区域，并可计算得到各路段上的分段分配流量；与点排队只影响瓶颈路段的运行状况和均一的路段分配结果相比，可有效描述路网整体的宏观运行状态以及由于拥堵空间排队所导致的拥堵干扰与渗透现象；不同于“时间片”的伪动态交通流分配模型，新建算法的分配结果是“全时段”与“整体性”的路网宏观运行状态，包含了拥堵瓶颈的具体位置和空间排队的干扰与渗透情况；一般拥堵点排队模型和基于“时间片”的拥堵空间排队模型难以刻画拥堵干扰与渗透现象以及路网整体的宏观运行状态，故所建立的分配方法是对传统拥堵交通流分配的丰富和发展。     

杭州城市交通拥挤现状及对策

在分析杭州市交通供需现状的基础上,提出了规划多中心结构和混合功能区,以减少不必要的出行以及合理配置交通源,并对改善中心区交通提出切实可行的对策。     

The design of bus route systems — An interactive location-allocation approach

An interactive modelling approach is developed to solve the practical problem of bus route network design. Possible bus routes are identified with facilities which can be located. Zones or pairs of zones in the urban area are identified with customers who will be allocated to the established facilities. It is shown that the classical Set Covering Problem is useful under the assumption of fixed demand; the Simple Plant Location Problem is effective under the assumption of demand which is sensitive to the level of bus service provided.     

试论铁路职业卫生管理与技术服务支持

广州铁路集团公司是我国第一家铁路运输企业集团,职业卫生工作一直是企业卫生工作的重点,职业卫生管理和职业卫生技术服务也是企业履行社会责任、建立＂以人为本＂的现代企业制度的重要组成。通过分析铁路行业职业危害特点和职业卫生管理方面存在的问题,结合长期从事职业卫生技术服务工作的实践,提出加强与改进铁路企业职业卫生工作的对策,旨在助于促进《职业病防治法》在企业的全面贯彻落实。     

既有铁路扩能改造若干问题探讨

研究目的:根据新的技术政策、新的标准规范等要求,通过对既有线扩能改造中出现的与新的标准规范不相适应的若干问题的分析研究、对既有线通行双层集装箱的合理性及增建二线后改变维修体制的探讨,提出了觖决既有线扩能改造工程若干问题的基本思路。研究结论:对于既有线扩能改造工程的一些问题,应根据项目的特点,在本着避免既有线大拆大改、节省工程投资的原则下,结合铁路新的技术发展方向、新的标准规范要求,采取具体问题具体分析,对于新建线路应不折不扣地执行新的标准规范,对既有线改建则应充分考虑到既有线的现状特点,在满足项目功能需求的情况下,应尽可能地与新的标准、规范相适应,并应考虑未来的发展需要。     

Total cost analysis: An alternative to benefit-cost analysis in evaluating transportation alternatives

This paper explains the theory in support of total cost analysis (TCA) to compare transportation system alternatives. The full costs of each alternative are first aggregated, including travel time costs and monetizable environmental and social costs. Many costs which are considered on the benefits side of the equation in benefit-cost analysis (BCA) as "cost savings" are brought over to the costs side. Total cost differences among alternatives are then traded off against their estimated non-monetized benefits or impacts, just as a consumer trades off product quality against cost before deciding which product he or she will buy. One advantage of TCA over traditional BCA is that the concept of "total cost" is more easily understood by the public and by political decision-makers than BCA concepts such as "net present worth", "benefit-cost ratio" and "internal rate of return". A second advantage is that there is no suggestion that all "benefits" have been considered; decision-makers are free to use their own value judgements to trade off total cost against non-monetizable social, environmental and economic impacts, just as they trade off quality and convenience against cost when purchasing goods and services in their roles as consumers. The TCA approach is demonstrated in this paper through a case study of two systemwide alternatives for the Baltimore, MD urban area.     

多货物品种集装化运输的优化调度问题

用数学模型描述了供应商根据某一用户在各个不同时间段内对不同货物的需求量情况,利用各种不同型号的箱体进行分时段货物发送的问题。其最终目的是为了求得能够使运输成本和存储成本达到最小的货物发送方案,该问题是一个由批量问题和拼箱问题所组成的复合问题。就此问题,提出了一种三阶段算法。通过理论分析,该算法可以有效地解决此类问题。     

高速公路常发性交通拥挤路段实时判定与跟踪研究

提出的自动判定和实时跟踪高速公路常发性拥挤路段的方法包含3个算法：①路段平均车速算法；②交通流区段类型判定算法；③排队类型判定算法。考虑采用两个前后相邻车辆检测站之间的路段平均车速来实时判定和跟踪常发性交通拥挤路段的情况，使得模型所提供的信息更能反映路段的真实交通状况。采用路段平均车速的方法克服了目前采用点速度来跟踪车队方法的局限性，并且采用“客观”标定临界车速作为基于现场数据判定车队状态的一种方法。     

Travel time estimation from sparse floating car data with consistent path inference: A fixed point approach

Estimation of urban network link travel times from sparse floating car data (FCD) usually needs pre-processing, mainly map-matching and path inference for finding the most likely vehicle paths that are consistent with reported locations. Path inference requires a priori assumptions about link travel times; using unrealistic initial link travel times can bias the travel time estimation and subsequent identification of shortest paths. Thus, the combination of path inference and travel time estimation is a joint problem. This paper investigates the sensitivity of estimated travel times, and proposes a fixed point formulation of the simultaneous path inference and travel time estimation problem. The methodology is applied in a case study to estimate travel times from taxi FCD in Stockholm, Sweden. The results show that standard fixed point iterations converge quickly to a solution where input and output travel times are consistent. The solution is robust under different initial travel times assumptions and data sizes. Validation against actual path travel time measurements from the Google API and an instrumented vehicle deployed for this purpose shows that the fixed point algorithm improves shortest path finding. The results highlight the importance of the joint solution of the path inference and travel time estimation problem, in particular for accurate path finding and route optimization.     

Tradable network permits: A new scheme for the most efficient use of network capacity

Akamatsu et al. (2006) proposed a new transportation demand management scheme called “tradable bottleneck permits” (TBP), and proved its efficiency properties for a single bottleneck model. This paper explores the properties of a TBP system for general networks. An equilibrium model is first constructed to describe the states under the TBP system with a single OD pair. It is proved that equilibrium resource allocation is efficient in the sense that the total transportation cost in a network is minimized. It is also shown that the “self-financing principle” holds for the TBP system. Furthermore, theoretical relationships between TBP and congestion pricing (CP) are discussed. It is demonstrated that TBP has definite advantages over CP when demand information is not perfect, whereas both TBP and CP are equivalent for the perfect information case. Finally, it is shown that the efficiency result also holds for more general demand conditions.