As significant amounts of renewable distributed generation (RDG) resources are installed in the power grid, it becomes increasingly important to plan RDG integration to maximize the utilization of renewable energy and mitigate unintended consequences, such as phase unbalance. One of the biggest challenges in RDG integration planning is the lack of sufficient information to fully characterize uncertainty (e.g., load and renewable output). In this paper, we propose a two-stage data-driven distributionally robust optimization model (O-DDSP) for the optimal placement of RDG resources, with both load and generation uncertainties described by a data-driven ambiguity set that both enables more flexibility than stochastic optimization (SO) and allows less conservative solutions than robust optimization (RO). To reduce the computational complexity introduced by the ambiguity set while keeping the most valuable data, we introduce a tight approximation of O-DDSP based on principal component analysis (PCA) leading to a model called P-DDSP. Computational experiments show that P-DDSP significantly speeds up the solution procedure and our approaches lead to significant cost savings as well as increased renewable penetration.
Distributionally robust optimization (DRO) is a modeling framework in decision making under uncertainty in which the probability distribution of a random parameter is unknown although its partial information (e.g., statistical properties) is available. In this framework, the unknown probability distribution is assumed to lie in an ambiguity set consisting of all distributions that are compatible with the available partial information. Although DRO bridges the gap between stochastic programming and robust optimization, one of its limitations is that its models for large-scale problems can be significantly difficult to solve, especially when the uncertainty is of high dimension. In this paper, we propose computationally efficient inner and outer approximations for DRO problems under a piecewise linear objective function and with a moment-based ambiguity set and a combined ambiguity set including Wasserstein distance and moment information. In these approximations, we split a random vector into smaller pieces, leading to smaller matrix constraints. In addition, we use principal component analysis to shrink uncertainty space dimensionality. We quantify the quality of the developed approximations by deriving theoretical bounds on their optimality gap. We display the practical applicability of the proposed approximations in a production–transportation problem and a multiproduct newsvendor problem. The results demonstrate that these approximations dramatically reduce the computational time while maintaining high solution quality. The approximations also help construct an interval that is tight for most cases and includes the (unknown) optimal value for a large-scale DRO problem, which usually cannot be solved to optimality (or even feasibility in most cases). Summary of Contribution: This paper studies an important type of optimization problem, that is, distributionally robust optimization problems, by developing computationally efficient inner and outer approximations via operations research tools. Specifically, we consider several variants of such problems that are practically important and that admit tractable yet large-scale reformulation. We accordingly utilize random vector partition and principal component analysis to derive efficient approximations with smaller sizes, which, more importantly, provide a theoretical performance guarantee with respect to low optimality gaps. We verify the significant efficiency (i.e., reducing computational time while maintaining high solution quality) of our proposed approximations in solving both production–transportation and multiproduct newsvendor problems via extensive computing experiments.
Recently, increasing penetration of renewable energy generation has created challenges for power system operators to perform efficient power generation daily scheduling, due to the intermittent nature of the renewable generation and discrete decisions of each generation unit. Among all aspects to be considered, a unit commitment polytope is fundamental and embedded in the models at different stages of power system planning and operations. In this article, we focus on deriving polynomial-time algorithms for the unit commitment problems with a general convex cost function and piecewise linear cost function, respectively. We refine an time, where T represents the number of time periods, algorithm for the deterministic single-generator unit commitment problem with a general convex cost function and accordingly develop an extended formulation in a higher-dimensional space that can provide an integral solution, in which the physical meanings of the decision variables are described. This means the original problem can be solved as a convex program instead of a mixed-integer convex program. Furthermore, for the case in which the cost function is piecewise linear, by exploring the optimality conditions, we derive more efficient algorithms for both deterministic (i.e., time) and stochastic (i.e., time, where N represents the number of nodes in the stochastic scenario tree) single-generator unit commitment problems. We also develop the corresponding extended formulations for both deterministic and stochastic single-generator unit commitment problems that solve the original mixed-integer linear programs as linear programs. Similarly, physical meanings of the decision variables are explored to show the insights of the new modeling approach.
1 October 2017 in Transportation Research Part E: Logistics and Transportation Review
Problem definition: Shared micromobility vehicles provide an eco-friendly form of short-distance travel within an urban area. Because customers pick up and drop off vehicles in any service region at any time, such convenience often leads to a severe imbalance between vehicle supply and demand in different service regions. To overcome this, a micromobility operator can crowdsource individual riders with reward incentives in addition to engaging a third-party logistics provider (3PL) to relocate the vehicles. Methodology/results: We construct a time-space network with multiple service regions and formulate a two-stage stochastic mixed-integer program considering uncertain customer demands. In the first stage, the operator decides the initial vehicle allocation for the regions, whereas in the second stage, the operator determines subsequent vehicle relocation across the regions over an operational horizon. We develop an efficient solution approach that incorporates scenario-based and time-based decomposition techniques. Our approach outperforms a commercial solver in solution quality and computational time for solving large-scale problem instances based on real data. Managerial implications: The budgets for acquiring vehicles and for rider crowdsourcing significantly impact the vehicle initial allocation and subsequent relocation. Introducing rider crowdsourcing in addition to the 3PL can significantly increase profit, reduce demand loss, and improve the vehicle utilization rate of the system without affecting any existing commitment with the 3PL. The 3PL is more efficient for mass relocation than rider crowdsourcing, whereas the latter is more efficient in handling sporadic relocation needs. To serve a region, the 3PL often relocates vehicles in batches from faraway, low-demand regions around peak hours of a day, whereas rider crowdsourcing relocates a few vehicles each time from neighboring regions throughout the day. Furthermore, rider crowdsourcing relocates more vehicles under a unimodal customer arrival pattern than a bimodal pattern, whereas the reverse holds for the 3PL. Funding: This work was supported by the Research Grants Council of Hong Kong [Grants 15501319 and 15505318] and the National Natural Science Foundation of China [Grant 71931009]. Z. Jin was supported by the Hong Kong PhD Fellowship Scheme. Y. F. Lim was supported by the Lee Kong Chian School of Business, Singapore Management University [Maritime and Port Authority Research Fellowship]. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2023.1199 .
28 October 2021 in Applied and Environmental Microbiology
As one of the most diverse organisms, soil microbes play indispensable roles in many ecological processes in arid and semiarid areas with limited macrofaunal and plant diversity, yet the mechanisms underpinning soil microbial community are not fully understood. In this study, soil microbial communities were investigated along a 500-km transect covering a steep environmental gradient across farmland and grassland in the areas.