I’ll let others respond to your specific questions, as I’m not sure I have any
particularly great ideas there, but I just wanted to mention that the AC OPF
also provides shadow prices on branch flow limits that you could use.
Ray
> On Dec 23, 2024, at 2:59 PM, Wenlei Bai <[email protected]> wrote:
>
> Dear Matpower Community,
> I try to work on a network topology optimization problem where only
> transmission switches are the only binary variables. The objective is to
> conduct short-term (up to 5 hours ahead) network reconfiguration to reduce
> the 'congestion cost' while maintaining the N-1 contingency.
>
> I plan to develop my own algorithm to tackle the problem, using an
> evolutionary algorithm that would allow me to keep the AC power flow
> equations in the optimization. 'Congestion cost' can be quantified using
> shadow price, but my understanding is that shadow price can only be
> calculated by the dual problem of DC OPF, so maybe I can just use the device
> loading to represent the congestion cost in the objective function?
>
> My question is:
> 1. Anyone can share insights on what test system is best for this type of
> problem?
> 2. Any inputs on this problem or how would you start?
>
> Best,
> Wenlei
