Background: Energy communities and local electricity markets (e.g., as peer-to-peer trading) are on the rise due to increasingly decentralized electricity generation and favorable adjustment of the legal framework in many European countries.  Methods: This work applies a bi-level optimization model for dynamic participation in peer-to-peer electricity trading to determine the optimal parameters of new participants who want to join an energy community, based on the preferences of the members of the original community (e.g., environmental, economic, or mixed preference). The upper-level problem chooses optimal parameters by minimizing an objective function that includes the prosumers' cost-saving and emission-saving preferences, while the lower level problem maximizes community welfare by optimally allocating locally generated photovoltaic (PV) electricity between members according to their willingness-to-pay. The bi-level problem is solved by transforming the lower level problem by its corresponding Karush-Kuhn-Tucker (KKT) conditions. Results: The results demonstrate that environment-oriented prosumers opt for a new prosumer with high PV capacities installed and low electricity demand, whereas profit-oriented prosumers prefer a new member with high demand but no PV system capacity, presenting a new source of income. Sensitivity analyses indicate that new prosumers' willingness-to-pay has an important influence when the community must decide between two new members. Conclusions: The added value of this work is that the proposed method can be seen as a basis for a selection process between a large number of potential new community members. Most important future work will include optimization of energy communities over the horizon several years.

No abstract

No abstract

In contrast to conventional routing systems, which determine the shortest distance or the fastest path to a destination, this work designs a route planning specifically for electric vehicles by finding an energy-optimal solution while simultaneously considering stress on the battery. After finding a physical model of the energy consumption of the electric vehicle including heating, air conditioning, and other additional loads, the street network is modeled as a network with nodes and weighted edges in order to apply a shortest path algorithm that finds the route with the smallest edge costs. A variation of the Bellman-Ford algorithm, the Yen algorithm, is modified such that battery constraints can be included. Thus, the modified Yen algorithm helps solving a multi-objective optimization problem with three optimization variables representing the energy consumption with (vehicle reaching the destination with the highest state of charge possible), the journey time, and the cyclic lifetime of the battery (minimizing the number of charging/discharging cycles by minimizing the amount of energy consumed or regenerated). For the optimization problem, weights are assigned to each variable in order to put emphasis on one or the other. The route planning system is tested for a suburban area in Austria and for the city of San Francisco, CA. Topography has a strong influence on energy consumption and battery operation and therefore the choice of route. The algorithm finds different results considering different preferences, putting weights on the decision variable of the multi-objective optimization. Also, the tests are conducted for different outside temperatures and weather conditions, as well as for different vehicle types.

No abstract

No abstract

No abstract

No abstract