The duck curve is becoming a global problem in energy technology due to the rapid increase in solar power adoption and the rise of prosumers. To address this issue, a resource aggregator (RA) has emerged to provide flexible solutions through aggregating the prosumers and demand response such as dynamic pricing. This paper proposes an optimal strategy for the RA that dispatches dynamic pricing to the prosumers and leverages the battery system at both RA and prosumer levels. The proposed method is based on a model-free deep reinforcement learning (DRL) algorithm to optimize each prosumer’s retail prices and schedule usage of the RA’s battery power station. An objective reward function is used to maximize the RA’s profit, minimize the prosumer’s cost, and maximize the improvement of the duck curve. The performance of the proposed DRL-based strategy was demonstrated by simulation experiments using actual wholesale price, demand, and PV generation data. The results show that the proposed strategy can improve the standard deviation and peak-to-average ratio of net load by up to 57.1% and 23%, respectively.

Delivery drones have been attracting attention as one of the promising technologies to deliver packages. Several research studies on routing problems specifically for drone delivery scenarios have extended Vehicle Routing Problems (VRPs). Most existing VRPs are based on Traveling Salesman Problems (TSPs) for minimizing the overall distance. On the other hand, VRPs for drone delivery have been aware of energy consumption due to the consideration of battery capacity. Despite hovering motions with loading packages accounting for a large portion of energy consumption since delivery drones need to hover with several packages, little research has been conducted on drone routing problems that aim at the minimization of overall flight times. In addition, flight time is strongly influenced by windy conditions such as headwinds and tailwinds. In this paper, we propose a VRP for drone delivery in which flight time is dependent on the weight of packages in a windy environment, called Flight Speed-aware Vehicle Routing Problem with Load and Wind (FSVRPLW). In this paper, flight speed changes depending on the load and wind. Specifically, a heavier package slows down flight speeds and a lighter package speeds up flight speeds. In addition, a headwind slows down flight speeds and a tailwind speed up flight speeds. We mathematically derived the problem and developed a dynamic programming algorithm to solve the problem. In the experiments, we investigate how much impact both the weight of packages and the wind have on the flight time. The experimental results indicate that taking loads and wind into account is very effective in reducing flight times. Moreover, the results of comparing the effects of load and wind indicate that flight time largely depends on the weight of packages.