轻型货车转向架试验简介

介绍了为美国315K货车开发的轻型转向架在FAST试验线的试验结果.     

Plate scanning tools to obtain travel times in traffic networks

The management of vehicle travel times has been shown to be fundamental to traffic network analysis. To collect travel time measurement, some methods focus solely on isolated links or highway segments, and where two measurement points, at the beginning and at the end of a section, are deemed sufficient to evaluate users' travel time. However, in many cases, transport studies involve networks in which the problem is more complex. This article takes advantage of the plate scanning technique to propose an algorithm that minimizes the required number of registering devices and their location in order to identify vehicles candidates to compute the travel times of a given set of routes (or subroutes). The merits of the proposed method are explained using simple examples and are illustrated by its application to the real network of Ciudad Real.     

先进的铁道车辆检查系统

先进的铁道车辆检查系统能提高铁路的安全性、降低成本并改善客户服务.本文重点介绍了闸瓦和车轮轮廓检查系统的试验、现场考验和运用情况.     

Genetics of traffic assignment models for strategic transport planning

This paper presents a review and classification of traffic assignment models for strategic transport planning purposes by using concepts analogous to genetics in biology. Traffic assignment models share the same theoretical framework (DNA), but differ in capability (genes). We argue that all traffic assignment models can be described by three genes. The first gene determines the spatial capability (unrestricted, capacity restrained, capacity constrained, and capacity and storage constrained) described by four spatial assumptions (shape of the fundamental diagram, capacity constraints, storage constraints, and turn flow restrictions). The second gene determines the temporal capability (static, semi-dynamic, and dynamic) described by three temporal assumptions (wave speeds, vehicle propagation speeds, and residual traffic transfer). The third gene determines the behavioural capability (all-or-nothing, one shot, and equilibrium) described by two behavioural assumptions (decision-making and travel time consideration). This classification provides a deeper understanding of the often implicit assumptions made in traffic assignment models described in the literature. It further allows for comparing different models in terms of functionality, and paves the way for developing novel traffic assignment models.     

Correcting injection pressure maladjustments to reduce NOX emissions by marine diesel engines

Emissions from the exhausts of marine diesel engines comprises several different gases including NO_X. These are currently regulated at the international level under Regulation 13 of ANNEX VI of MARPOL 73/78, but this regulation only applies to new engines and is based on bench tests, for only a single engine designated the “parent engine”. Here, the need to take measurements from across their whole range and once in operation on board a vessel is examined. This would not only improve assessment of new equipment against the current regulation, but would also detect defects in the functioning of the engine.     

Equilibria of bilateral taxi–customer searching and meeting on networks

This paper proposes an equilibrium model to characterize the bilateral searching and meeting between customers and taxis on road networks. A taxi driver searches or waits for a customer by considering both the expected searching or waiting time cost and ride revenue, and a customer seeks a taxi ride to minimize full trip price. We suppose that the bilateral taxi–customer searching and meeting occurs anywhere in residential and commercial zones or at prescribed taxi stands, such as an airport or a railway station. We propose a meeting function to spell out the search and meeting frictions that arise endogenously as a result of the distinct spatial feature of the area and the taxi–customer moving decisions. With the proposed meeting function and the assumptions underlying taxi–customer search behaviors, the stationary competitive equilibrium achieved at fixed fare prices is determined when the demand of the customers matches the supply of taxis or there is market clearing at the prevailing searching and waiting times in every meeting location. We establish the existence of such an equilibrium by virtue of Brouwer’s fixed-point theorem and demonstrate its principal operational characteristics with a numerical example.     

A frequency-based maritime container assignment model

This paper transfers the classic frequency-based transit assignment method of Spiess and Florian to containers demonstrating its promise as the basis for a global maritime container assignment model. In this model, containers are carried by shipping lines operating strings (or port rotations) with given service frequencies. An origin–destination matrix of full containers is assigned to these strings to minimize sailing time plus container dwell time at the origin port and any intermediate transhipment ports. This necessitated two significant model extensions. The first involves the repositioning of empty containers so that a net outflow of full containers from any port is balanced by a net inflow of empty containers, and vice versa. As with full containers, empty containers are repositioned to minimize the sum of sailing and dwell time, with a facility to discount the dwell time of empty containers in recognition of the absence of inventory. The second involves the inclusion of an upper limit to the maximum number of container moves per unit time at any port. The dual variable for this constraint provides a shadow price, or surcharge, for loading or unloading a container at a congested port. Insight into the interpretation of the dual variables is given by proposition and proof. Model behaviour is illustrated by a simple numerical example. The paper concludes by considering the next steps toward realising a container assignment model that can, amongst other things, support the assessment of supply chain vulnerability to maritime disruptions.     

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.