High-performance optimization solver
HIOP is a HPC solver for solving certain optimization problems arising in mathematical optimization of systems described by partial-differential equations (POEs).
SEARCH · Engineering Papers
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.
HIOP is a HPC solver for solving certain optimization problems arising in mathematical optimization of systems described by partial-differential equations (POEs).
DERMS-RT provides a distributed energy resource management solution using real-time optimization to control different types of distributed energy resources (DERs) — such as rooftop PVs, battery energy storage systems, HVAC loads, electric water heater loads, and EV charging loads, and use these DERs to provide distribution voltage regulation and peak demand management services. The control approach implemented by DERM-RT is developed based on the real-time optimal power flow and distributed control previously developed by NREL researchers. The software codes are designed to provide modular DER management solution that can be easily applied to control heterogeneous DERs in distribution grids in coordination with centralized utility management systems. Also, DERMS-RT provides application programming interface (API) to extract useful grid model information from an open-source power system simulation software, use the information to solve the optimization problem, and apply the optimal set-points to the controlled DERs. In this way, DERMS-RT provides a plug-and-play function for implementing the real-time DER control on different utility system models, and it can be used as a simulation testbed to demonstrate the impact of real-time DER optimization on improving grid operations.
Background: The maximum clique enumeration (MCE) problem asks that we identify all maximum cliques in a finite, simple graph. MCE is closely related to two other well-known and widely-studied problems: the maximum clique optimization problem, which asks us to determine the size of a largest clique, and the maximal clique enumeration problem, which asks that we compile a listing of all maximal cliques. Naturally, these three problems are N P -hard, given that they subsume the classic version of the N P -complete clique decision problem. MCE can be solved in principle with standard enumeration methods due to Bron, Kerbosch, Kose and others. Unfortunately, these techniques are ill-suited to graphs encountered in our applications. We must solve MCE on instances deeply seeded in data mining and computational biology, where high-throughput data capture often creates graphs of extreme size and density. MCE can also be solved in principle using more modern algorithms based in part on vertex cover and the theory of fixed-parameter tractability (FPT). While FPT is an improvement, these algorithms too can fail to scale sufficiently well as the sizes and densities of our datasets grow. Results: An extensive testbed of benchmark graphs are created using publicly available transcriptomic datasets from the Gene Expression Omnibus (GEO). Empirical testing reveals crucial but latent features of such high-throughput biological data. In turn, it is shown that these features distinguish real data from random data intended to reproduce salient topological features. In particular, with real data there tends to be an unusually high degree of maximum clique overlap. Armed with this knowledge, novel decomposition strategies are tuned to the data and coupled with the best FPT MCE implementations. Conclusions: Several algorithmic improvements to MCE are made which progressively decrease the run time on graphs in the testbed. Frequently the final runtime improvement is several orders of magnitude. As a result, instances which were once prohibitively time-consuming to solve are brought into the domain of realistic feasibility.
Abstract not provided.
The overarching goal is to improve quantum algorithms for the simulation of quantum systems.
Explore the source record for details and available documents.
Abstract not provided.
Platooning allows vehicles to travel with a small intervehicle distance in a coordinated fashion because of vehicle-to-vehicle connectivity. When applied at a larger scale, platooning creates significant opportunities for energy savings because of reduced aerodynamic drag, as well as increased road capacity and a reduction in congestion resulting from shorter vehicle headways. These potential savings are maximized, however, if platooning-capable vehicles spend most of their travel time within platoons. Ad hoc platoon formation may not ensure a high rate of platoon driving. This paper considers here the problem of central coordination of platooning-capable vehicles. Coordination of their routes and departure times can maximize the fuel savings afforded by platooning vehicles. The resulting problem is a combinatorial optimization problem that considers the platoon coordination and vehicle routing problems simultaneously. The methodology is demonstrated through evaluation of the benefits of a coordinated solution and comparison with the uncoordinated case when platoons form only in an ad hoc manner. The coordinated and uncoordinated scenarios are compared on a grid network with various assumptions about demand and the time vehicles are willing to wait.
Optimal rocket flight in gravitation field
Optimal rocket flight in gravitational field using lawdens results on intermediate thrust subarcs
Trajectory physics optimization for boundary value problem solution
Analytical approaches to path-adaptive guidance functions, circular orbit trajectories, and use of Fortran-compiled programs
Differential equations for governing motion of vehicle in uniform gravitational fields
Optimal sandwich structure design for stiffness, natural frequency, buckling load and safety through plasticity
Optimal sandwich structure design for stiffness, natural frequency, buckling load and safety through plasticity
Explore the source record for details and available documents.
Transforming optical control problem into equivalent Lagrange problem in calculus of variations
Optimal strategy for searching for object hidden in box involving use of optimal return function