Algorithms for Smart Grid management

In this paper, we will consider a modelization of Smart Grid on three sub-components: local level, microgrid level and T&D level. Thus and on one hand, we will propose an algorithm that manages its local level. Our algorithm is paired with Branch and Bound algorithm to solve knapsack problem. The main goal of this algorithm is to regulate consumption peaks and manage the priority of domestic appliances, by spreading at best the energy depending on the priority and consumption without exceeding the total energy received. Furthermore, we will introduce an asynchronous distributed Max-Flow algorithm to resolve the routing problem in order to optimize the T&D level. This algorithm uses a local computation to compute max-flow. Nodes communicate only by exchanging messages and no global information is needed. Our algorithm uses more than one augmenting path at each iteration allowing optimization of the execution time required for computing the max-flow.