Renewable energy optimization in isolated microgrids: a Python-based tool for cost-effective solutions using genetic algorithms
Bibliographic record
Abstract
This work presents a Python-based tool for the techno-economic analysis of renewable energy integration in isolated microgrids. The tool combines a microgrid simulator and an optimizer based on genetic algorithms. The simulator incorporates an energy management strategy that prioritizes the use of renewable energy sources and battery storage while ensuring a continuous power supply through diesel generators. This is achieved with a dispatch strategy that determines the optimal combination of a predefined number of generators based on the specific needs of the microgrid. The optimizer, which operates as a top layer to the simulator, uses the simulator’s outputs in an iterative optimization process with single or multiple objectives. In the presented case study, the optimizer aims to identify the optimal renewable energy penetration level that minimizes the levelized cost of energy and maximizes diesel displacement. To speed up convergence, the optimization process includes the development of preliminary tables generated using a brute-force algorithm, which reduces the initial search space. The tool’s advantages lie in its modular design, its ability to process input data with different time steps, and its fast convergence in case studies. Developed in Python, an open-access software, it overcomes the limitations of commercial tools like HOMER, which impose restrictions on users. Additionally, the tool is scalable and adaptable to specific user needs. Finally, the practical application of the tool is validated through a case study applied to a microgrid in a community in Nunavik, Quebec. The results show that the optimal renewable energy penetration identified by the tool can reduce diesel consumption by up to 87% compared to scenarios without renewable integration. This highlights the tool’s value in industrial and commercial contexts requiring practical and applicable solutions.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.029 | 0.008 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".