A genetic algorithm for finding microgrid cable layouts

1Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Microgrids play a crucial role in the electrification of rural areas. Designing a microgrid comprises of multiple parts including finding suitable sites for generation units, sizing the components of the microdgrid, and determining the layout of the cables to connect the components. In this work we focus on the latter part, which we formalize as the Microgrid Cable Layout problem. In this problem we assume that the locations and sizes of the generators and consumers are already given. The goal is to find a cost-minimal cable layout that connects these locations and that is sufficient to handle the consumer demands. The cables may be of different cable types, and we may connect multiple cables not only at the locations of the generators and consumers but also at any other point. Microgrid Cable Layout is a strongly NP-hard, non-linear optimization problem. We present a hybrid algorithm for the Microgrid Cable Layout problem, which employs a genetic algorithm for optimizing the topology of the layout and a heuristic for assigning the cables to the edges of the topology. An evaluation on a set of benchmark instances indicates that this algorithm is able to find good solutions within a short amount of time. We further evaluate the performance of the algorithm in a case study on a real-world microgrid in the Democratic Republic of the Congo.

Cite

CITATION STYLE

APA

Göttlicher, M., & Wolf, M. (2022). A genetic algorithm for finding microgrid cable layouts. In e-Energy 2022 - Proceedings of the 2022 13th ACM International Conference on Future Energy Systems (pp. 1–16). Association for Computing Machinery, Inc. https://doi.org/10.1145/3538637.3538835

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free