It is time to give the “true PRT” concept a fair test

True Personal Rapid Transit (PRT), in concept and technology, is considerably advanced over PRT as proposed in the 1960s and 1970s. It is one of the few advanced transit concepts—perhaps the only one—that offers a prospect of overcoming the continued serious deficiencies of conventional transit systems. Past criticisms of PRT were often invalid, but even those questions that deserved to be taken seriously then no longer justify a postponement of serious PRT testing. Conventional transit, in spite of over two decades of considerable governmental support, is proving unable to satisfy major transportation needs of American urban areas, which are increasingly dispersed and multi-centered. There is no indication that conventional transit can overcome sufficiently its performance and economic deficiencies. If PRT is not given a chance to be tested, local public officials will continue to be faced with too limited options as between auto-dominated transportation services and high subsidies for inadequate transit solutions.     

P-201遇水膨胀止水胶在厦门海底隧道中的应用

施工防排水是海底隧道施工成败的核心技术之一,厦门海底隧道设计防水等级为地下工程Ⅰ级防水,要求无渗漏和结构表面无湿渍.文章主要介绍了P-201遇水膨胀止水胶在厦门海底隧道中的应用及其物理性能指标、施工工艺、技术要求等,对同类地下工程防水施工具有一定的借鉴意义.     

Short‐term prediction of traffic parameters—performance comparison of a data‐driven and less‐data‐required approaches

The travel decisions made by road users are more affected by the traffic conditions when they travel than the current conditions. Thus, accurate prediction of traffic parameters for giving reliable information about the future state of traffic conditions is very important. Mainly, this is an essential component of many advanced traveller information systems coming under the intelligent transportation systems umbrella. In India, the automated traffic data collection is in the beginning stage, with many of the cities still struggling with database generation and processing, and hence, a less‐data‐demanding approach will be attractive for such applications, if it is not going to reduce the prediction accuracy to a great extent. The present study explores this area and tries to answer this question using automated data collected from field. A data‐driven technique, namely, artificial neural networks (ANN), which is shown to be a good tool for prediction problems, is taken as an example for data‐driven approach. Grey model, GM(1,1), which is also reported as a good prediction tool, is selected as the less‐data‐demanding approach. Volume, classified volume, average speed and classified speed at a particular location were selected for the prediction. The results showed comparable performance by both the methods. However, ANN required around seven times data compared with GM for comparable performance. Thus, considering the comparatively lesser input requirement of GM, it can be considered over ANN in situations where the historic database is limited. Copyright © 2016 John Wiley & Sons, Ltd.     

A revised branch‐and‐price algorithm for dial‐a‐ride problems with the consideration of time‐dependent travel cost

Developing demand responsive transit systems are important with regard to meeting the travel needs for elderly people. Although Dial‐a‐ride Problems (DARP) have been discussed for several decades, most researchers have worked to develop algorithms with low computational cost under the minimal total travel costs, and fewer studies have considered how changes in travel time might affect the vehicle routes and service sequences. Ignoring such variations in travel time when design vehicle routes and schedules might lead to the production of inefficient vehicle routes, as well as incorrect actual vehicle arrival times at the related nodes. The purpose of this paper is to construct a DARP formulation with consideration of time‐dependent travel times and utilizes the traffic simulation software, DynaTAIWAN, to simulate the real traffic conditions in order to obtain the time‐dependent travel time matrices. The branch‐and‐price approach is introduced for the time‐dependent DARP and tested by examining the sub‐network of Kaohsiung City, Taiwan. The numerical results reveal that the length of the time window can significantly affect the vehicle routes and quantitative measurements. As the length of the time window increases, the objective value and the number of vehicles will reduce significantly. However, the CPU time, the average pickup delay time, the average delivery delay time and the average actual ride time (ART)/direct ride time (DRT) will increase significantly as the length of the time window increases. Designing the vehicle routes to reduce operating costs and satisfy the requirements of customers is a difficult task, and a trade‐off must be made between these goals. Copyright © 2014 John Wiley & Sons, Ltd.     

Reducing CO<Subscript>2</Subscript> from cars in the European Union

The European Union (EU) recently adopted CO₂ emissions mandates for new passenger cars, requiring steady reductions to 95 gCO₂/km in 2021. We use a multi-sector computable general equilibrium (CGE) model, which includes a private transportation sector with an empirically-based parameterization of the relationship between income growth and demand for vehicle miles traveled. The model also includes representation of fleet turnover, and opportunities for fuel use and emissions abatement, including representation of electric vehicles. We analyze the impact of the mandates on oil demand, CO₂ emissions, and economic welfare, and compare the results to an emission trading scenario that achieves identical emissions reductions. We find that vehicle emission standards reduce CO₂ emissions from transportation by about 50 MtCO₂ and lower the oil expenditures by about €6 billion, but at a net added cost of €12 billion in 2020. Tightening CO₂ standards further after 2021 would cost the EU economy an additional €24–63 billion in 2025, compared with an emission trading system that achieves the same economy-wide CO₂ reduction. We offer a discussion of the design features for incorporating transport into the emission trading system.     

Improved waveform‐feature‐based vehicle classification using a single‐point magnetic sensor

Vehicle classification systems have important roles in applications related to real‐time traffic management. They also provide essential data and necessary information for traffic planning, pavement design, and maintenance. Among various classification techniques, the length‐based classification technique is widely used at present. However, the undesirable speed estimates provided by conventional data aggregation make it impossible to collect reliable length data from a single‐point sensor during real‐time operations. In this paper, an innovative approach of vehicle classification will be proposed, which achieved very satisfactory results on a single‐point sensor. This method has two essential parts. The first concerns with the procedure of smart feature extraction and selection according to the proposed filter–filter–wrapper model. The model of filter–filter–wrapper is adopted to make an evaluation on the extracted feature subsets. Meanwhile, the model will determine a nonredundant feature subset, which can make a complete reflection on the differences of various types of vehicles. In the second part, an algorithm for vehicle classification according to the theoretical basis of clustering support vector machines (C‐SVMs) was established with the selected optimal feature subset. The paper also uses particle swarm optimization (PSO), with the purpose of searching for an optimal kernel parameter and the slack penalty parameter in C‐SVMs. A total of 460 samples were tested through cross validation, and the result turned out that the classification accuracy was over 99%. In summary, the test results demonstrated that our vehicle classification method could enhance the efficiency of machine‐learning‐based data mining and the accuracy of vehicle classification. Copyright © 2014 John Wiley & Sons, Ltd.     

Modeling the evolutions of day‐to‐day route choice and year‐to‐year ATIS adoption with stochastic user equilibrium

Suppose that in an urban transportation network there is a specific advanced traveler information system (ATIS) which acts for reducing the drivers' travel time uncertainty through provision of pre‐trip route information. Because of the imperfect information provided, some travelers are not in compliance with the ATIS advice although equipped with the device. We thus divide all travelers into three groups, one group unequipped with ATIS, another group equipped and in compliance with ATIS advice and the third group equipped but without compliance with the advice. Each traveler makes route choice in a logit‐based manner and a stochastic user equilibrium with multiple user classes is reached for every day. In this paper, we propose a model to investigate the evolutions of daily path travel time, daily ATIS compliance rate and yearly ATIS adoption, in which the equilibrium for every day's route choice is kept. The stability of the evolution model is initially analyzed. Numerical results obtained from a test network are presented for demonstrating the model's ability in depicting the day‐to‐day and year‐to‐year evolutions.     

Optimizing one‐way traffic network reconfiguration and lane‐based non‐diversion routing for evacuation

Unfortunately, situations such as flood, hurricanes, chemical accidents, and other events occur frequently more and more. To improve the efficiency and practicality of evacuation management plan, an integrated optimization model of one‐way traffic network reconfiguration and lane‐based non‐diversion routing with crossing elimination at intersection for evacuation is constructed in this paper. It is an integrated model aiming at minimizing the network clearance time based on Cell Transmission Model. A hybrid algorithm with modified genetic algorithm and tabu search method is devised for approximating optimal problem solutions. To verify the effectiveness of the proposed model and solving method, two cases are illustrated in this paper. Through the first example, it can be seen that the proposed model and algorithm can effectively solve the integrated problems, and compared with the objective value of the original network, the network clearance time of the final solution reduces by 47.4%. The calculation results for the realistic topology and size network of Ningbo in China, which locates on the east coast of the Pacific Ocean, justify the practical value of the model and solution method, and solutions under different settings of reduction amount of merging cell capacity embody obvious differences. Copyright © 2015 John Wiley & Sons, Ltd.     

Improved modeling of park‐and‐ride transfer time: Capturing the within‐day dynamics

An important factor that affects park‐and‐ride demand is transfer time. However, conventional park‐and‐ride demand models treat transfer time as a single value, without considering the time‐of‐day effect. Since early comers usually occupy spots closer to the entrance, their transfer times are shorter. Hence, there is a relationship between arrival time and transfer time. To analyze this relationship, a micro‐simulation model is developed. The model simulates the queuing system at the entrance and the pattern that parking spots are occupied in the parking lot over time. As expected, the model output illustrates an increasing relationship between arrival time and transfer time. This relationship has significant implication in mode choice models because it means that the attractiveness of park‐and‐ride depends on the time of arrival at the park‐and‐ride lot. This model of park‐and‐ride transfer time can potentially improve travel demand forecasting, as well as facilitate the operation and design of park‐and‐ride facilities.     

An equity‐based passenger flow control model with application to Hong Kong‐Shenzhen border‐crossing

Cross‐border passengers from Hong Kong to Shenzhen by the east Kowloon‐Canton Railway (KCR) through the Lo Wu customs exceed nearly 200 thousand on a special day such as a day during the Chinese Spring Festival. Such heavy passenger demand often exceeds the processing and holding capacity of the Lo Wu customs for many hours a day. Thus, passengers must be metered off at all entrance stations along the KCR line through ticket rationing to restrain the number of passengers waiting at Lo Wu within its safe holding capacity. This paper proposes an optimal control strategy and model to deal with this passenger crowding and control problem. Because the maximum passenger checkout rate at Lo Wu is fixed, total passenger waiting time is not affected by the control strategy for given time‐dependent arriving rates at each station. An equity‐based control strategy is thus proposed to equalize the waiting times of passengers arriving at all stations at the same time. This equity is achieved through optimal allocation of the total quota of tickets to all entrance stations for each train service. The total ticket quota for each train service is determined such that the capacity constraint of the passenger queue at Lo Wu is satisfied. The control problem is formulated as a successive linear programming problem and demonstrated for the KCR system with partially simulated data.     

Safety modeling for two‐way left‐turn lanes and a procedure to identify two‐way left‐turn lane segments with safety concerns

In the past, two‐way left‐turn lane (TWLTL) median treatments have been frequently used in Florida to inexpensively improve traffic and safety performances. In order to identify factors that may have significant impacts on safety operations in TWLTL sections and to identify TWLTL locations that present existing and future safety concerns, a research project was carried out and results are summarized in the paper. In the research, a three‐year crash history database with crashes and section characteristics from a total of 1688 TWLTL sections all over Florida was developed and used. A negative binomial regression model was developed to determine the statistical relationship between the number of crashes per mile per year and several variables such as traffic volume, access density, posted speed, and number of lanes. In regard to the methodology, in order to identify locations with safety concerns, several steps are needed: development of real crash data distribution, determination of statistical distribution models that better represent the actual crash data, determination of percentile values for the average number of crashes, estimation of crash rates for sections with the same characteristics, estimation of critical values for the variables corresponding to the percentile values for average number of crashes, calculation of tables of critical average annual daily traffic values, and generation of a list of TWLTL locations with critical safety concerns. Results presented in the paper have been used in real applications. Copyright © 2012 John Wiley & Sons, Ltd.     

Cycle commuting in Belgium: Spatial determinants and ‘re-cycling’ strategies

This paper attempts to explain the spatial variation of the use of a bicycle for commuting to work at the level of the 589 municipalities in Belgium. Regression techniques were used and special attention was paid to autocorrelation, heterogeneity and multicollinearity. Spatial lag models were used to correct for the presence of spatial dependence and a disaggregated modelling strategy was adopted for the northern and southern parts of the country. The results show that much of the inter-municipality variation in bicycle use is related to environmental aspects such as the relief, traffic volumes and cycling accidents. Town size, distance travelled and demographic aspects also have some effect. In addition, there are regional differences in the effects of the structural covariates on bicycle use: the impact of variables such as traffic volume and cycling accidents differs substantially between the north and the south of the country. This paper also suggests that high rates of bicycle use in one municipality stimulate cycling in neighbouring municipalities, and hence that a mass effect can be initiated, i.e. more cycle commuting encourages even more commuters in the area to cycle. These findings provide some recommendations for decision-makers wishing to promote a shift from car to bicycle use.     

“Local background” levels of carbon monoxide in an urban area

The objective of this study was to obtain a better understanding of carbon monoxide (CO) concentrations immediately upwind of urban roadways, the “local background” values, and how these concentrations depend upon the surrounding traffic and the general meteorology. Measurements were made at seven sites in Seattle, WA during the winter of 1993. Local background CO concentrations were characterized by an absence of short term fluctuations, a steady buildup during the 3 p.m. to 11 p.m. period, and a lack of spatial gradients in the 8-h average values. Distinctly different log-normal distributions of the 8-h averages were observed for “trafficked” sites versus “urban park” sites, with mean values of 1.6 and 1.0 ppm respectively. A simple regression model was developed to predict the local background CO that includes distance from roadway, average daily traffic of nearby roadways, and the frequency of occurrence of low wind speeds (R² = 0.74; F = 170).     

Multi‐level traffic control at large four‐leg roundabouts

Yield control and full signalization are typical traffic control solutions that can be used at large roundabouts. In the face of increasing congestion issues, it is preferred to use yield control during off‐peak periods and full signalization during peak periods. To automatically accommodate time‐varying vehicular demands, a multi‐level traffic control (MTC) is developed to implement hybrid yield control and fully actuated control at large four‐leg roundabouts. With new application of traffic control devices and traffic detection system, the right‐of‐way can be assigned to entering and circulating vehicles in three modes. The ‘all entering’ mode is equivalent to a yield control. The ‘no entering’ and ‘concurrent entering’ modes are equivalent to a fully actuated control. On the basis of time headways and occupancy times that are detected on the entry and circulatory roadways, the mode of right‐of‐way assignment can be changed in response to actual traffic conditions. For a specific mode of right‐of‐way assignment, traffic signal operation is managed by some detectable traffic events that are happening. The results of the simulation experiments conducted by VISSIM indicated that: (i) MTC was stabilized at the ‘all entering’ mode during off‐peak periods and at the ‘concurrent entering’ mode during peak periods; (ii) MTC would typically change the mode of right‐of‐way assignment according to actual traffic conditions as vehicular demands increased from off‐peak to peak or decreased from peak to off‐peak; and (iii) statistically speaking, MTC inherited the operational advantages of yield control and fully actuated control, and could be effective in improving the operational performance of large four‐leg roundabouts for all hours of the day, regardless of the level of left‐turn ratios. Copyright © 2016 John Wiley & Sons, Ltd.     

Finding time‐robust fuel‐efficient paths for a call‐taxi in a stochastic city road network

Intra‐city commuting is being revolutionized by call‐taxi services in many developing countries such as India. A customer requests a taxi via phone, and it arrives at the right time and at the right location for the pick‐up. This mode of intra‐city travel has become one of the most reliable and convenient modes of transportation for customers traveling for business and non‐business purposes. The increased number of vehicles on city roads and raising fuel costs has prompted a new type of transportation logistics problem of finding a fuel‐efficient and quickest path for a call‐taxi through a city road network, where the travel times are stochastic. The stochastic travel time of the road network is induced by obstacles such as the traffic signals and intersections. The delay and additional fuel consumption at each of these obstacles are calculated that are later imputed to the total travel time and fuel consumption of a path. A Monte‐Carlo simulation‐based approach is proposed to identify unique fuel‐efficient paths between two locations in a city road network where each obstacle has a delay distribution. A multi‐criteria score is then assigned to each unique path based on the probability that the path is fuel efficient, the average travel time of the path and the coefficient of variation of the travel times of the path. Copyright © 2016 John Wiley & Sons, Ltd.     

Queue length estimation at metered freeway‐to‐freeway connectors

Freeway‐to‐freeway connector metering is a cost‐effective and proven freeway management strategy for relieving recurrent congestion. However, one of the critical challenges in design and operation of freeway‐to‐freeway connector metering is the lack of up‐to‐date queue storage length design guidance. In this study, it was found that ramp queue is dynamically related to the metering rate, on‐ramp demand, and traffic flow arrival pattern. Hence, simply using an average demand cannot provide accurate queue length estimation and is also not suitable for queue storage design where the maximum or a percentile queue length is generally used. A mesoscopic queue length simulation model was developed based on the input–output method for estimating queue lengths under various demand‐to‐capacity ratio scenarios. Simulation results indicate that for under‐saturated situations, the ramp queue may exist temporally due to the random short‐term surge of traffic arrivals, and the exponential function could best capture the relationship between queue length and demand‐to‐capacity ratio. For over‐saturated situations, the ramp queue tends to prolong linearly with the demand‐to‐capacity ratio. Based on the simulation, it was recommended that queue storage length be designed as 4.3% of on‐ramp demand when demand is lower than 1200 vph or 2.3% when demand is between 1200 and 2400 vph. Copyright © 2016 John Wiley & Sons, Ltd.