Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.11355 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- The Unit Commitment problem with AC power flow constraints (UC-ACOPF) is a non-convex mixed-integer nonlinear programming (MINLP) problem encountered in power systems. Its combination of combinatorial complexity and non-convex nonlinear constraints makes it particularly challenging. A common approach to tackle this issue is to relax the integrality condition, but this often results in infeasible solutions. Consequently, rounding heuristics are frequently employed to restore integer feasibility. This paper addresses recent advancements in heuristics aimed at quickly obtaining feasible solutions for the UC-ACOPF problem, focusing specifically on direct relax-and-round strategies. We propose a model-based heuristic that rescales the solution of the integer-relaxed problem before rounding. Furthermore, we introduce rounding formulas designed to enforce combinatorial constraints and aim to maintain AC feasibility in the resulting solutions. These methodologies are compared against standard direct rounding techniques in the literature, applied to a 6-bus and a 118-bus test systems. Additionally, we integrate the proposed heuristics into an implementation of the Feasibility Pump (FP) method, demonstrating their utility and potential to enhance existing rounding strategies.