24 May 2016 in IEEE Transactions on Power Systems
Aggregations of electric loads can provide reserves to power systems, but their available reserve capacities are time-varying and not perfectly known when the system operator computes the optimal generation and reserve schedule. In this paper, we formulate a chance constrained optimal power flow problem to procure minimum cost energy, generator reserves, and load reserves given uncertainty in renewable energy production, load consumption, and load reserve capacities. Assuming that uncertainty distributions are not perfectly known, we solve the problem with distributionally robust optimization, which ensures that chance constraints are satisfied for any distribution in an ambiguity set built upon the first two moments. We use two ambiguity sets to reformulate the model as a semidefinite program and a second-order cone program and run computational experiments on the IEEE 9-bus, 39-bus, and 118-bus systems. We compare the solutions to those given by two benchmark reformulations; the first assumes normally distributed uncertainty and the second uses large numbers of uncertainty samples. We find that the use of load reserves, even when load reserve capacities are uncertain, reduces operational costs. Also, the approach is able to meet reliability requirements, unlike the first benchmark approach and with lower computation times than the second benchmark approach.
1 January 2018 in SIAM Journal on Optimization
We consider chance-constrained binary programs, where each row of the inequalities that involve uncertainty needs to be satisfied probabilistically. Only the information of the mean and covariance matrix is available, and we solve distributionally robust chance-constrained binary programs (DCBP). Using two different ambiguity sets, we equivalently reformulate the DCBPs as 0-1 second-order cone (SOC) programs. We further exploit the submodularity of 0-1 SOC constraints under special and general covariance matrices, and we utilize the submodularity as well as lifting to derive extended polymatroid inequalities to strengthen the 0-1 SOC formulations. We incorporate the valid inequalities in a branch-and-cut algorithm for efficiently solving DCBPs. We demonstrate the computational efficacy and solution performance using diverse instances of a chance-constrained bin packing problem.
1 December 2017 in Operations Research
We consider a single-server scheduling problem given a fixed sequence of appointment arrivals with random no-shows and service durations. The probability distribution of the uncertain parameters is assumed to be ambiguous, and only the support and first moments are known. We formulate a class of distributionally robust (DR) optimization models that incorporate the worst-case expectation/conditional value-at-risk penalty cost of appointment waiting, server idleness, and overtime into the objective or constraints. Our models flexibly adapt to different prior beliefs of no-show uncertainty. We obtain exact mixed-integer nonlinear programming reformulations and derive valid inequalities to strengthen the reformulations that are solved by decomposition algorithms. In particular, we derive convex hulls for special cases of no-show beliefs, yielding polynomial-sized linear programming models for the least and the most conservative supports of no-shows. We test various instances to demonstrate the computational efficacy of our approaches and to compare the results of various DR models given perfect or ambiguous distributional information. The e-companion is available at https://doi.org/10.1287/opre.2017.1656 .
1 March 2017 in Operations Research Letters
30 March 2020 in Manufacturing & Service Operations Management
Problem definition: We study electric vehicle (EV) sharing systems and explore the opportunity for incorporating vehicle-to-grid (V2G) electricity selling in EV sharing. Academic/practical relevanc...
9 April 2018 in Optimization Letters