Hybrid predictive control for real-time optimization of public transport systems’ operations based on evolutionary multi-objective optimization

A hybrid predictive control formulation based on evolutionary multi-objective optimization to optimize real-time operations of public transport systems is presented. The state space model includes bus position, expected load and arrival time at stops. The system is based on discrete events, and the possible operator control actions are: holding vehicles at stations and skipping some stations. The controller (operator) pursues the minimization of a dynamic objective function to generate better operational decisions under uncertain demand at bus stops. In this work, a multi-objective approach is conducted to include different goals in the optimization process that could be opposite. In this case, the optimization was defined in terms of two objectives: waiting time minimization on one side, and impact of the strategies on the other. A genetic algorithm method is proposed to solve the multi-objective dynamic problem. From the conducted experiments considering a single bus line corridor, we found that the two objectives are opposite but with a certain degree of overlapping, in the sense that in all cases both objectives significantly improve the level of service with respect to the open-loop scenario by regularizing the headways. On average, the observed trade-off validates the proposed multi-objective methodology for the studied system, allowing dynamically finding the pseudo-optimal Pareto front and making real-time decisions based on different optimization criteria reflected in the proposed objective function compounds.     

Incentivized vehicle relocation in vehicle sharing systems

The asymmetric demand-offer problem represents a major challenge for one-way vehicle sharing systems (VSS) affecting their economic viability as it necessitates the engagement of considerable human (and financial) resources in relocating vehicles to satisfy customer demand. In this paper, we propose a novel approach which involves user-based vehicle relocations to address supply-and-demand mismatches; in our approach, VSS users are offered price incentives so as to accept picking up their vehicle from an oversupplied station and/or to drop it off to an under-supplied station. The system incentivizes users based on the priorities of vehicle relocations among stations, taking into account the fluctuating demand for vehicles and parking places at different stations over time. A graph-theoretic approach is employed for modeling the problem of allocating vehicles to users in a way that maximizes the profit of the system taking into account the budget the VSS can afford to spend for rewarding users, as well as the users’ strategic behavior. We present two different schemes for incentivizing users to act in favour of the system. Both schemes consider budget constraints and are truthful and budget-feasible. We have extensively evaluated our approach through simulations which demonstrated significant gain with respect to the number of completed trips and system revenue. We have also validated our approach through pilot trials conducted in a free-floating e-motorbike sharing system in the framework of an EU-funded research project.     

Dynamic operations and pricing of electric unmanned aerial vehicle systems and power networks

The emergence of electric unmanned aerial vehicle (E-UAV) technologies, albeit somewhat futuristic, is anticipated to pose similar challenges to the system operation as those of electric vehicles (EVs). Notably, the charging of EVs en-route at charging stations has been recognized as a significant type of flexible load for power systems, which often imposes non-negligible impacts on the power system operator’s decisions on electricity prices. Meanwhile, the charging cost based on charging time and price is part of the trip cost for the users, which can affect the spatio-temporal assignment of E-UAV traffic to charging stations. This paper aims at investigating joint operations of coupled power and electric aviation transportation systems that are associated with en-route charging of E-UAVs in a centrally controlled and yet dynamic setting, i.e., with time-varying travel demand and power system base load. Dynamic E-UAV charging assignment is used as a tool to smooth the power system load. A joint pricing scheme is proposed and a cost minimization problem is formulated to achieve system optimality for such coupled systems. Numerical experiments are performed to test the proposed pricing scheme and demonstrate the benefits of the framework for joint operations.     

Siting charging stations for electric vehicle adoption in shared autonomous fleets

The transportation sector is undergoing three revolutions: shared mobility, autonomous driving, and electrification. When planning the charging infrastructure for electric vehicles, it is critical to consider the potential interactions and synergies among these three emerging systems. This study proposes a framework to optimize charging infrastructure development for increasing electric vehicle (EV) adoption in systems with different levels of autonomous vehicle adoption and ride sharing participation. The proposed model also accounts for the pre-existing charging infrastructure, vehicle queuing at the charging stations, and the trade-offs between building new charging stations and expanding existing ones with more charging ports.Using New York City (NYC) taxis as a case study, we evaluated the optimum charging station configurations for three EV adoption pathways. The pathways include EV adoption in a 1) traditional fleet (non-autonomous vehicles without ride sharing), 2) future fleet (fully autonomous vehicles with ride sharing), and 3) switch-over from traditional to future fleet. Our results show that, EV adoption in a traditional fleet requires charging infrastructure with fewer stations that each has more charging ports, compared to the future fleet which benefits from having more scattered charging stations. Charging will only reduce the service level by 2% for a future fleet with 100% EV adoption. EV adoption can reduce CO₂ emissions of NYC taxis by up to 861 Tones/day for the future fleet and 1100 Tones/day for the traditional fleet.     

Witkar: Amsterdam's self-drive hire city car

A small electrically powered city car has been developed for self-drive hire in the centre of Amsterdam; 35 of these cars are now available to hire from 5 stations in the city centre. The. system has been designed for fully automatic control, including direct debit of hirers' accounts at the Amsterdam Savings Bank. The system, which was conceived in 1969 by an industrial designer and former city councillor to reduce traffic in central Amsterdam, failed to win the support of the City Council and has since been developed by a specially formed co-operative society. The co-operative managed to raise loans of US$ 250,000 for the first phase which has now been completed. This included the design and construction of the vehicles, the purchase of a mini-computer for the central control system, development of the control software and construction of the first five stations. A further 10 stations are scheduled for operation by the end of 1976, by which time the fleet should be extended to 100 vehicles. The ultimate target is 150 stations and 1000 vehicles.     

Vehicle reidentification and travel time measurement across freeway junctions using the existing detector infrastructure

Conventional vehicle detectors are capable of monitoring discrete points along the freeway but do not provide information about conditions on the link between detectors. Knowledge of conditions on the link is useful to operating agencies for enabling timely decisions in response to various delay causing events and hence to reduce the resulting congestion of the freeway system. This paper presents an approach that matches vehicle measurements between detector stations to provide information on the conditions over the link between the detectors rather than relying strictly on the aggregate point measurements from the detectors. In particular this work reidentifies measurements from distinct vehicles using the existing loop detector infrastructure. Here the distinct vehicles are the long vehicles, but depending on the vehicle population or type of detector used, one might chose to use some other reproducible feature.This new methodology represents an important advancement over preceding loop based vehicle reidentification, as illustrated herein, it enables vehicle reidentification across a major diverge and a major merge. The examples include a case where the reidentification algorithm responded to delay between two detector stations an hour before the delay was locally observable at either of the stations used for reidentification. While previous loop based reidentification work was limited to dual loop detectors, the present effort also extends the methodology to single loop detectors; thereby making it more widely applicable. Although the research uses loop detector data, the algorithm would be equally applicable to data obtained from many other traffic detectors that provide reproducible vehicle features.     

Deploying public charging stations for electric vehicles on urban road networks

This paper explores how to optimally locate public charging stations for electric vehicles on a road network, considering drivers’ spontaneous adjustments and interactions of travel and recharging decisions. The proposed approach captures the interdependency of different trips conducted by the same driver by examining the complete tour of the driver. Given the limited driving range and recharging needs of battery electric vehicles, drivers of electric vehicles are assumed to simultaneously determine tour paths and recharging plans to minimize their travel and recharging time while guaranteeing not running out of charge before completing their tours. Moreover, different initial states of charge of batteries and risk-taking attitudes of drivers toward the uncertainty of energy consumption are considered. The resulting multi-class network equilibrium flow pattern is described by a mathematical program, which is solved by an iterative procedure. Based on the proposed equilibrium framework, the charging station location problem is then formulated as a bi-level mathematical program and solved by a genetic-algorithm-based procedure. Numerical examples are presented to demonstrate the models and provide insights on public charging infrastructure deployment and behaviors of electric vehicles.     

The design of electric vehicle charging network

The promotion of Electric Vehicles (EVs) has become a key measure of the governments in their attempt to reduce greenhouse gas emissions. However, range anxiety is a big barrier for drivers to choose EVs over traditional vehicles. Installing more charging stations in appropriate locations can relieve EV drivers’ range anxiety. To determine the locations of public charging stations, we propose two optimization models for two different charging modes - fast and slow charging, which aim at minimizing the total cost while satisfying certain coverage goal. Instead of using discrete points, we use geometric objects to represent charging demands. Importantly, to resolve the partial coverage problem (PCP) for networks, we extend the polygon overlay method to split the demands on the road network. After applying the models to Greater Toronto and Hamilton Area (GTHA) and to Downtown Toronto, we show that the proposed models are practical and effective in determining the locations of charging stations. Moreover, they can eliminate PCP and provide much more accurate results than the complementary partial coverage method (CP).     

Analysis of a cooperative variable speed limit system using microscopic traffic simulation

Variable speed limit systems where variable message signs are used to show speed limits adjusted to the prevailing road or traffic conditions are installed on motorways in many countries. The objectives of variable speed limit system installations are often to decrease the number of accidents and to increase traffic efficiency. Currently, there is an interest in exploring the potential of cooperative intelligent transport systems including communication between vehicles and/or vehicles and the infrastructure. In this paper, we study the potential benefits of introducing infrastructure to vehicle communication, autonomous vehicle control and individualized speed limits in variable speed limit systems. We do this by proposing a cooperative variable speed limit system as an extension of an existing variable speed limit system. In the proposed system, communication between the infrastructure and the vehicles is used to transmit variable speed limits to upstream vehicles before the variable message signs become visible to the drivers. The system is evaluated by the means of microscopic traffic simulation. Traffic efficiency and environmental effects are considered in the analysis. The results of the study show benefits of the infrastructure to vehicle communication, autonomous vehicle control and individualized speed limits for variable speed limit systems in the form of lower acceleration rates and thereby harmonized traffic flow and reduced exhaust emissions.     

A new shared vehicle system for urban areas

The paper concerns the conceptual design of a transport system for pedestrian areas. The proposed transport system is based on a fleet of eco-sustainable Personal Intelligent City Accessible Vehicles (PICAVs). The vehicles are shared through the day by different users and the following specific services will be provided: instant access, open ended reservation and one way trips. Referring to the proposed transport system, a new methodology to optimise the fleet dimension and its distribution among the stations is proposed in this paper. The problem faced is an optimisation problem where the cost function to be minimised takes into account both the transport system cost and the user costs that depend on the waiting times. A random search algorithm has been adopted. Given a fleet dimension and its distribution among the stations, the waiting times of the users are assessed by a microscopic simulation. The simulation model tracks the second-by-second activity of each PICAV user, as well as the second-by-second activity of each vehicle. The overall methodology has been implemented in an object-oriented simulator. The proposed transport system has been planned and simulated for the historical city centre of Genoa, Italy.     

A cost-competitiveness analysis of charging infrastructure for electric bus operations

This study investigates the cost competitiveness of different types of charging infrastructure, including charging stations, charging lanes (via charging-while-driving technologies) and battery swapping stations, in support of an electric public transit system. To this end, we first establish mathematical models to investigate the optimal deployment of various charging facilities along the transit line and determine the optimal size of the electric bus fleet, as well as their batteries, to minimize total infrastructure and fleet costs while guaranteeing service frequency and satisfying the charging needs of the transit system. We then conduct an empirical analysis utilizing available real-world data. The results suggest that: (1) the service frequency, circulation length, and operating speed of a transit system may have a great impact on the cost competitiveness of different charging infrastructure; (2) charging lanes enabled by currently available inductive wireless charging technology are cost competitive for most of the existing bus rapid transit corridors; (3) swapping stations can yield a lower total cost than charging lanes and charging stations for transit systems with high operating speed and low service frequency; (4) charging stations are cost competitive only for transit systems with very low service frequency and short circulation; and (5) the key to making charging lanes more competitive for transit systems with low service frequency and high operating speed is to reduce their unit-length construction cost or enhance their charging power.     

Highway voting system: Embracing a possible paradigm shift in traffic data acquisition

The integration of internet and mobile phones has opened the door to a new wave of utilizing private vehicles as probes not only for performance evaluation but for traffic control as well, gradually replacing the role of traffic surveillance systems as the dominant source of traffic data. To prepare for such a paradigm shift, one needs to overcome some key institutional barriers, in particular, the privacy issue. A Highway Voting System (HVS) is proposed to address this issue in which drivers provide link- and/or path-based vehicle data to the traffic management system in the form of “votes” in order to receive favorable service from traffic control. The proposed HVS offers a platform that links data from individual vehicles directly with traffic control. In the system, traffic control responds to voting vehicles in a way similar to the current system responding to prioritized vehicles and providing the requested services accordingly. We show in the paper that the proposed “voting” system can effectively resolve the privacy issue which often hampers traffic engineers from getting detailed data from drivers. Strategies to entice drivers into “voting” so as to increase the market penetration level under all traffic conditions are discussed. Though the focus of the paper is on addressing the institutional issues associated with data acquisition from individual vehicles, other research topics associated with the proposed system are identified. Two examples are given to demonstrate the impact of the proposed system on algorithm development and traffic control.     

Transit scheduling

This paper provides an overview of the transit operational planning process with an emphasis on certain aspects of new methodologies in scheduling. The transit scheduling system usually consists of three interelated components: (1) creation of timetables; (2) scheduling vehicles to trips; and (3) assignment of drivers. These three components are described, but with a focus on the first component because of its importance from the user's perspective. The design of a transit timetable is discussed from both a practical and an analytical viewpoint. A methodology is presented on the construction of alternative computerized public timetables, based on procedures that improve the correspondence of vehicle departure times with passenger demand. The vehicle scheduling procedure is viewed through the minimization of the number of vehicles required to carry out a fixed or variable timetable. Finally, different approaches to the crew assignment component are briefly discussed. The overview and methodologies presented in the paper suggest that most scheduling tasks can be performed automatically or in a conversational man-computer mode. The adoption of new scheduling procedures will undoubtedly increase the efficiency of each of the three components of the transit scheduling system.     

Development of efficient stop planning optimization process for high‐speed rail systems

The Taiwan High Speed Rail (THSR) has recently added three additional stations to its original network. Although the three additional stations can improve accessibility to the system, these new stations can present difficulties in the transportation planning process, particularly for planning of train stops. The additional stations may benefit some passengers, but may also lengthen the travel time for the other passengers. Therefore, the main challenge faced by THSR is finding an efficient way to design appropriate stopping patterns. Past studies on stop planning usually adopted meta‐heuristics or decomposition methods to solve this complex problem. Although these solution techniques can improve solution efficiency, none of them can guarantee the optimality of the solution and capture the transfer movement of different stopping patterns. In this research, we proposed an innovative network structure to address complex stop planning problems for high‐speed rail systems. Given its special network structure, two binary integer programming models were developed to simultaneously form and determine the optimal stopping patterns for real‐world THSR stop planning problems. An optimization process was also developed to accurately estimate the station transfer time corresponding to the variation in stopping patterns and passenger flow. Results of the case studies suggest that the proposed binary integer programming models exhibit superior solution quality and efficiency over existing exact optimization models. Consequently, using this stop planning optimization process can help high‐speed rail system planners in designing optimal stopping patterns that correspond to passenger demand. Copyright © 2017 John Wiley & Sons, Ltd.     

Simulation model performance analysis of a multiple station shared vehicle system

As an alternative transportation paradigm, shared vehicle systems have become increasingly popular in recent years. Shared vehicle systems typically consist of a fleet of vehicles that are used several times each day by different users. One of the main advantages of shared vehicle systems is that they reduce the number of vehicles required to meet total travel demand. An added energy/emissions benefit comes when low-polluting (e.g., electric) vehicles are used in the system. In order to evaluate operational issues such as vehicle availability, vehicle distribution, and energy management, a unique shared vehicle system computer simulation model has been developed. As an initial case study, the model was applied to a resort community in Southern California. The simulation model has a number of input parameters that allow for the evaluation of numerous scenarios. Several measures of effectiveness have been determined and are calculated to characterize the overall system performance. For the case study, it was found that the most effective number of vehicles (in terms of satisfying customer wait time) is in the range of 3–6 vehicles per 100 trips in a 24 h day. On the other hand, if the number of relocations also is to be minimized, there should be approximately 18–24 vehicles per 100 trips. Various inputs to the model were varied to see the overall system response. The model shows that the shared vehicle system is most sensitive to the vehicle-to-trip ratio, the relocation algorithm used, and the charging scheme employed when electric vehicles are used. A preliminary cost analysis was also performed, showing that such a system can be very competitive with present transportation systems (e.g., rental cars, taxies, etc.).     

Connecting e-hailing to mass transit platform: Analysis of relative spatial position

This paper analyzes and compares two different relative spatial position (RSP) designs in an integrated e-hailing/fixed-route transit system: a zone-based design that operates e-hailing vehicles within a zone, and a line-based design that operates e-hailing vehicles along a fixed-route transit line and with a stable headway. To conduct a meaningful comparison, the optimal design problems for both systems are formulated using a same analytical framework based on the continuous approximation approach. A comprehensive numerical experiment is performed to compare various cost components corresponding to the optimal designs, and a discrete-event simulation model is developed to validate the analysis. The analytical and simulation results agree with each other well, with a discrepancy in the total system cost less than 5% in most test scenarios. These results also suggest that the line-based system consistently outperforms the zone-based system in terms of both agency and user costs, for all scenarios tested. Compared to the zone-based design, the line-based design features a sparser fixed-route network (resulting in larger stop spacing) but a higher dispatching frequency. It is concluded that the higher efficiency of the line-based design is likely derived from the strategy of operating e-hailing vehicles with a more regular route/headway structure and allowing ride-sharing.     

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.     

Joint deployment of charging stations and photovoltaic power plants for electric vehicles

The focus of this study is to jointly design charging stations and photovoltaic (PV) power plants with time-dependent charging fee, to improve the management of the coupled transportation and power systems. We first propose an efficient and extended label-setting algorithm to solve the EV joint routing and charging problem that considers recharging amount choices at different stations and loop movement cases. Then, a variational inequality problem is formulated to model the equilibrium of EV traffic on transportation networks, and an optimal power flow model is proposed to model the power network flow with PV power plants and optimally serve the EV charging requirements. Based on the above models for describing system states, we then formulate a model to simultaneously design charging stations, PV plants, and time-dependent charging fee. A surrogate-based optimization (SBO) algorithm is adopted to solve the model. Numerical examples demonstrate that the proposed SBO algorithm performs well. Additionally, important insights concerning the infrastructure design and price management of the coupled transportation and power networks are derived accordingly.     

Locating emergency vehicles with an approximate queuing model and a meta-heuristic solution approach

In this paper, the location of emergency service (ES) vehicles is studied on fully connected networks. Queuing theory is utilized to obtain the performance metrics of the system. An approximate queuing model the (AQM) is proposed. For the AQM, different service rate formulations are constructed. These formulations are tested with a simulation study for different approximation levels. A mathematical model is proposed to minimize the mean response time of ES systems based on AQM. In the model, multiple vehicles are allowed at a single location. The objective function of the model has no closed form expression. A genetic algorithm is constructed to solve the model. With the help of the genetic algorithm, the effect of assigning multiple vehicles on the mean response time is reported.     

Instantaneous multihop connectivity of one-dimensional vehicular ad hoc networks with general distributions of communication nodes

Connected and automated vehicle technologies hold great promises for improving the safety, efficiency, and environmental impacts of the transportation sector. In this study we are concerned with multihop connectivity of instantaneous vehicular one-dimensional ad hoc networks (VANETs) formed by connected vehicles along a communication path in a road network with given either vehicle locations or traffic densities, market penetration rates, and transmission ranges. We first define a new random variable for the location of the end node of a communication chain, which is a discrete random variable with given vehicle locations and a mixed random variable with given traffic densities. Then recursive, iterative, or differential equation models of instantaneous multihop connectivity between two communication nodes are derived from the relationships between end node probability mass or density function and connectivity. Assuming a simple communication model, the new models are applicable for general distribution patterns of vehicles and communication nodes, including non-evenly placed vehicles and nonhomogeneous Poisson distributions of nodes. With given vehicle locations, the computational cost for this new model is linear to the number of vehicles; with given traffic densities, we derive a new closed-form connectivity model for homogeneous Poisson distributions of communication nodes and an approximate closed-form model when distribution patterns of communication nodes are given by spatial renewal processes. We then apply the models to evaluate impacts on connectivity of traffic patterns, including shock waves, and road-side stations. The connectivity model could be helpful for designing routing protocols in VANETs and developing their applications in transportation systems.