2018 Optimization Days

HEC Montréal, Québec, Canada, May 7 — 9, 2018

Schedule Authors My Schedule
Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402

TA7 Advances in solving ACOPF problems

May 8, 2018 10:30 AM – 12:10 PM

Location: Groupe Cholette (35)

Chaired by Manuel Ruiz

3 Presentations

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10:30 AM - 10:55 AM

    New conic relaxation for optimal reactive power dispatch

    • Christian Bingane, presenter, Polytechnique Montréal
    • Miguel F. Anjos, GERAD, Polytechnique Montréal
    • Sebastien Le Digabel, Polytechnique Montréal

    The optimal reactive power dispatch (ORPD) problem is an alternating current optimal power flow (ACOPF) problem where discrete control devices for regulating the reactive power, such as shunt devices and load tap changers, are considered. The ORPD problem is modeled as a mixed-integer nonlinear program and its complexity is increased compared to the ACOPF problem, which is highly nonconvex and generally hard to solve. Recently, conic relaxations of the ACOPF problem have attracted a significant interest since they lead to global optimality in many cases. We propose a conic relaxation of the ORPD problem whose accuracy is corroborated by computational results on selected MATPOWER test cases.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10:55 AM - 11:20 AM

    Solving alternative current optimal power flow to global optimality with semi-definite programming and a branch-and-bound algorithm

    • Hadrien Godard, presenter, RTE-CEDRIC-UMA
    • Sourour Elloumi, UMA-CEDRIC
    • Amélie Lambert, Cedric-Cnam
    • Jean Maeght, RTE
    • Manuel Ruiz, RTE

    Alternative Current Optimal Power Flow (ACOPF) is known as a non-convex problem. Solving ACOPF to global optimality remains a challenge when classic convex relaxations are not exact. We use Semi-Definite Programming to reformulate ACOPF and get some convexity properties. We solve the reformulation to global optimality with a branch-and-bound algorithm.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11:20 AM - 11:45 AM

    Application of optimization problems in complex variable with a AC-OPF modeling tool

    • Manuel Ruiz, presenter, RTE
    • Julie Sliwak, RTE

    Thanks to extensive scientific research, newly developed methods are able to provide good solutions for the non-convex AC-OPF problems. Computational results can be easily reproduced on academic datasets and for some kinds of AC-OPF (minimizing losses, with or without thermal limit, unit commitment etc). In order to experiment on these methods in an industrial context, the time spent in implementing an AC-OPF needs to be reduced. The R&D department of RTE will present the key components of an AC-OPF modeler implemented in Julia, which stores the optimization problem with polynomials in complex variables while keeping information on the network structure. At the moment, the tool can build OPF problems from Matpower and the GridOptimizationCompetition input format. State-of-art relaxations (SDP, SOCP, …) or B&B methods can then be applied in a generic a way.

Back