A Planning Approach for the Network Configuration of AC-DC Hybrid Distribution Systems
Bibliographic record
Abstract
This paper proposes a novel stochastic planning model for AC-DC hybrid distribution systems (DSs). Taking into account the possibility of each line/bus being AC or DC, the model finds the optimal AC-DC hybrid configuration of buses and lines in the DS. It incorporates consideration of the stochastic behavior of load demands and renewable-based distributed generators (DGs). The stochastic variations are addressed using a Monte-Carlo simulation technique. The objective of the planning model is the minimization of DS installation and operation costs. The optimal planning solution is obtained by dividing the hybrid planning problem into two nested optimization problems: 1) the main problem is formulated using a genetic algorithm (GA) to search for the optimal AC-DC configuration and 2) the subproblem is used for determining the optimal power flow solution for each configuration generated by the GA. The proposed model has been employed for finding the optimal configuration for a suggested case study that included photovoltaic panels, wind-based DG, and electric vehicle charging stations. The same case study was also solved using a traditional AC planning technique in order to evaluate the effectiveness of the proposed model and the associated cost-savings. The results demonstrate the advantages offered by the proposed model. The proposed framework represents an effective technique that can be used by DS operators to identify the optimal AC-DC network configuration of future DSs.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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 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".