Author
Listed:
- Jiabin Xue
(Faculty of Artificial Intelligence, Shanghai University of Electric Power, Shanghai 200090, China)
- Pengyuan Zheng
(Faculty of Artificial Intelligence, Shanghai University of Electric Power, Shanghai 200090, China)
- Chen Wei
(Faculty of Artificial Intelligence, Shanghai University of Electric Power, Shanghai 200090, China)
- Guanglin Song
(Faculty of Artificial Intelligence, Shanghai University of Electric Power, Shanghai 200090, China)
Abstract
For microgrids with uncertainties in renewable energy generation and normal load demand, a robust multi-objective and multi-scenario performance optimization algorithm based on lexicographic order is proposed, which considers system economic cost, environmental cost, and user comfort as the objective functions. At first, historical data are processed using K-means clustering to extract typical scenario sequences. In the day-ahead scheduling stage, a lexicographic order method is applied to sequentially optimize the three objectives: economic cost, environmental cost, and user comfort. For each objective, robust optimization is performed by adopting the probability-weighted sum of the cost functions as the objective function. It obtains the optimal solution that ensures superior performance for typical scenarios. Subsequently, a robustness test is conducted under constraints that guarantee normal equipment operation and power balance for all scenarios. In the intraday scheduling stage, measured data of renewable energy and normal load are employed, and deviations in conventional power generation and grid interaction are penalized based on the day-ahead scheduling results. This adjustment improves the economic efficiency of the microgrid operation.
Suggested Citation
Jiabin Xue & Pengyuan Zheng & Chen Wei & Guanglin Song, 2026.
"Robust Optimization Algorithm of Multi-Objective and Multi-Scenario Performance for Uncertain Microgrids Based on Lexicographic Order Method,"
Sustainability, MDPI, vol. 18(2), pages 1-20, January.
Handle:
RePEc:gam:jsusta:v:18:y:2026:i:2:p:1100-:d:1845743
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:18:y:2026:i:2:p:1100-:d:1845743. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.