Automated Heuristic Design for Unit Commitment Using Large Language Models

Junjin Lv, Chenggang Cui, Shaodi Zhang, Hui Chen, Chunyang Gong +1 more
6/14/2025
cs.AIeess.SY

No confident code implementation found for this paper. 4 possible matches can be shown below.

Abstract

The Unit Commitment (UC) problem is a classic challenge in the optimal scheduling of power systems. Years of research and practice have shown that formulating reasonable unit commitment plans can significantly improve the economic efficiency of power systems' operations. In recent years, with the introduction of technologies such as machine learning and the Lagrangian relaxation method, the solution methods for the UC problem have become increasingly diversified, but still face challenges in terms of accuracy and robustness. This paper proposes a Function Space Search (FunSearch) method based on large language models. This method combines pre-trained large language models and evaluators to creatively generate solutions through the program search and evolution process while ensuring their rationality. In simulation experiments, a case of unit commitment with \(10\) units is used mainly. Compared to the genetic algorithm, the results show that FunSearch performs better in terms of sampling time, evaluation time, and total operating cost of the system, demonstrating its great potential as an effective tool for solving the UC problem.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 4 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{lv2025automated,
  title  = {Automated Heuristic Design for Unit Commitment Using Large Language Models},
  author = {Junjin Lv and Chenggang Cui and Shaodi Zhang and Hui Chen and Chunyang Gong and Jiaming Liu},
  year   = {2025},
  eprint = {2506.12495},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.12495v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.12495.svg)](https://codeofpaper.com/paper/2506.12495)

Discussion