埠阳庄大桥复杂地质条件下的桩基施工

埠阳庄大桥实际地质状况复杂,重点介绍该桥桩基施工中的相关准备工作以及对问题的分析和处理措施,为同类地质条件下梁桩基施工提供借鉴经验。     

Railway reforms: do they influence operating efficiency?

This paper considers railway operations in 23 European countries during 1995–2001, where a series of reform initiatives were launched by the European Commission, and analyses whether these reform initiatives improved the efficiency of the railway systems. Efficiency is measured using Multi-directional Efficiency Analysis, which enables investigation of how railway reforms affect the inefficiencies of specific cost drivers. The main findings are that the reform initiatives generally improve technical efficiency but potentially differently for different cost drivers. Specifically, the paper provides empirical evidence that accounting separation is important for improving the efficiency in the use of both material and staff costs, whereas other reforms only influenced one of these factors.

Multiple criteria optimization method for the vehicle assignment problem in a bus transportation company

A vehicle assignment problem (VAP) in a road, long‐haul, passenger transportation company with heterogeneous fleet of buses is considered in the paper. The mathematical model of the VAP is formulated in terms of multiobjective, combinatorial optimization. It has a strategic, long‐term character and takes into account four criteria that represent interests of both passengers and the company's management. The decision consists in the definition of weekly operating frequency (number of rides per week) of buses on international routes between Polish and Western European cities. The VAP is solved in a step‐wise procedure. In the first step a sample of efficient (Pareto‐optimal) solutions is generated using an original metaheuristic method called Pareto Memetic Algorithm (PMA). In the second step this sample is reviewed and evaluated by the Decision Maker (DM). In this phase an interactive, multiple criteria analysis method with graphical facilities, called Light Beam Search (LBS), is applied. The method helps the DM to define his/her preferences, direct the search process and select the most satisfactory solution.     

You (expect to) get what you pay for: A system approach to delay, fare, and complaints

In this paper, an analytical framework integrating delay, fare, and complaints with passenger air travel has been laid out. Examining aggregate monthly data for US domestic air travel, we have identified causal relationships among fare, complaints, and levels of delay. An analytical framework is proposed that formalizes these relationships in an integrated manner. This integrated framework is then estimated in a set of simultaneous equations by using 118 months of data from January 1997 to October 2006. Results show that complaints are influenced by levels of delays. However, complaints are positively influenced by average yield. These findings lead us to support the central hypothesis that complaints are responsive to levels of delays, but they tend to vary according to fare. That is, air travelers are less likely to complain in return for lower fares, even when faced with the same or even higher levels of delays. These findings have important policy implications, including the passengers’ bill of rights and regulator’s choice between market and operational performances.     

Severity of injury resulting from pedestrian–vehicle crashes: What can we learn from examining the built environment?

This paper examines the impact of personal and environmental characteristics on severity of injuries sustained in pedestrian–vehicle crashes using a generalized ordered probit model. The data covers 2000–2004 of pedestrian–vehicle crashes taken from police incident reports for Baltimore City and supplemented with local land use, urban form and transportation information specific to the individual crash locations. The results on personal and behavioral variables confirm previous findings. Women pedestrians involved in crashes tend to be injured less frequently than their male counterparts; children have an increased likelihood of sustaining injuries and older persons are more likely to be fatally injured. Pedestrians who cross against the traffic signal, are not in a crosswalk and are involved in a crash after dark are associated with greater injury risk. Of the built environment policy variables of interest, transit access and greater pedestrian connectivity, such as central city areas, are significant and negatively associated with injury severity. These results suggest that the environmental conditions should be given more scrutiny and be an important consideration when evaluating and planning for pedestrian safety.     

Bush-based sensitivity analysis for approximating subnetwork diversion

Subnetwork analysis is often used in traffic assignment problems to reduce the size of the network being analyzed, with a corresponding decrease in computation time. This is particularly important in network design, second-best pricing, or other bilevel problems in which many equilibrium runs must be solved as a subproblem to a master optimization program. A fixed trip table based on an equilibrium path flow solution is often used, but this ignores important attraction and diversion effects as drivers (globally) change routes in response to (local) subnetwork changes. This paper presents an approach for replacing a regional network with a smaller one, containing all of the subnetwork, and zones. Artificial arcs are created to represent “all paths” between each origin and subnetwork boundary node, under the assumption that the set of equilibrium routes does not change. The primary contribution of the paper is a procedure for estimating a cost function on these artificial arcs, using derivatives of the equilibrium travel times between the end nodes to create a Taylor series. A bush-based representation allows rapid calculation of these derivatives. Two methods for calculating these derivatives are presented, one based on network transformations and resembling techniques used in the analysis of resistive circuits, and another based on iterated solution of a nested set of linear equations. These methods are applied to two networks, one small and artificial, and the other a regional network representing the Austin, Texas metropolitan area. These demonstrations show substantial improvement in accuracy as compared to using a fixed table, and demonstrate the efficiency of the proposed approach.     

Vulnerability analysis for large-scale and congested road networks with demand uncertainty

To assess the vulnerability of congested road networks, the commonly used full network scan approach is to evaluate all possible scenarios of link closure using a form of traffic assignment. This approach can be computationally burdensome and may not be viable for identifying the most critical links in large-scale networks. In this study, an “impact area” vulnerability analysis approach is proposed to evaluate the consequences of a link closure within its impact area instead of the whole network. The proposed approach can significantly reduce the search space for determining the most critical links in large-scale networks. In addition, a new vulnerability index is introduced to examine properly the consequences of a link closure. The effects of demand uncertainty and heterogeneous travellers’ risk-taking behaviour are explicitly considered. Numerical results for two different road networks show that in practice the proposed approach is more efficient than traditional full scan approach for identifying the same set of critical links. Numerical results also demonstrate that both stochastic demand and travellers’ risk-taking behaviour have significant impacts on network vulnerability analysis, especially under high network congestion and large demand variations. Ignoring their impacts can underestimate the consequences of link closures and misidentify the most critical links.     

Recursive estimation of average vehicle time headway using single inductive loop detector data

Vehicle time headway is an important traffic parameter. It affects roadway safety, capacity, and level of service. Single inductive loop detectors are widely deployed in road networks, supplying a wealth of information on the current status of traffic flow. In this paper, we perform Bayesian analysis to online estimate average vehicle time headway using the data collected from a single inductive loop detector. We consider three different scenarios, i.e. light, congested, and disturbed traffic conditions, and have developed a set of unified recursive estimation equations that can be applied to all three scenarios. The computational overhead of updating the estimate is kept to a minimum. The developed recursive method provides an efficient way for the online monitoring of roadway safety and level of service. The method is illustrated using a simulation study and real traffic data.     

A model for the visualization and analysis of elevator traffic

ABSTRACT

Analysis of elevator traffic in high rise buildings is critical to the performance evaluation of elevator group control systems (EGCS). Elevator dispatching methods or parking algorithms in an EGCS can be designed or modified according to analyses of traffic flow. However, interpretation of traffic flow based solely on numerical data may not be explicit and transparent for EGCS experts as well as for other non-expert building administration. In this study, we present a model for visualization and analysis of elevator traffic. First, we present an alternative approach for traffic analysis which we call route visualization. In the proposed approach, we initially decompose elevator traffic into its component parts and investigate each component independently. Then, using superposition of components we obtain a reconstructed model of overall traffic. This modeling approach provides component-based traffic analysis and representation of routes with intensities through data visualization. In the second part we introduce a multi-dimensional analysis of time parameters in ECGS. This approach provides a comparative analysis of several control algorithms such as dispatch or park algorithms for different combinations of traffic components.