Coordinated Optimization of Solar and Wind Energy Storage in Industrial Parks Based on Linear Programming and Mixed Integer Programming Models

This paper addresses the optimization of operations within independent industrial parks and the determination of the optimal energy storage allocation for combined parks. Initially, a linear programming model is established to address the operational issues of the three parks when energy storage is not allocated. Subsequently, 50 kW/100 kWh energy storage systems are individually allocated to each park, and the resulting purchased electricity, discarded wind and solar energy, total electricity supply cost, and average unit electricity supply cost are calculated. Finally, a mixed integer programming model is employed to determine the optimal operational strategies and electricity purchasing plans for the individual energy storage allocations for each park. Furthermore, in the scenario of combined park operations, assuming the formation of a unified park comprising three parks, the economic operations without energy storage allocation are analyzed. Subsequently, the optimal energy storage allocation for the combined park is determined, resulting in a purchased electricity quantity of 7149.7196 kWh, a total electricity supply cost of 14661.5105 yuan, and an average unit electricity supply cost of 0.6269 yuan/kWh. The battery power upper limit is found to be 774 kW, and the battery capacity is 1469.1453 kWh.

Authors

Institutions

Publication Details

Published
2025-03-26
DOI
https://doi.org/10.1109/edpee65754.2025.00046
Primary Topic
Power Systems and Renewable Energy
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Coordinated Optimization of Solar and Wind Energy Storage in Industrial Parks Based on Linear Programming and Mixed Integer Programming Models

Yiming Zeng
Power Systems and Renewable Energy
article

Coordinated Optimization of Solar and Wind Energy Storage in Industrial Parks Based on Linear Programming and Mixed Integer Programming Models

Yiming Zeng
article en

Abstract

This paper addresses the optimization of operations within independent industrial parks and the determination of the optimal energy storage allocation for combined parks. Initially, a linear programming model is established to address the operational issues of the three parks when energy storage is not allocated. Subsequently, 50 kW/100 kWh energy storage systems are individually allocated to each park, and the resulting purchased electricity, discarded wind and solar energy, total electricity supply cost, and average unit electricity supply cost are calculated. Finally, a mixed integer programming model is employed to determine the optimal operational strategies and electricity purchasing plans for the individual energy storage allocations for each park. Furthermore, in the scenario of combined park operations, assuming the formation of a unified park comprising three parks, the economic operations without energy storage allocation are analyzed. Subsequently, the optimal energy storage allocation for the combined park is determined, resulting in a purchased electricity quantity of 7149.7196 kWh, a total electricity supply cost of 14661.5105 yuan, and an average unit electricity supply cost of 0.6269 yuan/kWh. The battery power upper limit is found to be 774 kW, and the battery capacity is 1469.1453 kWh.

Chongqing Technology and Business University (CN), Chongqing University of Education (CN)
Affordable and clean energy
Openalex Percentile: Top 83%
Power Systems and Renewable Energy
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.