Engineering Papers⌕ Search

Engineering topics

Rajan, Deepak

Publications and source records attributed to Rajan, Deepak.

Stochastic Gradient-Based Distributed Bayesian Estimation in Cooperative Sensor Networks

Distributed Bayesian inference provides a full quantification of uncertainty offering numerous advantages over point estimates that autonomous sensor networks are able to exploit. However, fully-decentralized Bayesian inference often requires large communication overheads and low network latency, resources that are not typically available in practical applications. In this paper, we propose a decentralized Bayesian inference approach based on stochastic gradient Langevin dynamics, which produces full posterior distributions at each of the nodes with significantly lower communication overhead. We provide analytical results on convergence of the proposed distributed algorithm to the centralized posterior, under typical network constraints. Finally, we also provide extensive simulation results to demonstrate the validity of the proposed approach.

42 ENGINEERING↗

Optimization-Driven Scenario Grouping

Scenario decomposition algorithms for stochastic programs compute bounds by dualizing all nonanticipativity constraints and solving individual scenario problems independently. Here, we develop an approach that improves on these bounds by reinforcing a carefully chosen subset of nonanticipativity constraints, effectively placing scenarios into groups. Specifically, we formulate an optimization problem for grouping scenarios that aims to improve the bound by optimizing a proxy metric based on information obtained from evaluating a subset of candidate feasible solutions. We show that the proposed grouping problem is NP-hard in general, identify a polynomially solvable case, and present two formulations for solving the problem: a matching formulation for a special case and a mixed-integer programming formulation for the general case. We use the proposed grouping scheme as a preprocessing step for a particular scenario decomposition algorithm and demonstrate its effectiveness in solving standard test instances of two-stage 0–1 stochastic programs. Using this approach, we are able to prove optimality for all previously unsolved instances of a standard test set. Additionally, we implement this scheme as a preprocessing step for PySP, a publicly available and widely used implementation of progressive hedging, and compare this grouping approach with standard grouping approaches on large-scale stochastic unit commitment instances. Finally, the idea is extended to propose a finitely convergent algorithm for two-stage stochastic programs with a finite feasible region.

97 MATHEMATICS AND COMPUTING↗

Sequential optimal positioning of mobile sensors using mutual information

Source localization, such as detecting a nuclear source in an urban area or ascertaining the origin of a chemical plume, is generally regarded as a well-documented inverse problem; however, optimally placing sensors to collect data for such problems is a more challenging task. In particular, optimal sensor placement—that is, measurement locations resulting in the least uncertainty in the estimated source parameters—depends on the location of the source, which is typically unknown a priori. Mobile sensors are advantageous because they have the flexibility to adapt to any given source position. While most mobile sensor strategies designate a trajectory for sensor movement, we instead employ mutual information, based on Shannon entropy, to choose the next measurement location from a discrete set of design conditions.

97 MATHEMATICS AND COMPUTING↗

Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs

PIPS-SBB is a distributed-memory parallel solver with a scalable data distribution paradigm. It is designed to solve MIPs with a dual-block angular structure, which is characteristic of deterministic-equivalent Stochastic Mixed-Integer Programs (SMIPs). In this paper, we present two different parallelizations of Branch & Bound (B&B), implementing both as extensions of PIPS-SBB, thus adding an additional layer of parallelism. In the first of the proposed frameworks, PIPS-PSBB, the coordination and load-balancing of the different optimization workers is done in a decentralized fashion. This new framework is designed to ensure all available cores are processing the most promising parts of the B&B tree. The second, ug[PIPS-SBB,MPI], is a parallel implementation using the Ubiquity Generator (UG), a universal framework for parallelizing B&B tree search that has been sucessfully applied to other MIP solvers. We show the effects of leveraging multiple levels of parallelism in potentially improving scaling performance beyond thousands of cores.

97 MATHEMATICS AND COMPUTING↗

Optimal Black Start Allocation for Power System Restoration

Equipment failures, operator errors, natural disasters and cyber-attacks can and have caused extended blackouts of the electric grid. Even though such events are rare, preparedness for them is critical because extended power outages endanger human lives, compromise national security, or result in economic losses of billions of dollars. Since most of the generating units cannot restart without connecting to an energized grid, the system operator relies on a few units with the ability to start autonomously, called Black Start (BS) units, to restore the power system. Allocating and maintaining these units is costly and can severely impact the restoration security and time. We formulate an optimization problem to optimally allocate BS units in the grid, while simultaneously optimizing over the restoration sequence. We extend existing optimal allocation models by including grid considerations such as active power nodal balance, transmission switching, nodal reactive power support and voltage limits. In order to aid the branch and bound tree that solves the resulting large scale mixed integer program, we propose a randomized heuristic that is executed multiple times in parallel on a high-performance computing environment to find feasible solutions. Here, we proceed to solve the IEEE-39, the IEEE-118, and a simplified WECC system with 225 nodes and 136 generators to near optimality.

97 MATHEMATICS AND COMPUTING↗

Role of Operating Flexibility in Planning Studies

This project was conceived to examine the flexibility needs of the future California power grid. The analysis explores the need to establish generation planning metrics and standards that explicitly consider the operating flexibility needs of the system as the State pursues its aggressive renewable power generation goals. New methods and tools have been developed to use high resolution models of the grid that take into account uncertainties regarding renewable generation, load, equipment reliability, and economic growth. These models leverage high performance computational resources to fully explore the range of possible grid conditions that may lead to loss of load. The cost effectiveness of operating policies and hardware configurations that increase grid flexibility are examined with the tools to provide actionable information to grid planners and stakeholders.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Parallel Interior Point Solver - Simple Branch & Bound

The purpose of this software package is to solve large-scale block-angular mixed-integer (linear) programs specified in SMPS format; the major application of this software package is to solving large-scale stochastic mixed-integer programs, which are block-angular.

Oxberry, Geoffrey↗

Scenario Decomposition for 0-1 Stochastic Programs: Improvements and Asynchronous Implementation

We recently proposed scenario decomposition algorithm for stochastic 0-1 programs finds an optimal solution by evaluating and removing individual solutions that are discovered by solving scenario subproblems. In our work, we develop an asynchronous, distributed implementation of the algorithm which has computational advantages over existing synchronous implementations of the algorithm. Improvements to both the synchronous and asynchronous algorithm are proposed. We also test the results on well known stochastic 0-1 programs from the SIPLIB test library and is able to solve one previously unsolved instance from the test set.

97 MATHEMATICS AND COMPUTING↗

PIPS-SBB: A Parallel Distributed-Memory Branch-and-Bound Algorithm for Stochastic Mixed-Integer Programs

Stochastic mixed-integer programs (SMIPs) deal with optimization under uncertainty at many levels of the decision-making process. When solved as extensive formulation mixed- integer programs, problem instances can exceed available memory on a single workstation. In order to overcome this limitation, we present PIPS-SBB: a distributed-memory parallel stochastic MIP solver that takes advantage of parallelism at multiple levels of the optimization process. We also show promising results on the SIPLIB benchmark by combining methods known for accelerating Branch and Bound (B&B) methods with new ideas that leverage the structure of SMIPs. Finally, we expect the performance of PIPS-SBB to improve further as more functionality is added in the future.

97 MATHEMATICS AND COMPUTING↗

A polyhedral study of production ramping

Here, we give strong formulations of ramping constraints—used to model the maximum change in production level for a generator or machine from one time period to the next—and production limits. For the two-period case, we give a complete description of the convex hull of the feasible solutions. The two-period inequalities can be readily used to strengthen ramping formulations without the need for separation. For the general case, we define exponential classes of multi-period variable upper bound and multi-period ramping inequalities, and give conditions under which these inequalities define facets of ramping polyhedra. Finally, we present exact polynomial separation algorithms for the inequalities and report computational experiments on using them in a branch-and-cut algorithm to solve unit commitment problems in power generation.

97 MATHEMATICS AND COMPUTING↗

Parallel Interior Point Solver - Simple Branch & Bound

The purpose of this software package is to solve large-scale block-angular mixed-integer (linear) programs specified in SMPS format; the major application of this software package is to solving large-scale stochastic mixed-integer programs, which are block-angular.

Oxberry, Geoffrey↗

A Comprehensive Evaluation of Robust Unit Commitment

This report summarizes the procedure to compare the robust UC approach with the deterministic counterpart. The procedure involves solving the robust and deterministic UC problems under various scenario configurations, and then performing system dispatch simulations under each UC solution to generate economic and operational performance measures. The report describes the parallelization process for solving UC problems as well as for running system dispatch simulations. The report also summarizes the statistical model used for generating Monte Carlo simulation samples and forming forecast ranges used in the robust UC approach. Some key findings are discussed as well. In particular, the economic and operational performance of the robust and deterministic approaches is compared under different 1) conservatism levels or the sizes of forecast range, 2) the wind penetration levels, and 3) the mixture of load and wind behaviors.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗