An Incentive-Based Multistage Expansion Planning Model for Smart Distribution Systems
Bibliographic record
Abstract
The deployment of smart grids has facilitated the integration of a variety of investor assets into power distribution systems, giving rise to the consequent necessity for positive and active interaction between those investors and local distribution companies (LDCs). This paper proposes a novel incentive-based distribution system expansion planning model that enables an LDC and distributed generation (DG) investors to work in a collaborative way for their mutual benefit. Using the proposed model, the LDC would establish a bus-wise incentive program based on long-term contracts, which would encourage DG investors to integrate their projects at specific system buses that would benefit both parties. The model guarantees that the LDC will incur minimum expansion and operation costs while concurrently ensuring the feasibility of DG investors' projects. To derive appropriate incentives for each project, the model enforces several economic metrics including internal rate of return, profit investment ratio, and discounted payback period. All investment plans committed to by the LDC and the DG investors for the full extent of the planning period are then coordinated accordingly. Several linearization approaches are applied to convert the proposed model into an MILP model. The intermittent nature of both system demand and wind- and PV-based DG output power is handled probabilistically, and a number of DG technologies are taken into account. Case study results have demonstrated the value of the proposed model.
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.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.008 | 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".