OptDisPro: LLM-Based Multi-Agent Framework for Flexibly Adapting Heuristic Optimal DisFlow

The existing generative coding of distribution grids modeling and optimization face several issues, like complicated usage or high auto-codes error rates. This paper proposes the OptDisPro, a novel LLM-based multi-agent framework, enabling automatic optimal power flow (OPF) script modeling and solving. Driven by interactive linguistic instruction, it realizes automatic coding for customized requirements and flexibly adaptive heuristic optimization. Specifically, domain expertise and example scripts are encoded into structured prompt sequences to guide OptDisPro and enhance reasoning via Chain-of-Thought (COT). To mitigate LLM hallucinations, a contextual feedback mechanism is introduced, which collects error messages from the run-time environment for self-correction. Furthermore, Adaptive Selection of Multiple Algorithms (ASMA) is applied in the solving process, flexibly selecting heuristic algorithms to decrease the possibility of local optima. According to cases verification in multiple scenarios, the simulation results demonstrate the effectiveness and stability of OptDisPro in OPF problem of distribution network. The results also encourage further exploration of LLM applications in script online self-updating, autonomous OPF problem-solving and intelligent operation within distribution grid.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Smart Grid
Published
2025-10-13
DOI
https://doi.org/10.1109/tsg.2025.3620496
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

OptDisPro: LLM-Based Multi-Agent Framework for Flexibly Adapting Heuristic Optimal DisFlow

Yue Xiang, Hongguang Yang, Youbo Liu, Zhengbo Li et al.
IEEE Transactions on Smart Grid
Scheduling and Optimization Algorithms
article

OptDisPro: LLM-Based Multi-Agent Framework for Flexibly Adapting Heuristic Optimal DisFlow

Yue Xiang, Hongguang Yang, Youbo Liu, Zhengbo Li, Jingyao Liu, Junyong Liu, Hongjun Gao
article en

Abstract

The existing generative coding of distribution grids modeling and optimization face several issues, like complicated usage or high auto-codes error rates. This paper proposes the OptDisPro, a novel LLM-based multi-agent framework, enabling automatic optimal power flow (OPF) script modeling and solving. Driven by interactive linguistic instruction, it realizes automatic coding for customized requirements and flexibly adaptive heuristic optimization. Specifically, domain expertise and example scripts are encoded into structured prompt sequences to guide OptDisPro and enhance reasoning via Chain-of-Thought (COT). To mitigate LLM hallucinations, a contextual feedback mechanism is introduced, which collects error messages from the run-time environment for self-correction. Furthermore, Adaptive Selection of Multiple Algorithms (ASMA) is applied in the solving process, flexibly selecting heuristic algorithms to decrease the possibility of local optima. According to cases verification in multiple scenarios, the simulation results demonstrate the effectiveness and stability of OptDisPro in OPF problem of distribution network. The results also encourage further exploration of LLM applications in script online self-updating, autonomous OPF problem-solving and intelligent operation within distribution grid.

IEEE Transactions on Smart GridVol. 17(1)
Sichuan University (CN), Chengdu University (CN)
Openalex Percentile: Top 59%
Scheduling and Optimization Algorithms
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.