Transit assignment under crowded conditions

This paper presents a transit assignment algorithm for crowded networks. Both congestion in vehicles and queuing at stations are explicitly taken into account in predicting passenger flows for a fixed pattern of origin-destination trip demands. The overflow effects due to insufficient capacity of transit lines are considered to be concentrated at transit stations, while the in-vehicle congestion effects (or discomforts) are considered to be dependent on in-vehicle passenger volume. Overflow delay at a transit station is dependent on the number of excess passengers required to wait for the next transit car. We use a logit model to determine the split between passengers that chose to wait for the next transit car and passengers that chose to board on the alternative transit lines. The proposed algorithm predicts how passenger will choose their optimal routes under both queuing and crowded conditions.     

A study of passenger discomfort measures at the Hong Kong mass transit railway system

This note investigates the important attributes relating to the crowding effects at the Mass Transit Railway (MTR) stations in Hong Kong. Data was collected at two sets of three MTR stations to study the responses of the passengers due to the discomfort at crowded vehicles and platforms. Stated preference surveys were used to study the effects of passenger discomfort measures.     

Analysis of Driver's Decelerating Strategy in a Car-following Situation

This report describes a decelerating driver-model expressed by driving mode transition in car-following situations. The assumptions for constructing the model are that decelerating strategy of a driver is classified into several simple driving modes and that a driver changs his driving modes based on his perceptible characteristics and experiential rules. Deceleration action is divided into three states; following, standing and braking, which are applied to the model. The model has two paths for driver's decelerating action, one of which is selected by the driver based on the perceptible characteristics and experiential rules. The suitability of the model has been experimentally verified.     

Driver requirements and road traffic informatics

Initially the driver's role as a link in the driver-vehicle-road-traffic control-chain is discussed in a historical perspective. The gradual changes and the advantages and problems arising from these changes are discussed from behavioural point of view.Then the driver tasks are analyzed. A separation is made between trip planning, navigation, road following, traffic interaction, rule compliance, other than traffic tasks, car handling and speed choice. The relations between and the weights of these subtasks are discussed. Some existing driver behaviour models are reviewed in relation to the above mentioned tasks.Finally an effort is made based on the analyses of driver tasks and driver models to specify some general and some more specific potential advantages and problems with expected future RTI-systems.     

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.     

A simple formulation for predicting the ultimate strength of ships

The aim of this study is to derive a simple analytical formula for predicting the ultimate collapse strength of a single- and double-hull ship under a vertical bending moment, and also to characterize the accuracy and applicability for earlier approximate formulations. It is known that a ship hull will reach the overall collapse state if both collapse of the compression flange and yielding of the tension flange occur. Side shells in the vicinity of the compression and the tension flanges will often fail also, but the material around the final neutral axis will remain in the elastic state. Based on this observation, a credible distribution of longitudinal stresses around the hull section at the overall collapse state is assumed, and an explicit analytical equation for calculating the hull ultimate strength is obtained. A comparison between the derived formula and existing expressions is made for largescale box girder models, a one-third-scale frigate hull model, and full-scale ship hulls.List of symbols A _B total sectional area of outer bottom - A _B total sectional area of inner bottom - A _D total sectional area of deck - A _S half-sectional area of all sides (including longitudinal bulkheads and inner sides) - a _s sectional area of a longitudinal stiffener with effective plating - b breadth of plate between longitudinal stiffeners - D hull depth - D _B height of double bottom - E Young's modulus - g neutral axis position above the base line in the sagging condition or below the deck in the hogging condition - H depth of hull section in linear elastic state - I _s moment of inertia of a longitudinal stiffener with effective plating - l length of a longitudinal stiffener between transverse beams - M _E elastic bending moment - M _p fully plastic bending moment of hull section - M _u ultimate bending moment capacity of hull section - M _uh ,M _us ultimate bending moment in hogging or sagging conditions - r radius of gyration of a longitudinal stiffener with effective plating [=(I _s /a _s )^1/2] - t plate thickness - Z elastic section modulus at the compression flange - Z _B ,Z _D elastic section modulus at bottom or deck - slenderness ratio of plate between stiffeners [= (b/t)(_y/E)^1/2] - slenderness ratio of a longitudinal stiffener with effective plating [=(l/r)(_y/E)^1/2] - _y yield strength of the material - _yB , _yB , _yD yield strength of outer bottom, inner bottom - _yS deck, or side - _u ultimate buckling strength of the compression flange - _uB , _uB , _uD ultimate buckling strength of outer bottom - _uS inner bottom, deck, or side     

Cycle-simulation turbulence modelling of IC engines

Numerical simulations of IC engines are of high interest for automotive engineers worldwide. The simulation models should be as fast as possible, low-computational effort and predictive tool. The correct prediction of turbulence level inside the combustion chamber of spark ignition engines is the most important factor influencing to the engine working cycle. This paper presents a development of the k-ε turbulence model applied to the commercial cycle-simulation software with the high emphasis on the intake part. The validation was performed on two engine geometries with the variation of engine speed and load comparing the cycle-simulation results of the turbulent kinetic energy and in-cylinder temperature with 3-D CFD results. In order to apply the cycle-simulation turbulence model for the simulation of entire engine map, the parameterization model of turbulence constants was proposed. The parameterized turbulence model was optimized using NLPQL optimization algorithm where the single set of turbulence model parameters for each engine was found. A good agreement of the turbulent kinetic energy during the expansion was achieved when the turbulence affects the flame front propagation and combustion rate as well.     

Biogeography-based combinatorial strategy for efficient autonomous underwater vehicle motion planning and task-time management

Autonomous Underwater Vehicles (AUVs) are capable of spending long periods of time for carrying out various underwater missions and marine tasks. In this paper, a novel conflict-free motion planning framework is introduced to enhance underwater vehicle’s mission performance by completing maximum number of highest priority tasks in a limited time through a large scale waypoint cluttered operating field, and ensuring safe deployment during the mission. The proposed combinatorial route-path planner model takes the advantages of the Biogeography-Based Optimization (BBO) algorithm toward satisfying objectives of both higher-lower level motion planners and guarantees maximization of the mission productivity for a single vehicle operation. The performance of the model is investigated under different scenarios including the particular cost constraints in time-varying operating fields. To show the reliability of the proposed model, performance of each motion planner assessed separately and then statistical analysis is undertaken to evaluate the total performance of the entire model. The simulation results indicate the stability of the contributed model and its feasible application for real experiments.     

Robust traffic assignment model: Formulation,solution algorithms and empirical application

ABSTRACT

The deterministic traffic assignment problem based on Wardrop's first criterion of traffic network utilization has been widely studied in the literature. However, the assumption of deterministic travel times in these models is restrictive, given the large degree of uncertainty prevalent in urban transportation networks. In this context, this paper proposes a robust traffic assignment model that generalizes Wardrop's principle of traffic network equilibrium to networks with stochastic and correlated link travel times and incorporates the aversion of commuters to unreliable routes.

The user response to travel time uncertainty is modeled using the robust cost (RC) measure (defined as a weighted combination of the mean and standard deviation of path travel time) and the corresponding robust user equilibrium (UE) conditions are defined. The robust traffic assignment problem (RTAP) is subsequently formulated as a Variational Inequality problem. To solve the RTAP, a Gradient Projection algorithm is proposed, which involves solving a series of minimum RC path sub-problems that are theoretically and practically harder than deterministic shortest path problems. In addition, an origin-based heuristic is proposed to enhance computational performance on large networks. Numerical experiments examine the computational performance and convergence characteristics of the exact algorithm and establish the accuracy and efficiency of the origin-based heuristic on various real-world networks. Finally, the proposed RTA model is applied to the Chennai road network using empirical data, and its benefits as a normative benchmark are quantified through comparisons against the standard UE and System Optimum (SO) models.