Generation and Transmission Maintenance Scheduling using Lagrangian Relaxation in AMPL

AMPL Code, by Xingpeng Li, Mar 22, 2023.

LR G-T MSUC

This set of codes implements Lagrangian Relaxation to solve the coordinated Generation and Transmission Maintenance Scheduling problem. The timeframe is 1 week. It is a complex optimization model that extends a normal security-constrained unit commitment (SCUC) formulation.

Test systems:

  • The test cases used here include (i) a modified IEEE RTS-96 reliability test system (73-bus) and (ii) one out of the three area system (24-bus). The reference is: “The IEEE Reliability Test System-1996. A report prepared by the Reliability Test System Task Force of the Application of Probability Methods Subcommittee” and link is here.

Citation:

If you use any of our codes for your work, please cite the following as a reference:

  • Xingpeng Li, “Generation and Transmission Maintenance Scheduling using Lagrangian Relaxation in AMPL”, Mar. 2023, [Online]. Available at: https://rpglab.github.io/resources/LR-MS-UC-AMPL/

Contact:

Dr. Xingpeng Li

University of Houston

Email: xli83@central.uh.edu

Website: https://rpglab.github.io/

License:

This work is licensed under the terms of the Creative Commons Attribution 4.0 (CC BY 4.0) license.

Disclaimer:

The author doesn’t make any warranty for the accuracy, completeness, or usefulness of any information disclosed; and the author assumes no liability or responsibility for any errors or omissions for the information (data/code/results etc) disclosed.