Arun Veeramany

Arun Veeramany

Auto-generated profile, based on publicly available information

Arun Veeramany

Pacific Northwest National Laboratory (PNNL), Richland, WA (United States)

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
1 November 2023 in Operations Research
Verified
Journal Article
Closed access
IAIgnacio Aravena
Ignacio Aravena
DMDaniel Molzahn
Daniel Molzahn
SZShixuan Zhang
Shixuan Zhang
CPCosmin G. Petra
Cosmin G. Petra
FCFrank E. Curtis
Frank E. Curtis
AVArun Veeramany
Arun Veeramany
Intro to the ARPA-E Grid Optimization Competition In “Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition,” we review the state of the art in practical algorithms for scheduling power-systems operations in the short term and the results of the recent competition organized by the U.S. Advanced Research Projects Agency–Energy. We explain the mixed-integer nonlinear formulation used in the competition for nonspecialists in electrical engineering, the context and organization of the competition, and the performance of competitors. We find that the collective approaches and results of competitors provide support for efforts to move nonlinear optimization techniques into industrial applications, as they have proven to be a robust and efficient alternative to current linear approximation techniques.

29 June 2020 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
YCYonghong Chen
Yonghong Chen
FPFeng Pan
Feng Pan
JHJesse Holzer
Jesse Holzer
EREdward Rothberg
Edward Rothberg
YMYaming Ma
Yaming Ma
AVArun Veeramany
Arun Veeramany
This paper introduces a market economics based neighborhood search and polishing algorithm to solve security constrained unit commitment (SCUC). The algorithm adaptively fixes binary and continuous variables and chooses lazy constraints based on hints from an initial solution and its associated neighborhood. A concurrent computing framework is developed to enable parallel neighborhood search and to start the algorithm from multiple initial solutions simultaneously. The initial solutions can come from historical commitments, relaxation or incumbent solutions from a MIP solver (obtained through callbacks), or any other algorithms. Testing on a large set of cases from Midcontinent Independent System Operator (MISO) (including both hourly interval and 15-min interval day ahead cases) on a high performance computing cluster with the concurrent neighborhood search and the polishing algorithm shows significant performance improvements compared to a MIP solver alone.

1 May 2011 in Nuclear Engineering and Design
Verified
Journal Article
Closed access
AVArun Veeramany
Arun Veeramany
MPMahesh D. Pandey
Mahesh D. Pandey

1 May 2011 in Annals of Nuclear Energy
Verified
Journal Article
Closed access
AVArun Veeramany
Arun Veeramany
MPMahesh D. Pandey
Mahesh D. Pandey

14 September 2023 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
SPShiva Poudel
Shiva Poudel
TRThiagarajan Ramachandran
Thiagarajan Ramachandran
AVArun Veeramany
Arun Veeramany
CFCody Francis
Cody Francis
ARAndrew P. Reiman
Andrew P. Reiman
This article presents a graph theory-informed approach to state estimation-based model selection for identifying the operational topology of a power distribution system. The proposed method is implemented in two stages, where the first stage is a graph-based candidate topology enumeration, and the second stage is a state estimation-based model selection. The first stage shrinks the sample space of possible switching combinations to provide candidate topologies for the second stage. The second stage solves state estimation for each candidate topology to obtain the system variables consistent with the system measurements. A candidate topology with the least objective is the most likely topology for the given measurements. The accuracy of the proposed approach is quantified using IEEE 123-bus and relevant performance metrics. It is demonstrated that the proposed method is robust against the high percentage of measurement errors and is computationally efficient in identifying the topology by reducing the search space by 96.87%.

16 April 2024
Verified
Report
Open access
PDF file
JHJesse T. Holzer
Jesse T. Holzer
CCCarleton J. Coffrin
Carleton J. Coffrin
CDChristopher DeMarco
Christopher DeMarco
RDRay Duthu
Ray Duthu
SEStephen T. Elbert
Stephen T. Elbert
JWJessica L. Wert
Jessica L. Wert
This report contains the problem formulation for the Grid Optimization (GO) Competition Challenge 3. The Grid Optimization Competition is run by a team of researchers from a number of organizations, including the sponsor Advanced Research Projects Agency - Energy (ARPA-E), lead organization Pacific Northwest National Laboratory (PNNL), and technical contributors from Los Alamos National Laboratory (LANL), National Renewable Energy Laboratory (NREL), Texas A&M University (TAMU), Georgia Institute of Technology (GT), University of Wisconsin (UW), and others. The GO Competition poses challenge problems in the field of power grid management, invites entrants to develop solvers for these problems, invokes the solvers on a set of problem instances using common hardware, ranks the solvers according to their performance, and awards prizes according to the rankings. The overall goal of the GO Competition is to spur innovative research on high impact and computationally challenging problems in power grid management from initial development through commercial deployment. The GO Competition has run three challenges. This report covers the Challenge 3 model formulation, including a high level description of the Challenge 3 problem, a reference to the symbols used in the formulation, a complete algebraic formulation of the optimization model, a description of the input and output data and formats, guaranteed properties of the data, requirements on solvers, and a description of software for evaluation of solutions.