Multi-objective Optimization Approach for Optimal Distributed Generation Sizing and Placement
Bibliographic record
Abstract
—This article describes a multi-objective optimization method to solve the optimal distributed generation sizing and placement. The optimization problem considers two objectives: minimizing the total real power losses of the network and minimizing the overall distributed generation installation cost. The objectives are combined into a scalar objective optimization problem by using weighted sum method. Both objective functions and equality and inequality constraints are formulated as a non-linear program and solved by a sequential quadratic programming deterministic technique. The multi-objective optimization method gives several answers instead of a single (unique) one. These answers are optimal, and the designer (decision maker) can select the proper solution according to subjective preferences. These optimum results are known as the Pareto front. A fuzzy decision-making procedure for order preference is used for finding the best compromise solution from the set of Pareto solutions. The proposed method is tested using a 15-bus radial distribution system to show its applicability. A comparative study is performed to evaluate two cases—a single distributed generation unit installation and a multiple distributed generation installation—ending by a comparative study of the two cases.
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.002 | 0.001 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 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.001 |
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".