Experimental Study on Mechanical Behaviors of Prefabricated Column-Base Joint with Grouted Sleeves Connecting Longitudinal Reinforcements in Tunnels北大核心CSCD

In recent years, large shield tunnels with internal double-decked lanes have been developing rapidly in the field of highway tunnels, and prefabricated elements are increasingly adopted in internal structure. Based on the columns-base joint in Zhuguanglu tunnel, which is under construction, 2 full-scale specimens are designed for the quasi-static test, one specimen is connected with grout sleeve splicing and the other is cast in place. The test results show that: the bearing capacity of specimen with grout sleeve splicing is equal to that of cast-in-situ specimen, but its ductility and energy dissipation capacity are worse than that of the cast-in-situ specimen. And for the specimen with grout sleeve splicing, there exists crack concentration on the area above the sleeve. The crack width is too larger in this area. © 2018, Editorial Office of "Modern Tunnelling Technology". All right reserved.     

Socioeconomic and usage characteristics of transportation network company (TNC) riders

Transportation - The widespread adoption of smartphones followed by an emergence of transportation network companies (TNC) have influenced the way individuals travel. The authors use the 2017...     

Incorporating Driver Behaviors in Network Design Problems: Challenges and Opportunities

The goal of a network design problem (NDP) is to make optimal decisions to achieve a certain objective such as minimizing total travel time or maximizing tolls collected in the network. A critical component to NDP is how travelers make their route choices. Researchers in transportation have adopted human decision theories to describe more accurate route choice behaviors. In this paper, we review the NDP with various route choice models: the random utility model (RUM), random regret-minimization (RRM) model, bounded rationality (BR), cumulative prospect theory (CPT), the fuzzy logic model (FLM) and dynamic learning models. Moreover, we identify challenges in applying behavioral route choice models to NDP and opportunities for future research.     

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.     

Evaluating locational accessibility to the US air transportation system

Although there are hundreds of airports that support commercial air passenger traffic in the United States (US), not all areas are equivalently served by the commercial air transportation system. Locations in the US differ with respect to their level of access to the commercial air network and their overall accessibility within the system. Given the complexity of the domestic commercial air passenger network and supporting infrastructure, past research has only been able to provide a limited assessment of locational accessibility within the United States. To address these complexities, this paper proposes a new metric that incorporates measures of access to air transport as well as accessibility within air transportation networks. Using a comprehensive dataset on scheduled airline service, the developed approach is then applied to the US domestic commercial passenger air transportation network to explore geographic differentials in accessibility. Results suggest marked differences between core-based statistical areas throughout the US.     

Reducing transit fleet emissions through vehicle retrofits,replacements, and usage changes over multiple time periods

Bus transit is often promoted as a green form of transportation, but surprisingly little research has been done on how to run transit systems in a green manner. Both vehicle task assignment and purchase models are generally constructed to minimize financial costs. Integrating vehicle task assignment with purchase decisions is made challenging by the different time scales involved. An integer programming approach is used to combine vehicle purchase, retrofit and aggregated task assignment decisions. The formulation is designed to operate in sequence with traditional vehicle task assignment models, to add emissions and long term financial cost elements to the objective, while maintaining computational tractability and feasible input data requirements. In a case study, a transit agency saves money in the long term by using stimulus money to buy CNG infrastructure instead of purchasing only new buses. Carbon prices up to $400/(ton CO₂ equivalent) do not change vehicle purchase decisions, but higher carbon prices can cause more diesel hybrid purchases, at a high marginal cost. Although the motivation and numerical case study are from the US transit industry, the model is formulated to be widely applicable to green fleet management in multiple contexts.     

Short-term Hourly Traffic Forecasts using Hong Kong Annual Traffic Census

The need for acquiring the current-year traffic data is a problem for transport planners since such data may not be available for on-going transport studies. A method is proposed in this paper to predict hourly traffic flows up to and into the near future, using historical data collected from the Hong Kong Annual Traffic Census (ATC). Two parametric and two non-parametric models have been employed and evaluated in this study. The results show that the non-parametric models (Non-Parametric Regression (NPR) and Gaussian Maximum Likelihood (GML)) were more promising for predicting hourly traffic flows at the selected ATC station. Further analysis encompassing 87 ATC stations revealed that the NPR is likely to react to unexpected changes more effectively than the GML method, while the GML model performs better under steady traffic flows. Taking into consideration the dynamic nature of the common traffic patterns in Hong Kong and the advantages/disadvantages of the various models, the NPR model is recommended for predicting the hourly traffic flows in that region.     

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 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.