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.     

International experience with speed limits during and prior to the energy crisis of 1973–4

This paper presents an artificial neural network (ANN) based method for estimating route travel times between individual locations in an urban traffic network. Fast and accurate estimation of route travel times is required by the vehicle routing and scheduling process involved in many fleet vehicle operation systems such as dial‐a‐ride paratransit, school bus, and private delivery services. The methodology developed in this paper assumes that route travel times are time‐dependent and stochastic and their means and standard deviations need to be estimated. Three feed‐forward neural networks are developed to model the travel time behaviour during different time periods of the day‐the AM peak, the PM peak, and the off‐peak. These models are subsequently trained and tested using data simulated on the road network for the City of Edmonton, Alberta. A comparison of the ANN model with a traditional distance‐based model and a shortest path algorithm is then presented. The practical implication of the ANN method is subsequently demonstrated within a dial‐a‐ride paratransit vehicle routing and scheduling problem. The computational results show that the ANN‐based route travel time estimation model is appropriate, with respect to accuracy and speed, for use in real applications.     

Estimating freeway route travel time distributions with consideration to time‐of‐day,inclement weather,and traffic incidents

This paper develops an efficient probabilistic model for estimating route travel time variability, incorporating factors of time‐of‐day, inclement weather, and traffic incidents. Estimating the route travel time distribution from historical link travel time data is challenging owing to the interactions among upstream and downstream links. Upon creating conditional probability function for each link travel time, we applied Monte Carlo simulation to estimate the total travel time from origin to destination. A numerical example of three alternative routes in the City of Buffalo shows several implications. The study found that weather conditions, except for snow, incur minor impact on off‐peak and weekend travel time, whereas peak travel times suffer great variations under different weather conditions. On top of that, inclement weather exacerbates route travel time reliability, even when mean travel time increases moderately. The computation time of the proposed model is linearly correlated to the number of links in a route. Therefore, this model can be used to obtain all the origin to destination travel time distributions in an urban region. Further, this study also validates the well‐known near‐linear relation between the standard deviation of travel time per unit distance and the corresponding mean value under different weather conditions. Copyright © 2016 John Wiley & Sons, Ltd.     

Impact of heavy vehicles on surrounding traffic characteristics

This work examines the impact of heavy vehicle movements on measured traffic characteristics in detail. Although the number of heavy vehicles within the traffic stream is only a small percentage, their impact is prominent. Heavy vehicles impose physical and psychological effects on surrounding traffic flow because of their length and size (physical) and acceleration/deceleration (operational) characteristics. The objective of this work is to investigate the differences in traffic characteristics in the vicinity of heavy vehicles and passenger cars. The analysis focuses on heavy traffic conditions (level of service E) using a trajectory data of highway I‐80 in California. The results show that larger front and rear space gaps exist for heavy vehicles compared with passenger cars. This may be because of the limitations in manoeuvrability of heavy vehicles and the safety concerns of the rear vehicle drivers, respectively. In addition, heavy vehicle drivers mainly keep a constant speed and do not change their speed frequently. This work also examines the impact of heavy vehicles on their surrounding traffic in terms of average travel time and number of lane changing manoeuvres using Advanced Interactive Microscopic Simulator for Urban and Non‐Urban Networks (AIMSUN) microscopic traffic simulation package. According to the results, the average travel time increases when proportion of heavy vehicles rises in each lane. To reflect the impact of heavy vehicles on average travel time, a term related to heavy vehicle percentage is introduced into two different travel time equations, Bureau of Public Roads and Akçelik's travel time equations. The results show that using an exclusive term for heavy vehicles can better estimate the travel times for more than 10%. Finally, number of passenger car lane changing manoeuvres per lane will be more frequent when more heavy vehicles exist in that lane. The influence of heavy vehicles on the number of passenger car lane changing is intensified in higher traffic densities and higher percentage of heavy vehicles. Large numbers of lane changing manoeuvres can increase the number of traffic accidents and potentially reduce traffic safety. The results show an increase of 5% in the likelihood of accidents, when percentage of heavy vehicles increases to 30% of total traffic. Copyright © 2014 John Wiley & Sons, Ltd.     

Real time queue length estimation for signalized intersections using travel times from mobile sensors

We study how to estimate real time queue lengths at signalized intersections using intersection travel times collected from mobile traffic sensors. The estimation is based on the observation that critical pattern changes of intersection travel times or delays, such as the discontinuities (i.e., sudden and dramatic increases in travel times) and non-smoothness (i.e., changes of slopes of travel times), indicate signal timing or queue length changes. By detecting these critical points in intersection travel times or delays, the real time queue length can be re-constructed. We first introduce the concept of Queue Rear No-delay Arrival Time which is related to the non-smoothness of queuing delay patterns and queue length changes. We then show how measured intersection travel times from mobile sensors can be processed to generate sample vehicle queuing delays. Under the uniform arrival assumption, the queuing delays reduce linearly within a cycle. The delay pattern can be estimated by a linear fitting method using sample queuing delays. Queue Rear No-delay Arrival Time can then be obtained from the delay pattern, and be used to estimate the maximum and minimum queue lengths of a cycle, based on which the real-time queue length curve can also be constructed. The model and algorithm are tested in a field experiment and in simulation.     

Short‐term travel time forecasts for transport information system in hong kong

In this paper, a case study is carried out in Hong Kong for demonstration of the Transport Information System (TIS) prototype. A traffic flow simulator (TFS) is presented to forecast the short‐term travel times that can be served as a predicted travel time database for the TIS in Hong Kong. In the TFS, a stochastic deviation coefficient is incorporated to simulate the minute‐by‐minute fluctuation of traffic flows within the peak hour period. The purposes of the case study are: 1) to show the applicability of the TFS for larger‐scale road network; and 2) to illustrate the short‐term forecasting of path travel times in practice. The results of the case study show that the TFS can be applied to real network effectively. The predicted travel times are compared with the observed travel times on the selected paths for an OD pair. The results show that the observed path travel times fall in the 90% confidence interval of the predicted path travel times.     

Optimal subwork zone operational strategy for short‐term work zone projects in four‐lane two‐way freeways

Roadside trees in Singapore are regularly trimmed for the purpose of traffic safety and roadside tree‐trimming project is one typical type of short‐term work zone projects. To implement such a short‐term work zone project, contractors usually divide an entire work zone into multiple subwork zones with the uniform length. This paper aims to determine an optimal subwork zone strategy for the short‐term work zone projects in four‐lane two‐way freeways with time window and uniform subwork zone length constraints. The deterministic queuing model is employed to estimate total user delay caused by the work zone project by taking into account variable traffic speeds. Based on the user delay estimations, this paper proceeds to build a minimization model subject to time window and uniform length constraints for the optimal subwork zone strategy problem. This paper also presents a variation of the minimization model to examine the impact of unequal subwork zone length constraint. Since these minimization models belong to the mixed‐integer non‐differentiable optimization problems, an iterative algorithm embedding with the genetic simulated annealing method is thus proposed to solve these models. Finally, a numerical example is carried out to investigate the effectiveness of the proposed models. Copyright © 2010 John Wiley & Sons, Ltd.     

Accommodating user preferences in ad hoc shared ride trip planning using GIS

Ad hoc shared ride trip planning (SRTP) utilizes mobile devices, geo-sensors and wireless networks to match on-the-fly individual travel demand with transport supply. It represents one of many alternatives to single occupancy vehicle use. This paper outlines a SRTP approach via a two-phase algorithm based on user preferences in a time-dependent routing. Whereas current algorithms use minimization of travel time as the only optimization criterion in trip planning, in the framework presented here, the user can specify multiple trip preferences including travel time, walking time, number of transfers between cars and trip length. Various scenarios are simulated in the city of Tehran (Iran) to demonstrate how preference settings affect the routes of ad hoc shared journeys.     

The development of taiwan arterial traffic‐adaptive signal control system and its field test: A taiwan experience

This Taiwan traffic‐adaptive arterial signal control model borrowed its traffic flow framework mainly from a British traffic‐adaptive control model with a cyclic traffic progression function, i.e. SCOOT (Split Cycle Office Optimisation Technique). The new arterial control model can take into account delays of both major and minor streets and make real‐time signal timing decisions with optimal two‐way signal offsets, so as to create the best arterial signal operation performance. It has been developed to be an online real‐time software for both simulation testing and field validation. Through simulation, it was found that the performance when operating this newly developed real‐time arterial traffic‐adaptive model was significantly better than when using the optimal fixed‐time arterial timing plan. On the aspect of field testing, three signalized intersections located in East District, Tainan City, Taiwan were selected to be the test sites. Fairly good traffic control performance has been demonstrated in that it can effectively reduce travel delays of the control arterial as a whole. Additional discussions about how to combine travel delay and the total number of vehicle stops into a new control performance index have also been included to make the new traffic‐adaptive model more flexible and reasonable to meet the expectations of different driver groups in the arterial system.     

Estimating performance of traffic signals based on link travel times

Recent advances in communication and computing technology have made travel time measurements more available than ever before. In urban signalized arterials, travel times are strongly influenced by traffic signals. This study presents a novel method based on well‐known principles to estimate traffic signal performance (or more precisely their major “through” movements) based on travel time measurements. The travel times were collected between signals in the field by using point‐to‐point travel time measurement technologies. Closed‐circuit television cameras and signal databases were used to collect traffic demand and signal timings, respectively. Then, the volume/capacity ratio of major downstream signal movements was computed based on demand and signal timings. This volume/capacity ratio was then correlated with travel times on the relevant intersection approach. The best volume‐delay function was found, along with many other functions, to fit the field data. This volume‐delay function was then used to estimate volume/capacity ratios and, indirectly, a few other signal performance metrics. The method, called travel time‐based signal performance measurements, was automated and displayed on a Google Map. The findings show that the proposed method is accurate and robust enough to provide necessary information about signal performance. A newly developed volume‐delay function was found to work just slightly better than the Bureau of Public Roads curve. Several issues, which may reduce the accuracy of the proposed method, are identified, and their solutions are proposed for future research. Copyright © 2016 John Wiley & Sons, Ltd.     

Microscopic modeling of large‐scale pedestrian–vehicle conflicts in the city of Madinah,Saudi Arabia

This paper presents a micro‐simulation modeling framework for evaluating pedestrian–vehicle conflicts in crowded crossing areas. The framework adopts a simulation approach that models vehicles and pedestrians at the microscopic level while satisfying two sets of constraints: (1) flow constraints and (2) non‐collision constraints. Pedestrians move across two‐directional cells as opposed to one‐dimensional lanes as in the case of vehicles; therefore, extra caution is considered when modeling the shared space between vehicles and pedestrians. The framework is used to assess large‐scale pedestrian–vehicle conflicts in a highly congested ring road in the City of Madinah that carries 20 000 vehicles/hour and crossed by 140 000 pedestrians/hour after a major congregational prayer. The quantitative and visual results of the simulation exhibits serious conflicts between pedestrians and vehicles, resulting in considerable delays for pedestrians crossing the road (9 minutes average delay) and slow traffic conditions (average speed <10 km/hour). The model is then used to evaluate the following three mitigating strategies: (1) pedestrian‐only phase; (2) grade separation; and (3) pedestrian mall. A matrix of operational measures of effectiveness for network‐wide performance (e.g., average travel time, average speed) and for pedestrian‐specific performance (e.g., mean speed, mean density, mean delay, mean moving time) is used to assess the effectiveness of the proposed strategies. Copyright © 2012 John Wiley & Sons, Ltd.     

Modelling rain effects on risk‐taking behaviours of multi‐user classes in road networks with uncertainty

This paper proposes a new travel time reliability‐based traffic assignment model to investigate the rain effects on risk‐taking behaviours of different road users in networks with day‐to‐day demand fluctuations and variations in travel time. A generalized link travel time function is used to capture the rain effects on vehicle travel times and road conditions. This function is further incorporated into daily demand variations to investigate those travel time variations arising from demand uncertainty and rain condition. In view of these rain effects, road users' perception errors on travel times and risk‐taking behaviours on path choices are incorporated in the proposed model with the use of a logit‐based stochastic user equilibrium framework. This new model is formulated as a variational inequality problem in terms of path flows. A numerical example is used to illustrate the application of the proposed model for assessment of the rain effects on road networks with uncertainty.     

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.     

A reliability‐based traffic assignment model for multi‐modal transport network under demand uncertainty

In densely populated and congested urban areas, the travel times in congested multi‐modal transport networks are generally varied and stochastic in practice. These stochastic travel times may be raised from day‐to‐day demand fluctuations and would affect travelers' route and mode choice behaviors according to their different expectations of on‐time arrival. In view of these, this paper presents a reliability‐based user equilibrium traffic assignment model for congested multi‐modal transport networks under demand uncertainty. The stochastic bus frequency due to the unstable travel time of bus route is explicitly considered. By the proposed model, travelers' route and mode choice behaviors are intensively explored. In addition, a stochastic state‐augmented multi‐modal transport network is adopted in this paper to effectively model probable transfers and non‐linear fare structures. A numerical example is given to illustrate the merits of the proposed model. Copyright © 2012 John Wiley & Sons, Ltd.     

Dispatching control at transfer stations in multi‐hub transit networks

Among dispatching control approaches, the holding option has attracted the most attention in bus control. However, holding a vehicle at a transfer station may exacerbate the delays because more passengers might accumulate at downstream stations and may also affect other connecting routes at other transfer stations. Our problem is to minimize the total costs of dispatching ready vehicles at each transfer station along coordinated routes in a multi‐hub transit network. The total costs include the waiting cost for on‐board passengers, the missed connection costs for late arrival passengers at the subject transfer station and possible transfer costs at downstream transfer stations. We develop a heuristic algorithm to optimize the holding times based on real time information about late vehicles. The results show that ready vehicles should be held longer when the arrival variances of late vehicles are small or when many late connecting passengers are expected.     

Traveler delay costs and value of time with trip chains, flexible activity scheduling and information

The delay costs of traffic disruptions and congestion and the value of travel time reliability are typically evaluated using single trip scheduling models, which treat the trip in isolation of previous and subsequent trips and activities. In practice, however, when activity scheduling to some extent is flexible, the impact of delay on one trip will depend on the actual and predicted travel time on itself as well as other trips, which is important to consider for long-lasting disturbances and when assessing the value of travel information. In this paper we extend the single trip approach into a two trips chain and activity scheduling model. Preferences are represented as marginal activity utility functions that take scheduling flexibility into account. We analytically derive trip timing optimality conditions, the value of travel time and schedule adjustments in response to travel time increases. We show how the single trip models are special cases of the present model and can be generalized to a setting with trip chains and flexible scheduling. We investigate numerically how the delay cost depends on the delay duration and its distribution on different trips during the day, the accuracy of delay prediction and travel information, and the scheduling flexibility of work hours. The extension of the model framework to more complex schedules is discussed.     

Analysis of peak and non‐peak traffic forecasts using combined models

Accurate and timely traffic forecasting is crucial to effective management of intelligent transportation systems (ITS). To predict travel time index (TTI) data, we select six baseline individual predictors as basic combination components. Applying the one‐step‐ahead out‐of‐sample forecasts, the paper proposes several linear combined forecasting techniques. States of traffic situations are classified into peak and non‐peak periods. Based on detailed data analyses, some practical guidance and comments are given in what situation a combined model is better than an individual model or other types of combined models. Indicating which model is more appropriate in each state, persuasive comparisons demonstrate that the combined procedures can significantly reduce forecast error rates. It reveals that the approaches are practically promising in the field. To the best of our knowledge, it is the first time to systematically investigate these approaches in peak and non‐peak traffic forecasts. The studies can provide a reference for optimal forecasting model selection in each period. Copyright © 2010 John Wiley & Sons, Ltd.     

A computational model for the probit‐based dynamic stochastic user optimal traffic assignment problem

This paper focuses on computational model development for the probit‐based dynamic stochastic user optimal (P‐DSUO) traffic assignment problem. We first examine a general fixed‐point formulation for the P‐DSUO traffic assignment problem, and subsequently propose a computational model that can find an approximated solution of the interest problem. The computational model includes four components: a strategy to determine a set of the prevailing routes between each origin–destination pair, a method to estimate the covariance of perceived travel time for any two prevailing routes, a cell transmission model‐based traffic performance model to calculate the actual route travel time used by the probit‐based dynamic stochastic network loading procedure, and an iterative solution algorithm solving the customized fixed‐point model. The Ishikawa algorithm is proposed to solve the computational model. A comparison study is carried out to investigate the efficiency and accuracy of the proposed algorithm with the method of successive averages. Two numerical examples are used to assess the computational model and the algorithm proposed. Results show that Ishikawa algorithm has better accuracy for smaller network despite requiring longer computational time. Nevertheless, it could not converge for larger network. Copyright © 2010 John Wiley & Sons, Ltd.     

On the use of “average delay” as a measure of train reliability

We investigate how passengers on long-distance trains value unexpected delays relative to scheduled travel time and travel cost. For scheduled services with high reliability and long headways, the value of delays is most commonly assumed to be proportional to the average delay. By exploring how the valuation of train delays depends on delay risk and delay length, using three different stated choice data sets, we find that the “average delay” approach does not hold: the disutility increases slower than linearly in the delay risk. This means that using the average delay as a performance indicator, a guide for operations planning or for investment appraisal will underestimate the value of small risks of long delays relative to large risks for short delays. It also means that estimated valuations of “average delay” will depend on the delay risk level: valuations will be higher the lower the risk levels in the study are.