A systematic review of route optimisation and pre-emption methods for emergency vehicles

ABSTRACT

Reducing the travel time of emergency vehicles (EVs) is an effective way to improve critical services such as ambulance, fire, and police. Route optimisation and pre-emption are powerful techniques used to reduce EV travel time. This paper presents a systematic literature review of optimisation and pre-emption techniques for routing EVs. A detailed classification of existing techniques is presented along with critical analysis and discussion. The study observes the limitations of existing routing systems and lack of real-world applications of the proposed pre-emption systems, leading to several interesting and important knowledge and implementation gaps that require further investigation. These gaps include optimisations using real-time dynamic traffic data, considering time to travel as a critical parameter within dynamic route planning algorithms, considering advanced algorithms, assessing and minimising the effects of EV routing on other traffic, and addressing safety concerns in traffic networks containing multiple EVs at the same time.     

Electric vehicles’ energy consumption measurement and estimation

Use of electric vehicles (EVs) has been viewed by many as a way to significantly reduce oil dependence, operate vehicles more efficiently, and reduce carbon emissions. Due to the potential benefits of EVs, the federal and local governments have allocated considerable funding and taken a number of legislative and regulatory steps to promote EV deployment and adoption. With this momentum, it is not difficult to see that in the near future EVs could gain a significant market penetration, particularly in densely populated urban areas with systemic air quality problems. We will soon face one of the biggest challenges: how to improve efficiency for EV transportation system? This research takes the first step in tackling this challenge by addressing a fundamental issue, i.e. how to measure and estimate EVs’ energy consumption. In detail, this paper first presents a system which can collect in-use EV data and vehicle driving data. This system then has been installed in an EV conversion vehicle built in this research as a test vehicle. Approximately 5 months of EV data have been collected and these data have been used to analyze both EV performance and driver behaviors. The analysis shows that the EV is more efficient when driving on in-city routes than driving on freeway routes. Further investigation of this particular EV driver’s route choice behavior indicates that the EV user tries to balance the trade-off between travel time and energy consumption. Although more data are needed in order to generalize this finding, this observation could be important and might bring changes to the traffic assignment for future transportation system with a significant share of EVs. Additionally, this research analyzes the relationships among the EV’s power, the vehicle’s velocity, acceleration, and the roadway grade. Based on the analysis results, this paper further proposes an analytical EV power estimation model. The evaluation results using the test vehicle show that the proposed model can successfully estimate EV’s instantaneous power and trip energy consumption. Future research will focus on applying the proposed EV power estimation model to improve EVs’ energy efficiency.     

The electric vehicle touring problem

The increasing concern over global warming has led to the rapid development of the electric vehicle industry. Electric vehicles (EVs) have the potential to reduce the greenhouse effect and facilitate more efficient use of energy resources. In this paper, we study several EV route planning problems that take into consideration possible battery charging or swapping operations. Given a road network, the objective is to determine the shortest (travel time) route that a vehicle with a given battery capacity can take to travel between a pair of vertices or to visit a set of vertices with several stops, if necessary, at battery switch stations. We present polynomial time algorithms for the EV shortest travel time path problem and the fixed tour EV touring problem, where the fixed tour problem requires visiting a set of vertices in a given order. Based on the result, we also propose constant factor approximation algorithms for the EV touring problem, which is a generalization of the traveling salesman problem.     

Effect of speed limits in degradable transport networks

This paper studies how link-specific speed limits influence the performance of degradable transport networks, in which the capacity of each link is a degradable random variable. The distribution and cumulative distribution of link travel time have been presented with the effect of speed limits taken into account. The mean and variance of link and route travel time are formulated. Three link states have been classified, and their physical meanings have been discussed. The relationship between critical capacity, travel time and speed limit has been elaborated. We have proposed a Speed Limit- and Reliability-based User Equilibrium (SLRUE), adopting travel time budget as the principle of travelers’ route choice. A heuristic method employing the method of successive averages is developed to solve the SLRUE in degradable networks. Through numerical studies, we find that for some networks both the mean and standard deviation of the total travel time could be reduced simultaneously by imposing some speed limits. The speed limit design problem has been studied, and it is found that imposing speed limits cannot always reduce the total travel time budget of a network.     

A geometry-based algorithm to provide guidance for electric vehicle charging

Electric vehicles (EVs) have been regarded as effective options for solving the environmental and energy problems in the field of transportation. However, given the limited driving range and insufficient charging stations, searching and selecting charging stations is an important issue for EV drivers during trips. A smart charging service should be developed to help address the charging issue of EV drivers, and a practical algorithm for charging guidance is required to realise it. This study aims to design a geometry-based algorithm for charging guidance that can be effectively applied in the smart charging service. Geographic research findings and geometric approaches are applied to design the algorithm. The algorithm is practical because it is based on the information from drivers’ charging requests, and its total number of calculations is significantly less than that of the conventional shortest-first algorithm. The algorithm is effective because it considers the consistency of direction trend between the charging route and the destination in addition to the travel distance, which conforms to the travel demands of EV drivers. Moreover, simulation examples are presented to demonstrate the proposed algorithm. Results of the proposed algorithm are compared with those of the other two algorithms, which show that the proposed algorithm can obtain a better selection of charging stations for EV drivers from the perspective of entire travel chains and take a shorter computational time.     

A solution algorithm for a dynamic deterministic user equilibrium assignment model with departure time choice

Abstract

A route-based combined model of dynamic deterministic route and departure time choice and a solution method for many origin and destination pairs is proposed. The divided linear travel time model is used to calculate the link travel time and to describe the propagation of flow over time. For the calculation of route travel times, the predictive ideal route travel time concept is adopted. Solving the combined model of dynamic deterministic route and departure time choice is shown to be equivalent to solving simultaneously a system of non-linear equations. A Newton-type iterative scheme is proposed to solve this problem. The performance of the proposed solution method is demonstrated using a version of the Sioux Falls network. This shows that the proposed solution method produces good equilibrium solutions with reasonable computational cost.     

Electric vehicles’ energy consumption estimation with real driving condition data

The use of electric vehicles (EVs) is viewed as an attractive option to reduce CO₂ emissions and fuel consumption resulted from transport sector, but the popularization of EVs has been hindered by the cruising range limitation and the charging process inconvenience. Energy consumption characteristics analysis is the important foundation to study charging infrastructures locating, eco-driving behavior and energy saving route planning, which are helpful to extend EVs’ cruising range. From a physical and statistical view, this paper aims to develop a systematic energy consumption estimation approach suitable for EV actual driving cycles. First, by employing the real second-by-second driving condition data collected on typical urban travel routes, the energy consumption characteristics analysis is carried out specific to the microscopic driving parameters (instantaneous speed and acceleration) and battery state of charge (SOC). Then, based on comprehensive consideration of the mechanical dynamics characteristics and electric machine system of the EVs, a set of energy consumption rate estimation models are established under different operation modes from a statistical perspective. Finally, the performance of proposed model is fully evaluated by comparing with a conventional energy consumption estimation method. The results show that the proposed modeling approach represents a significant accuracy improvement in the estimation of real-world energy consumption. Specifically, the model precision increases by 25.25% in decelerating mode compared to the conventional model, while slight improvement in accelerating and cruising mode with desirable goodness of fit.     

Route swapping in dynamic traffic networks

A dynamic traffic assignment (DTA) model typically consists of a traffic performance model and a route choice model. The traffic performance model describes how traffic propagates (over time) along routes connecting origin-destination (OD) pairs, examples being the cell transmission model, the vertical queueing model and the travel time model. This is implemented in a dynamic network loading (DNL) algorithm, which uses the given route inflows to compute the link inflows (and hence link costs), which are then used to compute the route travel times (and hence route costs). A route swap process specifies the route inflows for tomorrow (at the next iteration) based on the route inflows today (at the current iteration). A dynamic user equilibrium (DUE), where each traveller on the network cannot reduce his or her cost of travel by switching to another route, can be sought by iterating between the DNL algorithm and the route swap process. The route swap process itself takes up very little computational time (although route set generation can be very computationally intensive for large networks). However, the choice of route swap process dramatically affects convergence and the speed of convergence. The paper details several route swap processes and considers whether they lead to a convergent system, assuming that the route cost vector is a monotone function of the route inflow vector.     

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.     

Survey of the operation and system study on wireless charging electric vehicle systems

This survey investigates the state-of-the-art in operations and systems-related studies of wireless charging electric vehicles (EVs). The wireless charging EV is one of emerging transportation systems in which the EV’s battery is charged via wireless power transfer (WPT) technology. The system makes use of charging infrastructure embedded under the surface of the road that transfers electric power to the vehicle while it is in transit. The survey focuses on studies related to both dynamic and quasi-dynamic types of wireless charging EV – charging while in motion and while temporarily stopped during a trip, respectively. The ability to charge EVs while in transit has raised numerous operations and systems issues that had not been observed in conventional EVs. This paper surveys the current research on such issues, including decisions on the allocation of charging infrastructure; cost and benefit analyses; billing and pricing; and other supporting operations and facilities. This survey consists of three parts. The first provides an orienting review of terminology specific to wireless charging EVs; it also reviews some past and ongoing developments and implementations of wireless charging EVs. The second part surveys the research on the operations and systems issues prompted by wireless charging EVs. The third part proposes future research directions. The goal of the survey is to provide researchers and practitioners with an overview of research trends and to provide a guide to promising future research directions.     

Decomposing travel times measured by probe-based traffic monitoring systems to individual road segments

In probe-based traffic monitoring systems, traffic conditions can be inferred based on the position data of a set of periodically polled probe vehicles. In such systems, the two consecutive polled positions do not necessarily correspond to the end points of individual links. Obtaining estimates of travel time at the individual link level requires the total traversal time (which is equal to the polling interval duration) be decomposed. This paper presents an algorithm for solving the problem of decomposing the traversal time to times taken to traverse individual road segments on the route. The proposed algorithm assumes minimal information about the network, namely network topography (i.e. links and nodes) and the free flow speed of each link. Unlike existing deterministic methods, the proposed solution algorithm defines a likelihood function that is maximized to solve for the most likely travel time for each road segment on the traversed route. The proposed scheme is evaluated using simulated data and compared to a benchmark deterministic method. The evaluation results suggest that the proposed method outperforms the bench mark method and on average improves the accuracy of the estimated link travel times by up to 90%.     

A stochastic multimodal reliable network design problem under adverse weather conditions

This paper formulates a network design problem (NDP) for finding the optimal public transport service frequencies and link capacity expansions in a multimodal network with consideration of impacts from adverse weather conditions. The proposed NDP aims to minimize the sum of expected total travel time, operational cost of transit services, and construction cost of link capacity expansions under an acceptable level of variance of total travel time. Auto, transit, bus, and walking modes are considered in the multimodal network model for finding the equilibrium flows and travel times. In the proposed network model, demands are assumed to follow Poisson distribution, and weather‐dependent link travel time functions are adopted. A probit‐based stochastic user equilibrium, which is based on the perceived expected travel disutility, is used to determine the multimodal route of the travelers. This model also considers the strategic behavior of the public transport travelers in choosing their routes, that is, common‐line network. Based on the stochastic multimodal model, the mean and variance of total travel time are analytical estimated for setting up the NDP. A sensitivity‐based solution algorithm is proposed for solving the NDP, and two numerical examples are adopted to demonstrate the characteristics of the proposed model. Copyright © 2014 John Wiley & Sons, Ltd.     

A computationally efficient simulation model for estimating energy consumption of electric vehicles in the context of route planning applications

The fact that electric vehicles (EVs) are characterized by relatively short driving range not only signifies the importance of routing applications to compute energy efficient or optimal paths, but also underlines the necessity for realistic simulation models to estimate the energy consumption of EVs. To this end, the present paper introduces an accurate yet computationally efficient energy consumption model for EVs, based on generic high-level specifications and technical characteristics. The proposed model employs a dynamic approach to simulate the energy recuperation capability of the EV and takes into account motor overload conditions to represent the vehicle performance over highly demanding route sections. To validate the simulation model developed in this work, its output over nine typical driving cycles is compared to that of the Future Automotive Systems Technology Simulator (FASTSim), which is a simulation tool tested on the basis of real-world data from existing vehicles. The validation results show that the mean absolute error (MAE) of cumulative energy consumption is less than 45 W h on average, while the computation time to perform each driving cycle is of the order of tens of milliseconds, indicating that the developed model strikes a reasonable balance between efficacy of representation and computational efficiency. Comprehensive simulation results are presented in order to exemplify the key features of the model and analyze its output under specific highly aggressive driving cycles for road gradients ranging from −6% to 6%, in support of its usability as a practical solution for estimating the energy consumption in EV routing applications.     

An adaptive information fusion model to predict the short-term link travel time distribution in dynamic traffic networks

As intelligent transportation systems (ITS) approach the realm of widespread deployment, there is an increasing need to robustly capture the variability of link travel time in real-time to generate reliable predictions of real-time traffic conditions. This study proposes an adaptive information fusion model to predict the short-term link travel time distribution by iteratively combining past information on link travel time on the current day with the real-time link travel time information available at discrete time points. The past link travel time information is represented as a discrete distribution. The real-time link travel time is represented as a range, and is characterized using information quality in terms of information accuracy and time delay. A nonlinear programming formulation is used to specify the adaptive information fusion model to update the short-term link travel time distribution by focusing on information quality. The model adapts good information by weighing it higher while shielding the effects of bad information by reducing its weight. Numerical experiments suggest that the proposed model adequately represents the short-term link travel time distribution in terms of accuracy and robustness, while ensuring consistency with ambient traffic flow conditions. Further, they illustrate that the mean of a representative short-term travel time distribution is not necessarily a good tracking indicator of the actual (ground truth) time-dependent travel time on that link. Parametric sensitivity analysis illustrates that information accuracy significantly influences the model, and dominates the effects of time delay and the consistency constraint parameter. The proposed information fusion model bridges key methodological gaps in the ITS deployment context related to information fusion and the need for short-term travel time distributions.     

Impact of government incentives on the market penetration of electric vehicles in Australia

Incentives to buy and use electric vehicles (EVs) may influence individuals’ decisions to do so. To examine these impacts, a latent class discrete choice model is developed to analyse consumer preferences related to EV attributes and related government incentives. Data was collected from a stated preference survey of 1,076 residents of New South Wales (NSW), Australia. According to the results, the proposed latent constructs classify respondents into five segments. The segments are then used to distinguish respondent behaviours regarding EV attributes and related government incentives. The results show that rebate on the upfront cost of an EV is the most preferred one-off financial incentive, because EVs are expected to be expensive, especially in Australia which has a very small EV market at present. Furthermore, rebates on energy bills and parking fees are also well-received, as these things are expensive in Sydney, Australia. Thus, operational incentives for discounts on energy bills and parking fees may facilitate the success of EVs in NSW.     

Dynamic stochastic journey time estimation and reliability analysis using stochastic cell transmission model: Algorithm and case studies

This paper proposes a framework for evaluating the distributions of stochastic dynamic link travel time and journey time as well as assessing the journey time reliability. Due to the stochastic nature of the flow profiles, the paper devises a sampling process to estimate the probability mass function (PMF) of the link travel time. This sampling process defines a likelihood concept that measures the probability of the difference between the cumulative stochastic link inflow and outflow profiles to be less than or equal to a prescribed bound. Based on this likelihood measure, the probability mass function (PMF) of the link travel time is evaluated over an appropriate sampling interval. The PMF of the journey time is then evaluated by extending the deterministic nested delay operator to a stochastic version which is defined as a series of “nested” conditional probabilities of the link travel time PMFs along the route. This paper also proposes a method to fit the PMF of the journey time to a class of statistical distribution to determine its skewness, which is useful in the analysis of journey time reliability. The paper then analyzes journey time reliability via the properties of dynamic travel time distributions such as confidence intervals and shape parameters. The proposed algorithm is applied to estimate the stochastic journey time on a freeway corridor from the stochastic cumulative inflow and outflow profiles generated from the stochastic cell transmission model. This methodology is validated with two empirical studies: (i) estimations of journey time distribution and reliability analysis for one short freeway segment in California during a specific time period and (ii) the effects of traffic incidents on journey time reliability for a long expressway corridor of Hanshin expressway (between Osaka and Kobe) in Japan.     

An integrated Bayesian approach for passenger flow assignment in metro networks

This paper proposes an integrated Bayesian statistical inference framework to characterize passenger flow assignment model in a complex metro network. In doing so, we combine network cost attribute estimation and passenger route choice modeling using Bayesian inference. We build the posterior density by taking the likelihood of observing passenger travel times provided by smart card data and our prior knowledge about the studied metro network. Given the high-dimensional nature of parameters in this framework, we apply the variable-at-a-time Metropolis sampling algorithm to estimate the mean and Bayesian confidence interval for each parameter in turn. As a numerical example, this integrated approach is applied on the metro network in Singapore. Our result shows that link travel time exhibits a considerable coefficient of variation about 0.17, suggesting that travel time reliability is of high importance to metro operation. The estimation of route choice parameters conforms with previous survey-based studies, showing that the disutility of transfer time is about twice of that of in-vehicle travel time in Singapore metro system.     

Optimal scheduling of a taxi fleet with mixed electric and gasoline vehicles to service advance reservations

This study addresses the problem of scheduling a fleet of taxis that are appointed to solely service customers with advance reservations. In contrast to previous studies that have dealt with the planning and operations of a taxi fleet with only electric vehicles (EVs), we consider that most taxi companies may have to operate with fleets comprised of both gasoline vehicles (GVs) and plug-in EVs during the transition from GV to (complete) EV taxi fleets. This paper presents an innovative multi-layer taxi-flow time-space network which effectively describes the movements of the taxis in the dimensions of space and time. An optimization model is then developed based on the time-space network to determine an optimal schedule for the taxi fleet. The objective is to minimize the total operating cost of the fleet, with a set of operating constraints for the EVs and GVs included in the model. Given that the model is formulated as an integer multi-commodity network flow problem, which is characterized as NP-hard, we propose two simple but effective decomposition-based heuristics to efficiently solve the problem with practical sizes. Test instances generated based on the data provided by a Taiwan taxi company are solved to evaluate the solution algorithms. The results show that the gaps between the objective values of the heuristic solutions and those of the optimal solutions are less than 3%, and the heuristics require much less time to obtain the good quality solutions. As a result, it is shown that the model, coupled with the algorithms, can be an effective planning tool to assist the company in routing and scheduling its fleet to service reservation customers.     

Modeling stochastic perception error in the mean-excess traffic equilibrium model

In this paper, we extend the α-reliable mean-excess traffic equilibrium (METE) model of Chen and Zhou (Transportation Research Part B 44(4), 2010, 493-513) by explicitly modeling the stochastic perception errors within the travelers’ route choice decision processes. In the METE model, each traveler not only considers a travel time budget for ensuring on-time arrival at a confidence level α, but also accounts for the impact of encountering worse travel times in the (1 − α) quantile of the distribution tail. Furthermore, due to the imperfect knowledge of the travel time variability particularly in congested networks without advanced traveler information systems, the travelers’ route choice decisions are based on the perceived travel time distribution rather than the actual travel time distribution. In order to compute the perceived mean-excess travel time, an approximation method based on moment analysis is developed. It involves using the conditional moment generation function to derive the perceived link travel time, the Cornish-Fisher Asymptotic Expansion to estimate the perceived travel time budget, and the Acerbi and Tasche Approximation to estimate the perceived mean-excess travel time. The proposed stochastic mean-excess traffic equilibrium (SMETE) model is formulated as a variational inequality (VI) problem, and solved by a route-based solution algorithm with the use of the modified alternating direction method. Numerical examples are also provided to illustrate the application of the proposed SMETE model and solution method.     

Shared autonomous electric vehicle (SAEV) operations across the Austin,Texas network with charging infrastructure decisions

Shared autonomous vehicles, or SAVs, have attracted significant public and private interest because of their opportunity to simplify vehicle access, avoid parking costs, reduce fleet size, and, ultimately, save many travelers time and money. One way to extend these benefits is through an electric vehicle (EV) fleet. EVs are especially suited for this heavy usage due to their lower energy costs and reduced maintenance needs. As the price of EV batteries continues to fall, charging facilities become more convenient, and renewable energy sources grow in market share, EVs will become more economically and environmentally competitive with conventionally fueled vehicles. EVs are limited by their distance range and charge times, so these are important factors when considering operations of a large, electric SAV (SAEV) fleet.This study simulated performance characteristics of SAEV fleets serving travelers across the Austin, Texas 6-county region. The simulation works in sync with the agent-based simulator MATSim, with SAEV modeling as a new mode. Charging stations are placed, as needed, to serve all trips requested (under 75 km or 47 miles in length) over 30 days of initial model runs. Simulation of distinctive fleet sizes requiring different charge times and exhibiting different ranges, suggests that the number of station locations depends almost wholly on vehicle range. Reducing charge times does lower fleet response times (to trip requests), but increasing fleet size improves response times the most. Increasing range above 175 km (109 miles) does not appear to improve response times for this region and trips originating in the urban core are served the quickest. Unoccupied travel accounted for 19.6% of SAEV mileage on average, with driving to charging stations accounting for 31.5% of this empty-vehicle mileage. This study found that there appears to be a limit on how much response time can be improved through decreasing charge times or increasing vehicle range.