Optimal Placement of Multiple Sources in a Mesh-Type DC Microgrid Using Dijkstra’s Algorithm
Bibliographic record
Abstract
This research paper introduces an optimization methodology for the strategic electric sources’ placement at multiple positions in a DC islanded microgrid characterized by a mesh network, aiming to minimize line losses while considering minimal cable weight. The DC microgrid studied in this paper is composed of PV panels, batteries, a diesel generator, and 20 residential loads. Employing Dijkstra’s algorithm, a graph algorithm used in Google Maps, the study identifies the shortest path (resistance) between potential source nodes and various variable loads within a predefined electric distribution mesh network topology. This study focuses on active power considerations and offers valuable insights into the placement optimization of multiple sources’ positions in DC microgrid mesh networks. A key contribution of this paper lies in the ranking of source node positions based on minimal to maximal line losses, taking into consideration optimal cable weights, while using MATPOWER to validate sources’ ranking based on Dijkstra’s hypothesis. The research further includes a techno-economic study to assess the viability of sources’ placement at multiple positions within the mesh network, comparing it with the optimal placement scenario involving a single position for all sources. This methodology serves as a valuable resource for system designers and operators aiming to minimize line losses and optimize energy distribution in DC microgrids in a mesh topology.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 teacher head, 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".