Reza Mahroo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Reza Mahroo has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Amin Kargarian
Louisiana State University
4 shared publications - Mahdi Mehrtash
Ralph OConnor Sustainable Energy Institute, The Johns Hopkins University, Baltimore, MD, USA
2 shared publications - Antonio J. Conejo
Department of Integrated Systems Engineering and the Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA
1 shared publication - Benjamin F. Hobbs
The Johns Hopkins University
1 shared publication - Mohadese Movahednia
Department of Electrical and Computer Engineering, Louisiana State University, Baton Rouge, LA, USA
1 shared publication - Yankai Cao
University of British Columbia
1 shared publication
Latest Publications
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (4) , 2786-2798
Machine Learning–Enhanced Quantum–Classical Benders Decomposition for Stochastic Unit Commitment
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (4) , 2786-2798
Machine Learning–Enhanced Quantum–Classical Benders Decomposition for Stochastic Unit Commitment
- 18 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 39 (3) , 5272-5282
Transmission-Distribution Coordination for Enhancing Grid Resiliency Against Flood Hazards
Flooding poses a significant threat to power system infrastructures, especially substations, causing widespread outages. Prior preventive actions can avert significant financial losses and prolonged disruptions. Protecting electrical substations by Tiger Dams before flooding is a temporary yet effective solution to improve power grid resiliency. Nonetheless, resource constraints prevent the protection of all substations. This article proposes a two-stage stochastic optimization problem for proactive substation protection within both transmission and distribution systems, aiming to optimize grid resilience with a set of short-term operational actions. Transmission and distribution substation protection actions are coordinated to obtain a more effective protection scheme against flooding. A flood-aware optimal power flow is incorporated into the optimization model taking into account flood-related constraints coupling transmission and distribution systems. The possibility of transferring load through normally open switches of distribution systems is added to the model. The optimization problem is linearized and cast as a mixed-integer linear program. The efficiency of the proposed model is tested on a 24-bus system containing 24 transmission substations and 40 distribution substations.
- 18 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 39 (3) , 5272-5282
Transmission-Distribution Coordination for Enhancing Grid Resiliency Against Flood Hazards
Flooding poses a significant threat to power system infrastructures, especially substations, causing widespread outages. Prior preventive actions can avert significant financial losses and prolonged disruptions. Protecting electrical substations by Tiger Dams before flooding is a temporary yet effective solution to improve power grid resiliency. Nonetheless, resource constraints prevent the protection of all substations. This article proposes a two-stage stochastic optimization problem for proactive substation protection within both transmission and distribution systems, aiming to optimize grid resilience with a set of short-term operational actions. Transmission and distribution substation protection actions are coordinated to obtain a more effective protection scheme against flooding. A flood-aware optimal power flow is incorporated into the optimization model taking into account flood-related constraints coupling transmission and distribution systems. The possibility of transferring load through normally open switches of distribution systems is added to the model. The optimization problem is linearized and cast as a mixed-integer linear program. The efficiency of the proposed model is tested on a 24-bus system containing 24 transmission substations and 40 distribution substations.
- Open Access
- 29 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 4, 1-14
Learning Infused Quantum-Classical Distributed Optimization Technique for Power Generation Scheduling
The advent of quantum computing can potentially revolutionize how complex problems are solved. This paper proposes a two-loop quantum-classical solution algorithm for generation scheduling by infusing quantum computing, machine learning, and distributed optimization. The aim is to facilitate employing noisy near-term quantum machines with a limited number of qubits to solve practical power system optimization problems such as generation scheduling. The outer loop is a 3-block quantum alternative direction method of multipliers (QADMM) algorithm that decomposes the generation scheduling problem into three subproblems, including one quadratically unconstrained binary optimization (QUBO) and two non-QUBOs. The inner loop is a trainable quantum approximate optimization algorithm (T-QAOA) for solving QUBO on a quantum computer. The proposed T-QAOA translates interactions of quantum classical machines as sequential information and uses a recurrent neural network to estimate variational parameters of the quantum circuit with a proper sampling technique. T-QAOA determines the QUBO solution in a few quantum-learner iterations instead of hundreds of iterations needed for a quantum-classical solver. The outer 3-block ADMM coordinates QUBO and non-QUBO solutions to obtain the solution to the original problem. The conditions under which the proposed QADMM is guaranteed to converge are discussed. Two mathematical and three generation scheduling cases are studied. Analyses performed on quantum simulators and classical computers show the effectiveness of the proposed algorithm. The advantages of T-QAOA are discussed and numerically compared with QAOA which uses a stochastic gradient descent-based optimizer.
- 29 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 4, 1-14
Open AccessLearning Infused Quantum-Classical Distributed Optimization Technique for Power Generation Scheduling
The advent of quantum computing can potentially revolutionize how complex problems are solved. This paper proposes a two-loop quantum-classical solution algorithm for generation scheduling by infusing quantum computing, machine learning, and distributed optimization. The aim is to facilitate employing noisy near-term quantum machines with a limited number of qubits to solve practical power system optimization problems such as generation scheduling. The outer loop is a 3-block quantum alternative direction method of multipliers (QADMM) algorithm that decomposes the generation scheduling problem into three subproblems, including one quadratically unconstrained binary optimization (QUBO) and two non-QUBOs. The inner loop is a trainable quantum approximate optimization algorithm (T-QAOA) for solving QUBO on a quantum computer. The proposed T-QAOA translates interactions of quantum classical machines as sequential information and uses a recurrent neural network to estimate variational parameters of the quantum circuit with a proper sampling technique. T-QAOA determines the QUBO solution in a few quantum-learner iterations instead of hundreds of iterations needed for a quantum-classical solver. The outer 3-block ADMM coordinates QUBO and non-QUBO solutions to obtain the solution to the original problem. The conditions under which the proposed QADMM is guaranteed to converge are discussed. Two mathematical and three generation scheduling cases are studied. Analyses performed on quantum simulators and classical computers show the effectiveness of the proposed algorithm. The advantages of T-QAOA are discussed and numerically compared with QAOA which uses a stochastic gradient descent-based optimizer.
- 19 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industry Applications
- Vol. 60 (1) , 1433-1441
Does Choice of Power Flow Representation Matter in Transmission Expansion Optimization? A Quantitative Comparison for a Large-Scale Test System
Power transmission network reinforcements must be carefully evaluated to ensure economic, secure, and reliable delivery of electricity. Transmission expansion planning (TEP) models, which seek to optimize the timing, location, and voltages of new transmission lines, can be useful for this task. In general, such models can be mixed-integer nonconvex models due to the discrete nature of investments and AC power flow representations. The original nonconvex TEP model (i.e., ACTEP) is approximated as a linear model (i.e., DCTEP) in most studies. However, the accuracy of this TEP approximation has not been quantified for large-scale power systems. In this paper, we first propose a large-scale test system for ACTEP studies, which addresses drawbacks of existing test systems. An ACTEP global solver (i.e., Global-TEP) is used to obtain global solutions of the proposed test system with a guaranteed optimality gap, which allows it to serve as a benchmark for future ACTEP studies. Then, differences among solutions of four TEP models (i.e., DCTEP, local solution of ACTEP, global solution of ACTEP, and global solution of ACTEP with reactive power compensator expansion) are quantified. To our knowledge, this is the first quantitative comparison of DCTEP vs. ACTEP global solutions on a large-scale system. Since a significant difference is observed between the DCTEP and ACTEP solutions, and since the DCTEP solution's performance is significantly worse when verified by an AC load flow model, considering the exact AC power flow representations in TEP studies is recommended.
- 19 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industry Applications
- Vol. 60 (1) , 1433-1441
Does Choice of Power Flow Representation Matter in Transmission Expansion Optimization? A Quantitative Comparison for a Large-Scale Test System
Power transmission network reinforcements must be carefully evaluated to ensure economic, secure, and reliable delivery of electricity. Transmission expansion planning (TEP) models, which seek to optimize the timing, location, and voltages of new transmission lines, can be useful for this task. In general, such models can be mixed-integer nonconvex models due to the discrete nature of investments and AC power flow representations. The original nonconvex TEP model (i.e., ACTEP) is approximated as a linear model (i.e., DCTEP) in most studies. However, the accuracy of this TEP approximation has not been quantified for large-scale power systems. In this paper, we first propose a large-scale test system for ACTEP studies, which addresses drawbacks of existing test systems. An ACTEP global solver (i.e., Global-TEP) is used to obtain global solutions of the proposed test system with a guaranteed optimality gap, which allows it to serve as a benchmark for future ACTEP studies. Then, differences among solutions of four TEP models (i.e., DCTEP, local solution of ACTEP, global solution of ACTEP, and global solution of ACTEP with reactive power compensator expansion) are quantified. To our knowledge, this is the first quantitative comparison of DCTEP vs. ACTEP global solutions on a large-scale system. Since a significant difference is observed between the DCTEP and ACTEP solutions, and since the DCTEP solution's performance is significantly worse when verified by an AC load flow model, considering the exact AC power flow representations in TEP studies is recommended.
- 31 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 38 (1) , 912-920
Robust Dynamic TEP With an Security Criterion: A Computationally Efficient Model
This paper presents a hybrid column-and-constraint-generation augmented-Lagrangian algorithm to efficiently solve the robust security-constrained dynamic transmission expansion planning (TEP) problem. The column-and-constraint generation algorithm separates the TEP problem into a master problem and a set of subproblems decomposable by time period. Additionally, the computationally expensive master problem is decomposed into three computationally efficient sub-master problems: an upper-master quadratic problem, a middle-master quadratic unconstrained binary problem, and a lower-master quadratic unconstrained problem. A set of auxiliary variables are used to relax as real ones the binary variables corresponding to the status of candidate transmission lines enabling the master problem decomposition. The solutions of the three sub-master problems are coordinated using a three-block alternating direction method of multipliers algorithm to enforce binary variables to be binary. An initialization strategy based on load shedding is used to enhance the performance of the proposed algorithm. Simulation results on the IEEE 118-bus test system show the efficient performance of the proposed algorithm for solving security-constrained dynamic TEP problems.
- 31 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 38 (1) , 912-920
Robust Dynamic TEP With an Security Criterion: A Computationally Efficient Model
This paper presents a hybrid column-and-constraint-generation augmented-Lagrangian algorithm to efficiently solve the robust security-constrained dynamic transmission expansion planning (TEP) problem. The column-and-constraint generation algorithm separates the TEP problem into a master problem and a set of subproblems decomposable by time period. Additionally, the computationally expensive master problem is decomposed into three computationally efficient sub-master problems: an upper-master quadratic problem, a middle-master quadratic unconstrained binary problem, and a lower-master quadratic unconstrained problem. A set of auxiliary variables are used to relax as real ones the binary variables corresponding to the status of candidate transmission lines enabling the master problem decomposition. The solutions of the three sub-master problems are coordinated using a three-block alternating direction method of multipliers algorithm to enforce binary variables to be binary. An initialization strategy based on load shedding is used to enhance the performance of the proposed algorithm. Simulation results on the IEEE 118-bus test system show the efficient performance of the proposed algorithm for solving security-constrained dynamic TEP problems.