Mixed-integer quadratic constrained programming versus quadratic programming methods for distribution network reconfiguration

Tami, Y.; Sebaa, K.; Lahdeb, M.; Nouri, H.

Abstract

This paper will examine the solution of the minimum loss reconfiguration problem of distribution networks that determine the optimal switches, by means of a mixed-integer quadratically-constrained programming (MIQCP) model The proposed MIQCP model is a convex formulation, which allows to find the optimal solution using optimization solvers. Our mathematical model considers the typical operating constraints of distribution networks (radial configuration, the maximum currents or the voltage plane).The accuracy of the results and the computational performance of the proposed MIQCP model are evaluated by referring to another MIQP (Mixed Integer Quadratic programming) model already adopted for the problem of interest. We used a real distribution system of 106 nodes to show the effectiveness of the proposed model compared to another MIQP model that was tested on the same network. The mathematical model adopted has been solved using the Cplex optimization software implemented under Matlab. The overall optimality of the guaranteed solution is obtained by the convex relaxation of the continuous decision variables.

• Presentation Conference Type: Conference Paper (Published)
• Conference Name: 2019 International Conference on Advanced Electrical Engineering (ICAEE)
• Start Date: Nov 19, 2019
• End Date: Nov 21, 2019
• Acceptance Date: Jul 17, 2019
• Online Publication Date: Mar 2, 2020
• Publication Date: Mar 2, 2020
• Deposit Date: Jan 23, 2020
• Publisher: Institute of Electrical and Electronics Engineers (IEEE)
• ISBN: 9781728122205
• DOI: https://doi.org/10.1109/ICAEE47123.2019.9015181
• Keywords: convex optimization; quadratically constrained convex optimization; mixed-integer quadratic programming; power loss; Radial distribution networks
• Public URL: https://uwe-repository.worktribe.com/output/5208873