Public vehicle (PV) systems are promising transportation systems for future smart cities which provide dynamic ride-sharing services according to passengers' requests. PVs are driverless self-driving electric vehicles which require frequent recharging from smart grids. For such systems, the challenge lies in both the efficient scheduling scheme to satisfy transportation demands with service guarantee and the cost-effective charging strategy under the real-time electricity pricing. In this paper, we study the joint transportation and charging scheduling for PV systems to balance the transportation and charging demands, ensuring the long-term operation. We adopt a cake cutting game model to capture the interactions among PV groups, the cloud and smart grids. The cloud announces strategies to coordinate the allocation of transportation and energy resources among PV groups. All the PV groups try to maximize their joint transportation and charging utilities. We propose an algorithm to obtain the unique normalized Nash equilibrium point for this problem. Simulations are performed to confirm the effects of our scheme under the real taxi and power grid data sets of New York City. Our results show that our scheme achieves almost the same transportation performance compared with a heuristic scheme, namely, transportation with greedy charging; however, the average energy price of the proposed scheme is 10.86 lower than the latter one.
Several novel pricing mechanisms and scheduling strategies have been proposed in on-demand mobility systems. Drwal al @cite_41 propose pricing mechanisms to balance the demands of different parking stations, reduce the cost of manual relocations of vehicles, and maximize the operator's revenue. However, this solution only considers the transportation performance, and does not consider the energy demands of vehicles from smart grids. Rigas al @cite_6 study the scenario where EVs are hired in on-demand mobility systems and there exist multiple battery swap facility points. Its aim is to maximize the number of passengers that are served. They focus on the transportation performance with limited travel ranges and simplify the charging problem as swapping batteries in facility points, ignoring the effects of the real-time pricing of smart grids, e.g., how to reduce the charging costs with the guarantee of providing transportation services. Our solution proposed in this paper considers the joint transportation and charging strategies of vehicles over one day and multiple days under the scenario of real-time electricity pricing.
@cite_41 @cite_6
2138114791 2346452219 2051431619 2061926759
In this paper, we consider delay-optimal charging scheduling of the electric vehicles (EVs) at a charging station with multiple charge points. The charging station is equipped with renewable energy generation devices and can also buy energy from power grids. The uncertainty of the arrival of the EV, the intermittence of the renewable energy, and the variation of the grid power price are taken into account and described as independent Markov processes. Meanwhile, the required charging energy for each EV is random. The goal is to minimize the mean waiting time for EVs under the long-term constraint on the cost. We propose queue mapping to convert the EV queue to the charging demand queue, and we prove the equivalence between the minimization of the two queues' average length. Then, we focus on the minimization for the average length of the charging demand queue under the long-term cost constraint. We propose a framework of Markov decision process (MDP) to investigate this constrained stochastic optimization problem. The system state includes the charging demand queue length, the charging demand arrival, the energy level in the storage battery of the renewable energy, the renewable energy arrival, and the grid power price. Additionally, the number of charging demands and the allocated energy from the storage battery compose the 2-D policy. We derive two necessary conditions of the optimal policy. Moreover, we discuss the reduction of the 2-D policy to be the number of charging demands only. We give the sets of system states for which charging no demand and charging as many demands as possible are optimal, respectively. Finally, we investigate the proposed policies numerically. This paper proposes a novel cooperative charging strategy for a smart charging station in the dynamic electricity pricing environment, which helps electric vehicles (EVs) to economically accomplish the charging task by the given deadlines. This strategy allows EVs to share their battery-stored energy with each other under the coordination of an aggregator, so that more flexibility is given to the aggregator for better scheduling. Mathematically, the scheduling problem is formulated as a constrained mixed-integer linear program (MILP) to capture the discrete nature of the battery states, i.e., charging, idle and discharging. Then, an efficient algorithm is proposed to solve the MILP by means of dual decomposition and Benders decomposition. At last, the algorithm can be implemented in a distributed fashion, which makes it scalable and thus suitable for large-scale scheduling problems. Numerical results validate our theoretical analysis. The vehicle electrification will have a significant impact on the power grid due to the increase in electricity consumption. It is important to perform intelligent scheduling for charging and discharging of electric vehicles (EVs). However, there are two major challenges in the scheduling problem. First, it is challenging to find the globally optimal scheduling solution which can minimize the total cost. Second, it is difficult to find a distributed scheduling scheme which can handle a large population and the random arrivals of the EVs. In this paper, we propose a globally optimal scheduling scheme and a locally optimal scheduling scheme for EV charging and discharging. We first formulate a global scheduling optimization problem, in which the charging powers are optimized to minimize the total cost of all EVs which perform charging and discharging during the day. The globally optimal solution provides the globally minimal total cost. However, the globally optimal scheduling scheme is impractical since it requires the information on the future base loads and the arrival times and the charging periods of the EVs that will arrive in the future time of the day. To develop a practical scheduling scheme, we then formulate a local scheduling optimization problem, which aims to minimize the total cost of the EVs in the current ongoing EV set in the local group. The locally optimal scheduling scheme is not only scalable to a large EV population but also resilient to the dynamic EV arrivals. Through simulations, we demonstrate that the locally optimal scheduling scheme can achieve a close performance compared to the globally optimal scheduling scheme. A large penetration of electric and plug-in hybrid electric vehicles would likely result in increased system peaks and overloading of power system assets if the charging of vehicles is left uncontrolled. In this paper we propose both a centralized and a decentralized smart-charging scheme which seek to minimize system-wide generation costs while respecting grid constraints. Under the centralized scheme, vehicles' batteries are aggregated to virtual storage resources at each network node, which are optimally dispatched with a multiperiod Optimal Power Flow. On the other hand, under the decentralized scheme, price profiles broadcasted to vehicles day-ahead are determined so that the optimal response of individual vehicles to this tariff achieves the goal of cost minimization. Two alternative tariffs are explored, one where the same price profile applies system-wide, and another where different prices can be defined at different nodes. Results show that compared with uncontrolled charging, these smart-charging schemes successfully avoid asset overloading, displace most charging to valley hours and reduce generation costs. Moreover they are robust in the face of forecast errors in vehicle behavior.