Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal Allocation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Optimal Allocation of Water Resources Using a Two-Stage Stochastic Programming Method with Interval and Fuzzy Parameters

Efficient water allocation is one of the most prominent issues in water resources management. In this research, a two-stage interval-parameter stochastic fuzzy programming with type 2 membership functions was used to allocate water resources optimally to different users under uncertainty. This method can handle uncertainties expressed as probability distributions, discrete intervals, and fuzzy sets. The model considers treated wastewater as an allocable water resource in a scenario, in addition to water that is extracted from wellheads, springs, and qanats. Moreover, the loss rate of water during distribution, surplus water in the reservoir in the previous and the next period, and treated wastewater parameters have been incorporated into the model. This model was applied to a case study of water resources allocation within a multi-user and multi-reservoir context in the Zarand region of Kerman, Iran. The results indicate that reasonable solutions have been generated, in the form of interval and fuzzy information under different scenarios that could help managers provide optimal water resources allocation plans. The results also demonstrate that establishing a wastewater treatment station increases the system net benefits, surplus water in wellheads for the next period, and system reliability (level of satisfying the fuzzy goal and constraints), and decreases encountering water shortages.

58 GEOSCIENCES↗

Optimized allocation method of the VSC-MTDC system for frequency regulation reserves considering the cost

In recent years, the interconnection of asynchronous power grids through the VSC-MTDC system has been proposed and extensively studied in light of the potential benefits of economical bulk power exchanges and frequency regulation reserves sharing. This paper proposed an optimized allocation method for sharing frequency regulation reserves among the interconnected power systems and the corresponding frequency regulation control of the VSC-MTDC system under emergency frequency deviation events. Firstly, the frequency regulation reserve classification is proposed. In the classification, the available frequency response capacity reserves of each interconnection are divided into commercial reserves and regular reserves. While the commercial reserves are procured through long-term contracts, the regular reserves are purchased based on market prices of frequency regulation services. Secondly, based on the proposed frequency regulation reserve classification, a novel frequency regulation control is then introduced for the VSC-MTDC system. This control method could minimize the costs of the disturbed power grid for the needed frequency response supports from the other power grids. Simulation verifications are performed on a modified IEEE 39 bus system and a highly reduced power system model representing the North American grids. The simulation verification indicates that the developed frequency regulation control significantly reduced ancillary service costs of the disturbed power grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimal Allocation of Static Var Compensator via Mixed Integer Conic Programming

Shunt FACTS devices, such as, a Static Var Compensator (SVC), are capable of providing local reactive power compensation. They are widely used in the network to reduce the real power loss and improve the voltage profile. This paper proposes a planning model based on mixed integer conic programming (MICP) to optimally allocate SVCs in the transmission network considering load uncertainty. The load uncertainties are represented by a number of scenarios. Reformulation and linearization techniques are utilized to transform the original non-convex model into a convex second order cone programming (SOCP) model. Numerical case studies based on the IEEE 30-bus system demonstrate the effectiveness of the proposed planning model.

Zhang, Xiaohu↗

Optimal Allocation of Dynamic Var Sources Using the Voronoi Diagram Method Integrating Linear Programing

Dynamic reactive power (var) sources can effectively mitigate fault-induced delayed voltage recovery (FIDVR) issues. This paper optimizes the sizes of dynamic var sources at given locations against FIDVR issues under severe contingencies. First, the geometric characteristics about the non-convex solution space of this problem are studied. Accordingly, a Voronoi diagram approach integrating linear programming (LP) is proposed, which disperses a number of sample points of potential solutions in the searching space to construct a Voronoi diagram blending the local cost functions over the entire space by Barycentric interpolation in Voronoi regions. New sample points are then recursively added, including the tentative optimal point using LP, the most depopulated area point ensuring global fidelity, and the connecting point, until the stopping criterion is met. The new approach is demonstrated in detail on the WSCC 9-bus system. A case study on the NPCC 140-bus system also validates that the proposed approach can effectively estimate the boundary and the geometry of the feasible solution region in the searching space and find the optimal solution.

barycentric interpolation↗

Optimal allocation of series FACTS devices in large‐scale systems

Series flexible AC transmission systems devices, such as the variable series reactor, have the ability to continuously regulate the transmission line reactance so as to control power flow. This study presents a new approach to optimally locating such devices in the transmission network considering multiple operating states and contingencies. To investigate optimal investment, a single target year planning with three different load patterns is considered. The transmission contingencies may occur under any of the three load conditions and the coupling constraints between base case and contingencies are included. A reformulation technique transforms the original mixed integer non‐linear programming model into mixed integer linear programming model. To further relieve the computational burden and enable the planning model to be directly applied to practical large‐scale systems, a two‐phase decomposition algorithm is introduced. Detailed numerical simulation results on IEEE 118‐bus system and the Polish 2383‐bus system illustrate the efficient performance of the proposed algorithm.

Zhang, Xiaohu↗

Nonlinear control of the minimum safety factor in tokamaks by optimal allocation of spatially moving electron cyclotron current drive

The minimum value of the safety factor profile is related to the magnetohydrodynamic (MHD) stability of the plasma confined in a tokamak. Therefore, active control of the minimum safety factor may mitigate MHD instabilities that can degrade or even terminate plasma confinement. Typically, in most tokamak scenarios, the minimum safety factor evolves spatially with time, i.e., the location at which the safety factor achieves the minimum value changes with time. In addition to the inherent nonlinearities in the minimum safety factor evolution, its spatial variation makes the control design challenging. In particular, complexity in control design may arise from the need for time-dependent nonlinear models that account for spatial variation of the minimum safety factor. Furthermore, the minimum safety factor may drift to locations where the actuator authority is low. The problem of minimum safety factor control with target location tracking and moving electron cyclotron current drive (ECCD) is addressed in this work. A nonlinear time-dependent model that incorporates the spatial variation of the minimum safety factor is presented. A nonlinear controller based on optimal feedback linearization is developed to track a target minimum safety factor. The proposed controller treats the ECCD position as a controllable variable. In other words, the controller prescribes the ECCD position (in addition to the non-inductive powers) in real time based on an optimal criterion that is defined a priori. This work also presents the steps necessary to integrate the minimum safety factor controller with a total energy controller to achieve multiple control objectives simultaneously. In conclusion, the proposed integrated control algorithm is tested using nonlinear simulations in the Control Oriented Transport SIMulator (COTSIM) for a DIII-D tokamak scenario.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Scaling Optimal Allocation of Cloud Resources Using Lagrange Relaxation

The rapid growth of Cloud Computing (CC) has increased the variety of computing resources, storage, and communication services that pose significant new challenges for the efficient use of cloud resources. The cost-efficient allocation of cloud resources has become a decisive premise for the adoption of CC services. The cost-efficient selection and scheduling of these resources to meet the demands of a scientific workflow is a challenging problem that is exacerbated by the inclusion of multiple CC providers. In this paper, we present a novel strategy for the cost-efficient selection of CC resources using Lagrange relaxation. Our approach is based on preselection of resources and demand decomposition to create a series of smaller sub-problems, which allow the estimation of the best cost-structures and selection of CC service providers for a subset of the time period of the planning horizon. Decomposition of the demand is achieved through the boundary analysis of a continuous relaxation of the problem. Using the metrics defined in terms of the cost and time of completion, we demonstrate excellent performance in relation to optimal solutions. Our method reduced the computational time from hours to seconds for a representative 36-month problem and provided high-quality solutions (< 0.05% relative error). Given the importance of selecting resources and scheduling complex scientific workflows, we believe that this novel strategy will be beneficial for many researchers and users of cloud computing resources.

De La Torre, Luis↗

A Model for Optimally Allocating Curbside Space Among Competing Uses

The emergence of various new forms of urban mobility services in recent years is leading to new pressures on curbside space. Municipalities, the entities typically responsible for managing the curbside, are in many instances handling these growing pressures by reallocating portions of the curbside away from traditional uses (such as metered and residential parking) in favor of uses such as ridehailing, scooter and bike-share corrals. As yet, however, such actions are being undertaken on an ad-hoc basis, due to the rapidly growing complexity of the curbside and the lack of standard analytical approaches. This lack of analytical capability is due to the traditional focus of transportation network modeling being focused predominantly on the interaction of supply and demand on links and nodes, with limited focus on link edges (the curbside). In this paper we address this research need by proposing a framework for modeling inter-modal competition for curbside space, inspired by the classical Bid-Rent Model of urban land use, intended to support curb managers to move towards maximizing the aspects of economic welfare that relate to curb access. In the bi-level model, choices made by the curbside manager impact travelers’ mode choices, and vice versa. We then present a simple numerical case study to demonstrate the properties of the proposed model, showing its tractability, flexibility, and intuitive sensitivity to systematic variation in inputs. The framework demonstrates the type of adaptive and evolving approach needed to maximize benefits from increasingly dynamic curb management strategies. The paper concludes with a brief discussion of future research needs to advance this line of inquiry.

33 ADVANCED PROPULSION SYSTEMS↗

Optimal Allocation of Proton Therapy Slots in Combined Proton-Photon Radiation Therapy

Proton therapy is a limited resource that is not available to all patients who may benefit from it. We investigated combined proton-photon treatments, in which some fractions are delivered with protons and the remaining fractions with photons, as an approach to maximize the benefit of limited proton therapy resources at a population level.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

CO2ROpt (Feedstock Allocation Optimization Model) [SWR-22-13]

Reducing greenhouse gas emissions remains a critical challenge for the transportation and chemical sectors. The electrochemical reduction of carbon dioxide is a potential pathway for production of fuels and chemicals that uses atmospheric carbon dioxide as a feedstock. Here we present an analysis of the potential for carbon dioxide captured from point sources and via direct air capture to be utilized in electrochemical reduction under different market scenarios. Using a numerical optimization framework and national data sets, scenarios for nationwide production of ethylene, formate, and carbon monoxide are evaluated at scales comparable to current production of these molecules in the United States. We show that developing a network for production of these products at scale requires capture and utilization of significant portions of the carbon dioxide that is currently emitted from large stationary point sources. Because carbon dioxide point sources are spatially and compositionally variable, their use for carbon dioxide reduction depends on electricity prices, capture cost, and location. If the power sector in the United States is decarbonized, carbon dioxide supply decreases significantly, increasing the importance of utilizing other carbon dioxide streams, and increasing the likelihood that direct air capture plays a role in supplying carbon dioxide feedstocks. These findings provide a first insight into the feedstock and energy constraints for carbon dioxide reduction.

Badgett, Alex↗

A Methodology for Dynamic Security Risk Quantification and Optimal Resource Allocation of Security Assets

In this presentation we overview a methodology for dynamic security risk quantification and optimal resource allocation of security assets for high profile venues. This methodology is especially applicable to venues that require security screening operations such as mass transit (e.g., train or airport terminals), critical infrastructure protection (e.g., government buildings), and largescale public events (e.g., concerts or professional sports). The method starts by decomposing the three core components of risk -- threat, vulnerability, and consequence -- into their various subcomponents. For instance, vulnerability can be decomposed into availability, accessibility, organic security, and target hardness and each of these can be evaluated against the potential threats of interest for the given venue. Once evaluated, these subcomponents are rolled back up to compute the specific value for the vulnerability core risk component. Likewise, the same is done for consequence and threat, and then risk is computed as the product of these three components. A key aspect of our methodology is dynamically quantifying risk. That is, we incorporate the ability to uniquely allow the subcomponents and core components, and in turn, risk, to be quantified as a continuous function of time throughout the day, week, month, or year as appropriate.

Brigantic, Robert T.↗

Optimal resource allocation for flexible-grid entanglement distribution networks

We use a genetic algorithm (GA) as a design aid for determining the optimal provisioning of entangled photon spectrum in flex-grid quantum networks with arbitrary numbers of channels and users. After introducing a general model for entanglement distribution based on frequency-polarization hyperentangled biphotons, we derive upper bounds on fidelity and entangled bit rate for networks comprising one-to-one user connections. Simple conditions based on user detector quality and link efficiencies are found that determine whether entanglement is possible. We successfully apply a GA to find optimal resource allocations in four different representative network scenarios and validate features of our model experimentally in a quantum local area network in deployed fiber. Our results show promise for the rapid design of large-scale entanglement distribution networks.

97 MATHEMATICS AND COMPUTING↗

Belowground Biomass Response to Nutrient Enrichment Depends on Light Limitation Across Globally Distributed Grasslands

Anthropogenic activities are increasing nutrient inputs to ecosystems worldwide, with consequences for global carbon and nutrient cycles. Recent meta analyses show that above ground primary production is often co-limited by multiple nutrients; however, little is known abouthowroot production responds to changes in nutrient availability. At twenty-nine grassland sites on four continents, we quantified shallow root biomass responses to nitrogen (N), phosphorus (P) and potassium plus micronutrient enrichment and compared below- and above ground responses. We hypothesized that optimal allocation theory would predict context dependence in root biomass responses to nutrient enrichment, given variation among sites in the resources limiting to plant growth (specifically light versus nutrients). Consistent with the predictions of optimal allocation theory, the proportion of total biomass below ground declined with N or P addition, due to increased biomass above ground (for N and P) and decreased biomass below ground (N, particularly in sites with low canopy light penetration). Absolute root biomass increased with N addition where light was abundant at the soil surface, but declined in sites where the grassland canopy intercepted a large proportion of incoming light. These results demonstrate that below ground responses to changes in resource supply can differ strongly from above ground responses, which could significantly modify predictions of future rates of nutrient cycling and carbon sequestration. Our results also highlight how optimal allocation theory developed for individual plants may help predict below ground biomass responses to nutrient enrichment at the ecosystem scale across wide climatic and environmental gradients.

Cleland, Elsa↗

Optimizing resource allocation in Miscanthus breeding via sparse testing designs for genomic prediction

Phenotyping high-biomass perennial crops is laborious and the rate of genetic gain in conventional perennial crop breeding programs is typically low. So, it is especially important to identify methods that produce efficiency gains in the breeding process. Miscanthus is a C4 perennial grass with favorable characteristics for producing biomass as a feedstock for biofuels and diverse bio-based products. Increasing biomass yield will increase profitability and environmental benefits, so it is a key target for Miscanthus breeding. In addition, the identification of well-adapted genotypes across a wide range of environmental conditions requires the establishment of multi-environment trials (METs). Sparse testing is a genomic prediction-based strategy that reduces the phenotyping costs in METs by selecting a subset of genotypes to evaluate in a subset of environments and then predicts the performance of the unobserved genotype-environment combinations. A Miscanthus sacchariflorus (MSA) population comprising 336 genotypes observed across three environments was analyzed implementing sparse testing designs. Three prediction models considering main effects (environments, genotypes, genomic) and interaction effects (genotype-by-environment; G×E interaction) were implemented for forecasting dry biomass yield (YDY), total culm (TCM), average internode length (AIL), and culm node number (CNN). Multiple calibration sets based on different compositions and sizes were considered to evaluate performance in terms of the predictive ability (PA) and the mean square error (MSE) for a fixed testing set size. The training set size ranged from 52 to 112 to predict a fixed set of 224 unobserved genotypes across all three environments. The results showed that the model accounting for G×E interaction consistently presented the highest PA and the lowest MSE: for CNN (PA: ~0.77, MSE: ~0.5) and YDY (PA: ~0.70, MSE: ~1.3) while for TCM and AIL these ranged from ~0.28 to 0.41 and ~1.3 to 4.3, respectively. Overall, varying training sets and allocation strategies did not affect PA and MSE, with 52 non-overlapping and 0 overlapping genotypes per environment as the optimal cost-effective allocation framework. This suggests that implementing sparse testing designs could significantly reduce phenotyping costs by fivefold, without compromising PA in breeding programs for perennial crops such as Miscanthus.

Miscanthus sacchariflorus (MSA)↗

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↗