A greedy method for optimizing the self-adequacy of microgrids presented as partitioning of graphs with supply and demand

In this paper we focus on solving the problem of maximal partitioning of graphs with supply and demand. The interest for this problem is due to the fact that it well represents the optimization of self-adequacy of interconnected microgrids. The chosen method is a heuristic based greedy algorithm which can be applied to very large problem instances in feasible time, which best relates to potential real life applications. To decrease the computational time of the algorithm, suitable auxiliary structures are introduced. To get the best performance, in the sense of finding high quality solutions, we have analyzed the behavior of the algorithm for three different heuristics. In the conducted experiments it has been show that the proposed method is very efficient in the case of small problem instances, for which it frequently manages to find optimal solutions. The performed test have demonstrated that the proposed method generally acquires solutions within 5-10% of the known optimal one.