Stochastic Load Modeling and Chance-Constrained Optimization of DG Placement and Sizing with Emission Incentives

This study proposes an optimization model for determining the placement and sizing of photovoltaic distributed generation (PV-DG) units in electrical distribution systems, accounting for load uncertainty and PV output variability. The model is formulated as a Mixed Integer Linear Programming (MILP) problem that incorporates stochastic load modeling based on normal distribution, and applies a chance-constrained programming approach to ensure supply reliability with a specified confidence level. Additionally, a clean energy-based incentive scheme is integrated into the objective function to enhance the economic feasibility of PV investments. Simulation results under various stochastic scenarios demonstrate that the system can reliably meet all load demands without supply deficits. PV contributions are particularly significant during daytime hours, leading to a noticeable reduction in overall system costs and carbon emissions. The proposed approach is proven effective in delivering adaptive, economical, and reliable solutions under distribution system uncertainty, while also highlighting the role of output-based incentives as a policy tool to accelerate the transition toward clean energy.

Authors

Institutions

Publication Details

Journal
Jurnal EECCIS (Electrics Electronics Communications Controls Informatics Systems)
Published
2025-08-30
DOI
https://doi.org/10.21776/jeeccis.v19i2.1788
Primary Topic
Advanced Aircraft Design and Technologies
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Stochastic Load Modeling and Chance-Constrained Optimization of DG Placement and Sizing with Emission Incentives

Syafaruddin Syafaruddin, Sri Mawar Said, Ian Adrian Bustanuddin
Jurnal EECCIS (Electrics Electronics Communications Controls Informatics Systems)
Advanced Aircraft Design and Technologies
article

Stochastic Load Modeling and Chance-Constrained Optimization of DG Placement and Sizing with Emission Incentives

Syafaruddin Syafaruddin, Sri Mawar Said, Ian Adrian Bustanuddin
article en

Abstract

This study proposes an optimization model for determining the placement and sizing of photovoltaic distributed generation (PV-DG) units in electrical distribution systems, accounting for load uncertainty and PV output variability. The model is formulated as a Mixed Integer Linear Programming (MILP) problem that incorporates stochastic load modeling based on normal distribution, and applies a chance-constrained programming approach to ensure supply reliability with a specified confidence level. Additionally, a clean energy-based incentive scheme is integrated into the objective function to enhance the economic feasibility of PV investments. Simulation results under various stochastic scenarios demonstrate that the system can reliably meet all load demands without supply deficits. PV contributions are particularly significant during daytime hours, leading to a noticeable reduction in overall system costs and carbon emissions. The proposed approach is proven effective in delivering adaptive, economical, and reliable solutions under distribution system uncertainty, while also highlighting the role of output-based incentives as a policy tool to accelerate the transition toward clean energy.

Jurnal EECCIS (Electrics Electronics Communications Controls Informatics Systems)Vol. 19(2)
Hasanuddin University (ID)
Universitas Hasanuddin
Openalex Percentile: Top 73%
Advanced Aircraft Design and Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.