Optimizing the locations of electric taxi charging stations: A spatial–temporal demand coverage approach

Vehicle electrification is a promising approach towards attaining green transportation. However, the absence of charging stations limits the penetration of electric vehicles. Current approaches for optimizing the locations of charging stations suffer from challenges associated with spatial–temporal dynamic travel demands and the lengthy period required for the charging process. The present article uses the electric taxi (ET) as an example to develop a spatial–temporal demand coverage approach for optimizing the placement of ET charging stations in the space–time context. To this end, public taxi demands with spatial and temporal attributes are extracted from massive taxi GPS data. The cyclical interactions between taxi demands, ETs, and charging stations are modeled with a spatial–temporal path tool. A location model is developed to maximize the level of ET service on the road network and the level of charging service at the stations under spatial and temporal constraints such as the ET range, the charging time, and the capacity of charging stations. The reduced carbon emission generated by used ETs with located charging stations is also evaluated. An experiment conducted in Shenzhen, China demonstrates that the proposed approach not only exhibits good performance in determining ET charging station locations by considering temporal attributes, but also achieves a high quality trade-off between the levels of ET service and charging service. The proposed approach and obtained results help the decision-making of urban ET charging station siting.     

A network-based dispatch model for evaluating the spatial and temporal effects of plug-in electric vehicle charging on GHG emissions

The well-to-wheel emissions associated with plug-in electric vehicles (PEVs) depend on the source of electricity and the current non-vehicle demand on the grid, thus must be evaluated via an integrated systems approach. We present a network-based dispatch model for the California electricity grid consisting of interconnected sub-regions to evaluate the impact of growing PEV demand on the existing power grid infrastructure system and energy resources. This model, built on a linear optimization framework, simultaneously considers spatiality and temporal dynamics of energy demand and supply. It was successfully benchmarked against historical data, and used to determine the regional impacts of several PEV charging profiles on the current electricity network. Average electricity carbon intensities for PEV charging range from 244 to 391 gCO₂e/kW h and marginal values range from 418 to 499 gCO₂e/kW h.     

Stochastic dynamic switching in fixed and flexible transit services as market entry-exit real options

The first analytical stochastic and dynamic model for optimizing transit service switching is proposed for “smart transit” applications and for operating shared autonomous transit fleets. The model assumes a region that requires many-to-one last mile transit service either with fixed-route buses or flexible-route, on-demand buses. The demand density evolves continuously over time as an Ornstein-Uhlenbeck process. The optimal policy is determined by solving the switching problem as a market entry and exit real options model. Analysis using the model on a benchmark computational example illustrates the presence of a hysteresis effect, an indifference band that is sensitive to transportation system state and demand parameters, as well as the presence of switching thresholds that exhibit asymmetric sensitivities to transportation system conditions. The proposed policy is computationally compared in a 24-hour simulation to a “perfect information” set of decisions and a myopic policy that has been dominant in the flexible transit literature, with results that suggest the proposed policy can reduce by up to 72% of the excess cost in the myopic policy. Computational experiments of the “modular vehicle” policy demonstrate the existence of an option premium for having flexibility to switch between two vehicle sizes.     

Fast-charging station choice behavior among battery electric vehicle users

This study explores how battery electric vehicle users choose where to fast-charge their vehicles from a set of charging stations, as well as the distance by which they are generally willing to detour for fast-charging. The focus is on fast-charging events during trips that include just one fast-charge between origin and destination in Kanagawa Prefecture, Japan. Mixed logit models with and without a threshold effect for detour distance are applied to panel data extracted from a two-year field trial on battery electric vehicle usage in Japan. Findings from the mixed logit model with threshold show that private users are generally willing to detour up to about 1750 m on working days and 750 m on non-working days, while the distance is 500 m for commercial users on both working and non-working days. Users in general prefer to charge at stations requiring a shorter detour and use chargers located at gas stations, and are significantly affected by the remaining charge. Commercial users prefer to charge at stations encountered earlier along their paths, while only private users traveling on working days show such preference and they turn to prefer the stations encountered later when choosing a station in peak hours. Only private users traveling on working days show a strong preference for free charging. Commercial users tend to pay for charging at a station within 500 m detour distance. The fast charging station choice behavior is heterogeneous among users. These findings provide a basis for early planning of a public fast charging infrastructure.     

A bi-level model for single-line rail timetable design with consideration of demand and capacity

This paper proposes a bi-level model to solve the timetable design problem for an urban rail line. The upper level model aims at determining the headways between trains to minimize total passenger cost, which includes not only the usual perceived travel time cost, but also penalties during travel. With the headways given by the upper level model, passengers’ arrival times at their origin stops are determined by the lower level model, in which the cost-minimizing behavior of each passenger is taken into account. To make the model more realistic, explicit capacity constraints of individual trains are considered. With these constraints, passengers cannot board a full train, but wait in queues for the next coming train. A two-stage genetic algorithm incorporating the method of successive averages is introduced to solve the bi-level model. Two hypothetical examples and a real world case are employed to evaluate the effectiveness of the proposed bi-level model and algorithm. Results show that the bi-level model performs well in reducing total passenger cost, especially in reducing waiting time cost and penalties. And the section loading-rates of trains in the optimized timetable are more balanced than the even-headway timetable. The sensitivity analyses show that passenger’s desired arrival time interval at destination and crowding penalty factor have a high influence on the optimal solution. And with the dispersing of passengers' desired arrival time intervals or the increase of crowding penalty factor, the section loading-rates of trains become more balanced.     

Determining locations of charging stations for electric taxis using taxi operation data

The adequate provision of charging infrastructure is critical for the effective deployment of electric taxis. This study attempts to locate charging stations for electric taxis reflecting real-world taxi travel patterns identified from taxis equipped with digital tachographs. Data for one week are processed in order to estimate their charge demand. The estimated temporal distribution of charge demand indicates that it varies day-by-day and hour-by-hour. The maximum set covering model is applied for determining the locations of charging stations. The results show that the pre-specified service distance and service coverage rate (defined by the proportion of total demand served) can be critical factors for determining the number and location of charging stations. These factors should be carefully specified by considering the tradeoff between operational efficiency of charging facilities and user convenience.     

Point queue models: A unified approach

In transportation and other types of facilities, various queues arise when the demands of service are higher than the supplies, and many point and fluid queue models have been proposed to study such queueing systems. However, there has been no unified approach to deriving such models, analyzing their relationships and properties, and extending them for networks. In this paper, we derive point queue models as limits of two link-based queueing model: the link transmission model and a link queue model. With two definitions for demand and supply of a point queue, we present four point queue models, four approximate models, and their discrete versions. We discuss the properties of these models, including equivalence, well-definedness, smoothness, and queue spillback, both analytically and with numerical examples. We then analytically solve Vickrey’s point queue model and stationary states in various models. We demonstrate that all existing point and fluid queue models in the literature are special cases of those derived from the link-based queueing models. Such a unified approach leads to systematic methods for studying the queueing process at a point facility and will also be helpful for studies on stochastic queues as well as networks of queues.     

A linear programming formulation for autonomous intersection control within a dynamic traffic assignment and connected vehicle environment

This paper develops a novel linear programming formulation for autonomous intersection control (LPAIC) accounting for traffic dynamics within a connected vehicle environment. Firstly, a lane based bi-level optimization model is introduced to propagate traffic flows in the network, accounting for dynamic departure time, dynamic route choice, and autonomous intersection control in the context of system optimum network model. Then the bi-level optimization model is transformed to the linear programming formulation by relaxing the nonlinear constraints with a set of linear inequalities. One special feature of the LPAIC formulation is that the entries of the constraint matrix has only {−1, 0, 1} values. Moreover, it is proved that the constraint matrix is totally unimodular, the optimal solution exists and contains only integer values. It is also shown that the traffic flows from different lanes pass through the conflict points of the intersection safely and there are no holding flows in the solution. Three numerical case studies are conducted to demonstrate the properties and effectiveness of the LPAIC formulation to solve autonomous intersection control.     

Scheduling of airport runway operations using stochastic branch and bound methods

In this paper we present a solution methodology based on the stochastic branch and bound algorithm to find optimal, or close to optimal, solutions to the stochastic airport runway scheduling problem. The objective of the scheduling problem is to find a sequence of aircraft operations on one or several runways that minimizes the total makespan, given uncertain aircraft availability at the runway. Enhancements to the general stochastic branch and bound algorithm are proposed and we give the specific details pertaining to runway scheduling. We show how the algorithm can be terminated early with solutions that are close to optimal, and investigate the impact of the uncertainty level. The computational experiment indicates that the sequences obtained using the stochastic branch and bound algorithm have, on average, 5–7% shorter makespans than sequences obtained using deterministic sequencing models. In addition, the proposed algorithm is able to solve instances with 14 aircraft using less than 1 min of computation time.     

Optimizing charging station locations for urban taxi providers

Recently, electric vehicles are gaining importance which helps to reduce dependency on oil, increases energy efficiency of transportation, reduces carbon emissions and noise, and avoids tail pipe emissions. Because of short daily driving distances, high mileage, and intermediate waiting time, fossil-fuelled taxi vehicles are ideal candidates for being replaced by battery electric vehicles (BEVs). Moreover, taxi BEVs would increase visibility of electric mobility and therefore encourage others to purchase an electric vehicle. Prior to replacing conventional taxis with BEVs, a suitable charging infrastructure has to be established. This infrastructure consists of a sufficiently dense network of charging stations taking into account the lower driving ranges of BEVs.In this case study we propose a decision support system for placing charging stations in order to satisfy the charging demand of electric taxi vehicles. Operational taxi data from about 800 vehicles is used to identify and estimate the charging demand for electric taxis based on frequent origins and destinations of trips. Next, a variant of the maximal covering location problem is formulated and solved to satisfy as much charging demand as possible with a limited number of charging stations. Already existing fast charging locations are considered in the optimization problem. In this work, we focus on finding regions in which charging stations should be placed rather than exact locations. The exact location within an area is identified in a post-optimization phase (e.g., by authorities), where environmental conditions are considered, e.g., the capacity of the power network, availability of space, and legal issues.Our approach is implemented in the city of Vienna, Austria, in the course of an applied research project that has been conducted in 2014. Local authorities, power network operators, representatives of taxi driver guilds as well as a radio taxi provider participated in the project and identified exact locations for charging stations based on our decision support system.     

Who can recharge a plug-in electric vehicle at home?

We construct consumer-informed estimates of residential access to vehicle charging to guide understanding of plug-in electric vehicle demand, use, and energy impacts. Using a web-based survey, study 1 estimates that about half of new car-buying US households park at least one vehicle within 25 ft of a Level 1 (110/120 V) electrical outlet at home. Study 2 estimates that just under one-third of new car-buying households in San Diego County have access to Level 2 (220/240 V) charging. Further, 20% of the sample are both able and willing to install Level 2 PEV recharging infrastructure at the prices examined.     

Walking-distance introduced queueing model for pedestrian queueing system: Theoretical analysis and experimental verification

We have introduced the effect of delay in walking from the head of a queue to the service windows in the queueing model and obtain a suitable type of queueing system under various conditions by both computational simulation and theoretical analysis. When there are multiple service windows, the queueing theory indicates that mean waiting time in a fork-type queueing system (Fork), which collects pedestrians into a single queue, is smaller than that in a parallel-type queueing system (Parallel), i.e., queues for each service window. However, in our walking-distance introduced queueing model, we have examined that mean waiting time in Parallel becomes smaller when both the arrival probability of pedestrians and the effect of walking distance are large. Moreover, enhanced Forks, which shorten waiting time by reducing the effect of walking distance, are considered, and parts of our results are also verified by real queueing experiments.     

Accuracy of reinforcement learning algorithms for predicting aircraft taxi-out times: A case-study of Tampa Bay departures

Taxi-out delay is a significant portion of the block time of a flight. Uncertainty in taxi-out times reduces predictability of arrival times at the destination. This in turn results in inefficient use of airline resources such as aircraft, crew, and ground personnel. Taxi-out time prediction is also a first step in enabling schedule modifications that would help mitigate congestion and reduce emissions. The dynamically changing operation at the airport makes it difficult to accurately predict taxi-out time. In this paper we investigate the accuracy of taxi out time prediction using a nonparametric reinforcement learning (RL) based method, set in the probabilistic framework of stochastic dynamic programming. A case-study of Tampa International Airport (TPA) shows that on an average, with 93.7% probability, on any given day, our predicted mean taxi-out time for any given quarter, matches the actual mean taxi-out time for the same quarter with a standard error of 1.5 min. Also, for individual flights, the taxi-out time of 81% of them were predicted accurately within a standard error of 2 min. The predictions were done 15 min before gate departure. Gate OUT, wheels OFF, wheels ON, and gate IN (OOOI) data available in the Aviation System Performance Metric (ASPM) database maintained by the Federal Aviation Administration (FAA) was used to model and analyze the problem. The prediction accuracy is high even without the use of detailed track data.     

Integrated planning of static and dynamic charging infrastructure for electric vehicles

This paper investigates the optimal deployment of static and dynamic charging infrastructure considering the interdependency between transportation and power networks. Static infrastructure means plug-in charging stations, while the dynamic counterpart refers to electrified roads or charging lanes enabled by charging-while-driving technology. A network equilibrium model is first developed to capture the interactions among battery electric vehicles’ (BEVs) route choices, charging plans, and the prices of electricity. A mixed-integer bi-level program is then formulated to determine the deployment plan of charging infrastructure to minimize the total social cost of the coupled networks. Numerical examples are provided to demonstrate travel and charging plans of BEV drivers and the competitiveness of static and dynamic charging infrastructure. The numerical results on three networks suggest that (1) for individual BEV drivers, the choice between using charging lanes and charging stations is more sensitive to parameters including value of travel time, service fee markup, and battery size, but less sensitive to the charging rates and travel demand; (2) deploying more charging lanes is favorable for transportation networks with sparser topology while more charging stations can be more preferable for those denser networks.     

Optimal locations of electric public charging stations using real world vehicle travel patterns

We propose an optimization model based on vehicle travel patterns to capture public charging demand and select the locations of public charging stations to maximize the amount of vehicle-miles-traveled (VMT) being electrified. The formulated model is applied to Beijing, China as a case study using vehicle trajectory data of 11,880 taxis over a period of three weeks. The mathematical problem is formulated in GAMS modeling environment and Cplex optimizer is used to find the optimal solutions. Formulating mathematical model properly, input data transformation, and Cplex option adjustment are considered for accommodating large-scale data. We show that, compared to the 40 existing public charging stations, the 40 optimal ones selected by the model can increase electrified fleet VMT by 59% and 88% for slow and fast charging, respectively. Charging demand for the taxi fleet concentrates in the inner city. When the total number of charging stations increase, the locations of the optimal stations expand outward from the inner city. While more charging stations increase the electrified fleet VMT, the marginal gain diminishes quickly regardless of charging speed.     

Wireless charging in California: Range,recharge, and vehicle electrification

This research evaluated the potential for wireless dynamic charging (charging while moving) to address range and recharge issues of modern electric vehicles by considering travel to regional destinations in California. A 200-mile electric vehicle with a real range of 160 miles plus 40 miles reserve was assumed to be used by consumers in concert with static and dynamic charging as a strict substitute for gasoline vehicle travel. Different combinations of wireless charging power (20–120 kW) and vehicle range (100–300 miles) were evaluated. One of the results highlighted in the research indicated that travel between popular destinations could be accomplished with a 200-mile EV and a 40 kW dynamic wireless charging system at a cost of about $2.5 billion. System cost for a 200-mile EV could be reduced to less than $1 billion if wireless vehicle charging power levels were increased to 100 kW or greater. For vehicles consuming 138 kWh of dynamic energy per year on a 40 kW dynamic system, the capital cost of $2.5 billion plus yearly energy costs could be recouped over a 20-year period at an average cost to each vehicle owner of $512 per year at a volume of 300,000 vehicles or $168 per year at a volume of 1,000,000 vehicles. Cost comparisons of dynamic charging, increased battery capacity, and gasoline refueling were presented. Dynamic charging, coupled with strategic wayside static charging, was shown to be more cost effective to the consumer over a 10-year period than gasoline refueling at $2.50 or $4.00 per gallon. Notably, even at very low battery prices of $100 per kWh, the research showed that dynamic charging can be a more cost effective approach to extending range than increasing battery capacity.     

Electric vehicle parking in European and American context: Economic,energy and environmental analysis

The transportation sector faces increasing challenges related to energy consumption and local and global emissions profiles. Thus, alternative vehicle technologies and energy pathways are being considered in order to overturn this trend and electric mobility is considered one adequate possibility towards a more sustainable transportation sector.In this sense, this research work consisted on the development of a methodology to assess the economic feasibility of deploying EV charging stations (Park-EV) by quantifying the tradeoff between economic and energy/environmental impacts for EV parking spaces deployment. This methodology was applied to 4 different cities (Lisbon, Madrid, Minneapolis and Manhattan), by evaluating the influence of parking premium, infrastructure cost and occupancy rates on the investment Net Present Value (NPV). The main findings are that the maximization of the premium and the minimization of the equipment cost lead to higher NPV results. The NPV break-even for the cities considered is more “easily” reached for higher parking prices, namely in the case of Manhattan with the higher parking price profile. In terms of evaluating occupancy rates of the EV parking spaces, shifting from a low usage (LU) to a high usage (HU) scenario represented a reduction in the premium to obtain a NPV = 0 of approximately 14% for a 2500 € equipment cost, and, in the case of a zero equipment cost (e.g. financed by the city), a NPV = 0 was obtained with approximately a 2% reduction in the parking premium. Moreover, due to the use of electric mobility instead of the average conventional technologies, Well-to-Wheel (WTW) gains for Lisbon, Madrid, Minneapolis and Manhattan were estimated in 58%, 53%, 52% and 75% for energy consumption and 66%, 75%, 62% and 86% for CO₂ emissions, respectively.This research confirms that the success of deploying an EV charging stations infrastructure will be highly dependent on the price the user will have to pay, on the cost of the infrastructure deployed and on the adhesion of the EV users to this kind of infrastructure. These variables are not independent and, consequently, the coordination of public policies and private interest must be promoted in order to reach an optimal solution that does not result in prohibitive costs for the users.     

Siting public electric vehicle charging stations in Beijing using big-data informed travel patterns of the taxi fleet

Charging infrastructure is critical to the development of electric vehicle (EV) system. While many countries have implemented great policy efforts to promote EVs, how to build charging infrastructure to maximize overall travel electrification given how people travel has not been well studied. Mismatch of demand and infrastructure can lead to under-utilized charging stations, wasting public resources. Estimating charging demand has been challenging due to lack of realistic vehicle travel data. Public charging is different from refueling from two aspects: required time and home-charging possibility. As a result, traditional approaches for refueling demand estimation (e.g. traffic flow and vehicle ownership density) do not necessarily represent public charging demand. This research uses large-scale trajectory data of 11,880 taxis in Beijing as a case study to evaluate how travel patterns mined from big-data can inform public charging infrastructure development. Although this study assumes charging stations to be dedicated to a fleet of PHEV taxis which may not fully represent the real-world situation, the methodological framework can be used to analyze private vehicle trajectory data as well to improve our understanding of charging demand for electrified private fleet. Our results show that (1) collective vehicle parking “hotspots” are good indicators for charging demand; (2) charging stations sited using travel patterns can improve electrification rate and reduce gasoline consumption; (3) with current grid mix, emissions of CO₂, PM, SO₂, and NO_x will increase with taxi electrification; and (4) power demand for public taxi charging has peak load around noon, overlapping with Beijing’s summer peak power.     

Delay to major street through vehicles at two-way stop-controlled intersections

This paper describes a methodology for predicting the delay to major street through vehicles at two-way stop-controlled intersections. This delay is incurred when major street left-turn demand exceeds the available storage area and blocks the adjacent through lane. The through lane blockage problem does not generally occur with significant frequency on streets with divided cross sections that have left-turn bays or lanes; however, it frequently occurs on undivided streets due to their lack of left-turn storage. To minimize this delay, through drivers often merge with vehicles in the adjacent through lane—if there is an adequate gap for them to safely merge into. If there is no merge opportunity, then the through drivers will stay in the inside lane until the queue ahead dissipates. The through vehicle delay predicted by the methodology was found to be relatively small (i.e. less than 5 s veh⁻¹) when compared with delays commonly incurred by non-priority movements at unsignalized intersections. However, when expressed in terms of total vehicle hours of delay, the effect can be quite significant. In general, through vehicle delay increases with increasing approach flow rate and left-turn percentage. However, at flow rates in excess of about 1400 veh h⁻¹, delays increase very rapidly and there is evidence that larger left-turn percentages may have lower delays. ©     

Forecasting short-term subway passenger flow under special events scenarios using multiscale radial basis function networks

Reliable and accurate short-term subway passenger flow prediction is important for passengers, transit operators, and public agencies. Traditional studies focus on regular demand forecasting and have inherent disadvantages in predicting passenger flows under special events scenarios. These special events may have a disruptive impact on public transportation systems, and should thus be given more attention for proactive management and timely information dissemination. This study proposes a novel multiscale radial basis function (MSRBF) network for forecasting the irregular fluctuation of subway passenger flows. This model is simplified using a matching pursuit orthogonal least squares algorithm through the selection of significant model terms to produce a parsimonious MSRBF model. Combined with transit smart card data, this approach not only exhibits superior predictive performance over prevailing computational intelligence methods for non-regular demand forecasting at least 30 min prior, but also leverages network knowledge to enhance prediction capability and pinpoint vulnerable subway stations for crowd control measures. Three empirical studies with special events in Beijing demonstrate that the proposed algorithm can effectively predict the emergence of passenger flow bursts.