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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of 2014 International Renewable and Sustainable Energy Conference, IRSEC 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages565-570
Number of pages6
ISBN (Print)9781479973361
DOIs
Publication statusPublished - 12 Mar 2014
Event2014 2nd International Renewable and Sustainable Energy Conference, IRSEC 2014 - Ouarzazate, Morocco
Duration: 17 Oct 201419 Oct 2014

Other

Other2014 2nd International Renewable and Sustainable Energy Conference, IRSEC 2014
CountryMorocco
CityOuarzazate
Period17/10/1419/10/14

Fingerprint

Experiments

Keywords

  • Graph Partitioning
  • Greedy Algorithm
  • Microgrid

ASJC Scopus subject areas

  • Renewable Energy, Sustainability and the Environment

Cite this

Jovanovic, R., & Bousselham, A. (2014). A greedy method for optimizing the self-adequacy of microgrids presented as partitioning of graphs with supply and demand. In Proceedings of 2014 International Renewable and Sustainable Energy Conference, IRSEC 2014 (pp. 565-570). [7059835] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IRSEC.2014.7059835

A greedy method for optimizing the self-adequacy of microgrids presented as partitioning of graphs with supply and demand. / Jovanovic, Raka; Bousselham, Abdelkader.

Proceedings of 2014 International Renewable and Sustainable Energy Conference, IRSEC 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 565-570 7059835.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jovanovic, R & Bousselham, A 2014, A greedy method for optimizing the self-adequacy of microgrids presented as partitioning of graphs with supply and demand. in Proceedings of 2014 International Renewable and Sustainable Energy Conference, IRSEC 2014., 7059835, Institute of Electrical and Electronics Engineers Inc., pp. 565-570, 2014 2nd International Renewable and Sustainable Energy Conference, IRSEC 2014, Ouarzazate, Morocco, 17/10/14. https://doi.org/10.1109/IRSEC.2014.7059835
Jovanovic R, Bousselham A. A greedy method for optimizing the self-adequacy of microgrids presented as partitioning of graphs with supply and demand. In Proceedings of 2014 International Renewable and Sustainable Energy Conference, IRSEC 2014. Institute of Electrical and Electronics Engineers Inc. 2014. p. 565-570. 7059835 https://doi.org/10.1109/IRSEC.2014.7059835
Jovanovic, Raka ; Bousselham, Abdelkader. / A greedy method for optimizing the self-adequacy of microgrids presented as partitioning of graphs with supply and demand. Proceedings of 2014 International Renewable and Sustainable Energy Conference, IRSEC 2014. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 565-570
@inproceedings{27c2b0e172014d959715c2449219c8db,
title = "A greedy method for optimizing the self-adequacy of microgrids presented as partitioning of graphs with supply and demand",
abstract = "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.",
keywords = "Graph Partitioning, Greedy Algorithm, Microgrid",
author = "Raka Jovanovic and Abdelkader Bousselham",
year = "2014",
month = "3",
day = "12",
doi = "10.1109/IRSEC.2014.7059835",
language = "English",
isbn = "9781479973361",
pages = "565--570",
booktitle = "Proceedings of 2014 International Renewable and Sustainable Energy Conference, IRSEC 2014",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

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

AU - Jovanovic, Raka

AU - Bousselham, Abdelkader

PY - 2014/3/12

Y1 - 2014/3/12

N2 - 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.

AB - 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.

KW - Graph Partitioning

KW - Greedy Algorithm

KW - Microgrid

UR - http://www.scopus.com/inward/record.url?scp=84946686494&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84946686494&partnerID=8YFLogxK

U2 - 10.1109/IRSEC.2014.7059835

DO - 10.1109/IRSEC.2014.7059835

M3 - Conference contribution

AN - SCOPUS:84946686494

SN - 9781479973361

SP - 565

EP - 570

BT - Proceedings of 2014 International Renewable and Sustainable Energy Conference, IRSEC 2014

PB - Institute of Electrical and Electronics Engineers Inc.

ER -