Harsha Gangammanavar

Harsha Gangammanavar

Auto-generated profile, based on publicly available information

Harsha Gangammanavar

Operations Research and Engineering Management, Southern Methodist University, Dallas, USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 October 2017 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
SWShasha Wang
Shasha Wang
HGHarsha Gangammanavar
Harsha Gangammanavar
SESandra Eksioglu
Sandra Eksioglu
SMScott J. Mason
Scott J. Mason
This work is motivated by a power system with one main grid (arbiter) and multiple mirogrids (agents). The microgrids (MGs) are equipped to control their local generation and demand in the presence of uncertain renewable generation and heterogeneous energy management settings. We propose an extension to the classical two-stage stochastic programming model to capture these interactions by modeling the arbiter’s problem as the first-stage master problem and the agent decision problems as second-stage subproblems. To tackle this problem formulation, we propose a sequential sampling-based optimization algorithm that does not require a priori knowledge of probability distribution functions or selection of samples for renewable generation. The subproblems capture the details of different energy management settings employed at the agent MGs to control heating, ventilation and air conditioning systems; home appliances; industrial production; plug-in electrical vehicles; and storage devices. Our computational experiments conducted on the US western interconnect (WECC-240) data set illustrate that the proposed algorithm is scalable and the solutions are statistically verifiable. Our results also show that the proposed framework can be used as a systematic tool to gauge (a) the impact of energy management settings in efficiently utilizing renewable generation and (b) the role of flexible demands in reducing system costs.

27 April 2021 in IEEE Transactions on Sustainable Energy
Verified
Journal Article
Closed access
SYShengfei Yin
Shengfei Yin
JWJianhui Wang
Jianhui Wang
HGHarsha Gangammanavar
Harsha Gangammanavar
This paper proposes a three-stage unit commitment model for the market operation of transmission and distribution coordination under the uncertainties of renewable generation and demand variations. The first stage is for the independent system operator (TSO) that determines the commitment decisions of the transmission-level generators and the distribution-level system reconfiguration; the second stage optimizes the transmission economic dispatch; then distribution system operators (DSOs) in the third stage perform their economic dispatch and exchange information with the ISO at the boundary nodes. Between the transmission and distribution networks, not only conventional thermal generators but renewables and variable demands are considered, which are tackled via a multi-stage stochastic programming approach. The model adopts a convexified AC branch flow formulation in the distribution system. We devise a generalized nested L-shaped algorithm to solve the proposed framework in an efficient manner. Numerical experiments on multi-scale test systems corroborate the efficacy of this strategy.

1 December 2021 in International Journal of Electrical Power & Energy Systems
Verified
Journal Article
Closed access
AAAbdulraheem H. Alobaidi
Abdulraheem H. Alobaidi
MKMahdi Khodayar
Mahdi Khodayar
AVAli Vafamehr
Ali Vafamehr
HGHarsha Gangammanavar
Harsha Gangammanavar
MKMohammad E. Khodayar
Mohammad E. Khodayar

12 October 2016 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
HGHarsha Gangammanavar
Harsha Gangammanavar
SSSuvrajeet Sen
Suvrajeet Sen
This paper is motivated by a power system with storage devices at multiple locations which need to be controlled at a much finer timescale than that necessary for conventional generation units. We present a stochastic optimization model of the power system which captures interactions of decisions at these two timescales through a novel state-variable formulation. The model also includes transmission constraints approximated by a linearized dc network, fast response operating reserves, and renewable generation. To tackle this high-dimensional multistage stochastic optimization problem, we present a sequential sampling method which we refer to as the stochastic dynamic linear programming. This algorithm is a dynamic extension of regularized two-stage stochastic decomposition for stagewise independent multistage stochastic linear programs, and is targeted at the class of problems where decisions are made at two different timescales. We compare our algorithm with the stochastic dual dynamic programming (SDDP) which has been effectively applied in planning power systems operations. Our computational results show that our sequential Monte-Carlo approach provides prescriptive solutions and values which are statistically indistinguishable from those obtained from SDDP, while improving computational times significantly.

1 January 2021 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
HGHarsha Gangammanavar
Harsha Gangammanavar
YLYifan Liu
Yifan Liu
SSSuvrajeet Sen
Suvrajeet Sen
Stochastic decomposition (SD) has been a computationally effective approach to solve large-scale stochastic programming (SP) problems arising in practical applications. By using incremental sampling, this approach is designed to discover an appropriate sample size for a given SP instance, thus precluding the need for either scenario reduction or arbitrary sample sizes to create sample average approximations (SAA). When compared with the solutions obtained using the SAA procedure, SD provides solutions of similar quality in far less computational time using ordinarily available computational resources. However, previous versions of SD were not applicable to problems with randomness in second-stage cost coefficients. In this paper, we extend its capabilities by relaxing this assumption on cost coefficients in the second stage. In addition to the algorithmic enhancements necessary to achieve this, we also present the details of implementing these extensions, which preserve the computational edge of SD. Finally, we illustrate the computational results obtained from the latest implementation of SD on a variety of test instances generated for problems from the literature. We compare these results with those obtained from the regularized L-shaped method applied to the SAA function of these problems with different sample sizes.

1 January 2021 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
HGHarsha Gangammanavar
Harsha Gangammanavar
SSSuvrajeet Sen
Suvrajeet Sen
Multistage stochastic programming deals with operational and planning problems that involve a sequence of decisions over time while responding to an uncertain future. Algorithms designed to address...