Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Integer Optimization”

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 271 records · Page 15

Evaluating Nationwide Supply Chain for Circularity of PET and Olefin Plastics

PET (Polyethylene Terephthalate, #1) and olefin plastics including HDPE (High Density Polyethylene, #2), LDPE/LLDPE (Low Density/Linear Low-Density Polyethylene, #4) and PP (Polypropylene, #5) together comprise nearly 80% of the U.S. plastic market. Due to their high market share and extensive application in packaging these polymers have better potential for circularity than other polymer types. To understand the potential of future scenarios with higher recycling rates, supply chain scenarios for PET and olefin plastic packaging need to be analyzed with increased availability and collection of plastics. Currently there exists a knowledge gap to understand the circular supply chain on a national level. Performing a nationwide analysis introduces certain challenges such as variability in the plastic mix of the recycling stream in different municipalities, lack of collection of some types of plastics, regional differences in cost and estimating a national supply curve based on state level access rate and participation rate. Currently, a limited number of Plastic Reclaimers recycle the nation’s collected plastic involving transportation over long distances surpassing state boundaries. Modeling a nationwide scenario instead of regional/state based scenario will facilitate transportation beyond state boundaries for the development of a circular economy. A Mixed-integer Linear Programming model was developed, to identify the optimal location and capacity of the Material Recovery Facilities (MRFs) nationwide subject to maximizing the profit margin of the industrial entities within the model. We considered three different scenarios including the base case scenario (S1) collecting 2.27 million metric tons/year as well as two additional scenarios with available plastic supply of 1.8 times (S2) and 2.2 times (S3) of the base case scenario. The model identified 166, 275 and 319 counties as potential MRF locations for scenarios S1, S2 and S3 respectively. Compared to the existing number of counties having MRFs in the US, the model results indicated a reduction of 38% of MRFs for S1. For S2 and S3, the number of counties with MRFs increased 3% and 20% respectively compared to counties currently with MRFs. The average profit remains constant between $180-$181/ton regardless of the increased plastic collection.

54 - ENVIRONMENTAL SCIENCES/GLOBAL CLIMATE CHANGE ↗

Co-Optimization of Velocity and Charge-Depletion for Plug-In Hybrid Electric Vehicles: Accounting for Acceleration and Jerk Constraints

Abstract Recent advances in vehicle connectivity and automation technologies promote advanced control algorithms that co-optimize the longitudinal dynamics and powertrain operation of hybrid electric vehicles. Typically, a sequential optimization with the vehicle dynamics optimized followed by powertrain optimization is adopted to manage a number of complexities such as the inherent mixed-integer nature of the hybrid powertrain, the numerous state and control variables, the differing time scales of vehicle and powertrain subsystems, time-varying state constraints, and large horizon lengths. Instead, we solve the offline optimization problem in a centralize manner assuming exact knowledge of the lead vehicle's position over the entire trip by applying a discrete-time single shooting-based numerical approach, Discrete Mixed-Integer Shooting (DMIS), including a linearly increasing computational complexity to the problem horizon. In particular, the hierarchical problem structure is exploited to decompose the computationally intensive Hamiltonian minimization step into a set of low-dimensional optimizations. DMIS allows us to compute the direct fuel minimization problem including the vehicle and powertrain dynamics in a centralized manner to its full horizon while systematically tuning weighting factors that penalize passenger discomfort. For the first time, this study reveals that practically implemented sequential optimization exhibits similar fuel optimality as co-optimization when a certain level of passenger comfort is required.

Automation & Control Systems↗

A Bell-Curved Based Algorithm for Mixed Continuous and Discrete Structural Optimization

An evolutionary based strategy utilizing two normal distributions to generate children is developed to solve mixed integer nonlinear programming problems. This Bell-Curve Based (BCB) evolutionary algorithm is similar in spirit to (mu + mu) evolutionary strategies and evolutionary programs but with fewer parameters to adjust and no mechanism for self adaptation. First, a new version of BCB to solve purely discrete optimization problems is described and its performance tested against a tabu search code for an actuator placement problem. Next, the performance of a combined version of discrete and continuous BCB is tested on 2-dimensional shape problems and on a minimum weight hub design problem. In the latter case the discrete portion is the choice of the underlying beam shape (I, triangular, circular, rectangular, or U).

Kincaid, Rex K.↗

Grid Optimization Competition on Synthetic and Industrial Power Systems

This paper summarizes a grid optimization (GO) competition effort in the United States to find the best solution strategies for up to interconnect-scale power system networks with around 32,000 buses. The optimization problem is a mixedinteger, non-convex non-linear problem, (MINLP) and includes discrete variables such as unit commitment and line switching, control settings (transformer taps and phase shifters with impedance correction tables), and bus shunts. The case study includes six actual industry grids as well as 16 realistic synthetic grids created by three different dataset teams. The winners are selected and ranked based on scoring criteria, which consider the solution quality (such as objective functions) within time limits. Nine winner teams are selected from 26 competitor teams. The results achieved by different teams are described and the performance of different algorithms on synthetic grids and actual industry grids are compared and analyzed.

mixed-integer non-linear programming↗

Hybrid Parameter Search and Dynamic Model Selection for Mixed-Variable Bayesian Optimization

Herein this article presents a new type of hybrid model for Bayesian optimization (BO) adept at managing mixed variables, encompassing both quantitative (continuous and integer) and qualitative (categorical) types. Our proposed new hybrid models (named hybridM) merge the Monte Carlo Tree Search structure (MCTS) for categorical variables with Gaussian Processes (GP) for continuous ones. hybridM leverages the upper confidence bound tree search (UCTS) for MCTS strategy, showcasing the tree architecture’s integration into Bayesian optimization. Our innovations, including dynamic online kernel selection in the surrogate modeling phase and a unique UCTS search strategy, position our hybrid models as an advancement in mixed-variable surrogate models. Numerical experiments underscore the superiority of hybrid models, highlighting their potential in Bayesian optimization.

97 MATHEMATICS AND COMPUTING↗

Vehicle-to-manufacturing (V2M) system: A novel approach to improve energy demand flexibility for demand response towards sustainable manufacturing

The U.S. manufacturing sector accounts for 77% of the industrial energy consumption, but its participation in demand response (DR) programs is largely lagged behind. The limited flexibility in production scheduling under high capacity utilization and the lack of DR schemes that incorporate energy demand flexibility measures are deemed as major barriers. In this study, a framework of the interactive vehicles-to-manufacturing (V2M) energy sharing system is proposed to improve the energy demand flexibility of the aggregated system and enhance the DR effectiveness for manufacturers. The V2M-based DR scheme aims to reduce the energy cost by load shifting through joint production and energy sharing control, which can eventually promote manufacturing DR implementation even under high capacity utilization requirements and dynamic real-time electricity prices. The V2M system is modeled based on a discrete-Markov chain considering the complex interconnections among various manufacturing resources and multi-directional energy flows among manufacturing facilities, electric vehicles, and the power grid. Based on the system model, a mixed-integer nonlinear programming (MINLP) problem is formulated to identify the optimal DR scheme. The effectiveness of the proposed approach is validated through comparisons with traditional manufacturing DR schemes. Finally, the results show that a 2.1 to 6.5 times energy demand flexibility improvement and an additional 4.7% to 6.9% energy cost reduction can be achieved by the proposed approach.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Computational Analysis of Cryogenic Flow Through a Control Valve

The initial efforts to develop the capability to model valves used in rocket engine component testing at Stennis Space Center are documented. An axisymmetric model of a control valve with LN2 as the working fluid was developed. The goal was to predict the effect of change in the plug/sear region of the valve prior to testing. The valve flow coefficient was predicted for a range of plug positions. Verification of the calculations was carried out to quantify the uncertainty in the numerical answer. The modeled results compared well qualitatively to experimental trends. Additionally, insights into the flow processes in the valve were obtained. Benefits from the verification process included the ability to use coarser grids and insight into ways to reduce computational time by using double precision accuracy and non-integer grid ratios. Future valve modeling activities will include shape optimization of the valve/seat region and dynamic grid modeling.

Danes, Russell↗

A systems engineering framework for the optimization of food supply chains under circular economy considerations

The current linear “take-make-waste-extractive” model leads to the depletion of natural resources and environmental degradation. Circular Economy (CE) aims to address these impacts by building supply chains that are restorative, regenerative, and environmentally benign. This can be achieved through the re-utilization of products and materials, the extensive usage of renewable energy sources, and ultimately by closing any open material loops. Such a transition towards environmental, economic and social advancements requires analytical tools for quantitative evaluation of the alternative pathways. Here, in this work, we present a novel CE system engineering framework and decision-making tool for the modeling and optimization of food supply chains. First, the alternative pathways for the production of the desired product and the valorization of wastes and by-products are identified. Then, a Resource-Task-Network representation that captures all these pathways is utilized, based on which a mixed-integer linear programming model is developed. This approach allows the holistic modeling and optimization of the entire food supply chain, taking into account any of its special characteristics, potential constraints as well as different objectives. Considering that typically CE introduces multiple, often conflicting objectives, we deploy here a multi-objective optimization strategy for trade-off analysis. A representative case study for the supply chain of coffee is discussed, illustrating the steps and the applicability of the framework. Single and multi-objective optimization formulations under five different coffee-product demand scenarios are presented. The production of instant coffee as the only final product is shown to be the least energy and environmental efficient scenario. On the contrary, the production solely of whole beans sets a hypothetical upper bound on the optimal energy and environmental utilization. In both problems presented, the amount of energy generated is significant due to the utilization of waste generated for the production of excess energy.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Relaxations of the steady optimal gas flow problem for a non-Ideal gas

Natural gas ranks second in U.S. primary energy consumption. Because most production sites are remote, gas must be transported through pipeline networks equipped with compressors, valves, and other components. For both economic efficiency and system reliability, it is desirable to operate these networks optimally. The governing physics across pipeline components entails nonlinear, non-convex equality and inequality constraints, and the most general steady-flow operations problem is a Mixed-Integer Nonlinear Program (MINLP).This work focuses on one such steady-flow problem-the Optimal Gas Flow (OGF) for a natural gas pipeline network-which minimizes production cost subject to the steady-flow physics. For day-to-day operations, the ability to quickly compute a globally optimal solution and a strong lower bound for varying demand profiles is crucial. A promising strategy is to build tight relaxations of the OGF’s nonlinear constraints. However, many nonlinearities arising from non-ideal equations of state either lack relaxations or have relaxations that do not scale to realistic network sizes. We address this gap by combining recent advances in polyhedral relaxations for univariate functions to construct tight, computationally efficient relaxations of the OGF with a non-ideal equation of state. These relaxations solve within seconds on a standard laptop. In conclusion, we demonstrate their quality through extensive numerical experiments on very large-scale test networks from the literature and find that the proposed approach proves optimality in 92% of tested instances.

03 NATURAL GAS↗

Multi-objective sizing and dispatch for building thermal and battery storage towards economic and environmental synergy

The role of building thermal and battery storage is pivotal in advancing smart cities and achieving sustainability goals through effective energy management. Despite their significance, there are several limitations in the sizing approach and value stream analysis with various objectives for their widespread adoption in buildings. This work proposes a flexible and scalable multi-objective optimization framework for optimal sizing and dispatch of building thermal and battery storage, addressing conflicting objectives simultaneously using mixed-integer linear programming. The weighted-sum method is adapted, combining multiple objectives into a single function. The two-stage procedure iterates over different weights, generating optimal solutions and forming the Pareto front. Case studies are performed to assess the energy, economic, and environmental benefits of building energy storage systems for a large office building in three climate locations. The results demonstrate that the proposed framework efficiently determines optimal sizing and dispatch strategies, addressing the balance between economic viability and emission reduction. The dynamic relationship between time-of-use energy charges and emission factors leads to significantly different strategies based on whether economic or environmental concerns are prioritized. This research enhances our understanding of the benefits of TES and BES systems in buildings, providing valuable guidance to stakeholders.

25 ENERGY STORAGE↗

Evaluation of Horizon of Viability Optimization Engine for Sustained Power to Critical Infrastructure: Preprint

In the aftermath of increasingly frequent catastrophic events, a typical scenario is Critical Infrastructure (CI) units being supported by available backup sources with a weak power grid that can be intermittent or absent. Such a scenario is significantly challenging in the sense of reliable supply of power to CI units. In this article, an intelligent optimization scheme termed as Horizon of Viability (HoV) engine is developed to guarantee the viability of a sustained reliable supply of power to the CI units over a time-horizon. The proposed HoV engine generates a cost-optimal portfolio of the locally available generation sources and the loads over a time horizon using a mixed-integer convex programming problem. A Controller hardware-in-the-loop (CHIL) platform is developed to evaluate the control performance of the HoV engine. The experimental results corroborates the efficacy in maintaining the viability of the CI units after a grid interruption event. Further, the proposed HoV optimization scheme performs better compared to existing net-load management schemes in the literature.

disaster resiliency↗

An MILP-Based Distributed Energy Management for Coordination of Networked Microgrids

An MILP-based distributed energy management for the coordination of networked microgrids is proposed in this paper. Multiple microgrids and the utility grid are coordinated through iteratively adjusted price signals. Based on the price signals received, the microgrid controllers (MCs) and distribution management system (DMS) update their schedules separately. Then, the price signals are updated according to the generation–load mismatch and distributed to MCs and DMS for the next iteration. The iteration continues until the generation–load mismatch is small enough, i.e., the generation and load are balanced under agreed price signals. Through the proposed distributed energy management, various microgrids and the utility grid with different economic, resilient, emission and socio-economic objectives are coordinated with generation–load balance guaranteed and the microgrid customers’ privacy preserved. In particular, a piecewise linearization technique is employed to approximate the augmented Lagrange term in the alternating direction method of multipliers (ADMM) algorithm. Thus, the subproblems are transformed into mixed integer linear programming (MILP) problems and efficiently solved by open-source MILP solvers, which would accelerate the adoption and deployment of microgrids and promote clean energy. The proposed MILP-based distributed energy management is demonstrated through various case studies on a networked microgrids test system with three microgrids.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Revenue prediction for integrated renewable energy and energy storage system using machine learning techniques

Revenue estimation for integrated renewable energy and energy storage systems is important to support plant owners or operators’ decisions in battery sizing selection that leads to maximized financial performances. A common approach to optimizing revenues of a hybrid hydro and energy storage system is using mixed-integer linear programming (MILP). Although MILP models can provide accurate production cost estimations, they are typically very computationally expensive. To provide a fast yet accurate first-step information to hydropower plant owners or operators who consider integrating energy storage systems, we propose an innovative approach to predicting optimal revenues of an integrated energy generation and storage system. In this study, we examined the performance of two prediction techniques: Generalized Additive Models (GAMs) and machine learning (ML) models developed based on artificial neural networks (ANN). Predictive equations and models are generated based on optimized solutions from a market participation optimization model, the Conventional Hydropower Energy and Environmental Resource System (CHEERS) model. The two predicting techniques reduce the computational time to evaluate annual revenue for one set of battery configurations from 3 h to 1 to 4 min per run while also being implementable with significantly less data. The model validation prediction errors of developed GAMs and ML models are generally below 5%; for model testing predictions, the ML models consistently outperform the regression equations in terms of root mean square errors. This new approach allows plant owners, operators, or potential investors to quickly access multiple battery configurations under different energy generation and market scenarios. This new revenue prediction method will therefore help reduce the barriers, and thereby promoting the deployment of battery hybridization with existing renewable energy sources.

13 HYDRO ENERGY↗

Disjunctive linear separation conditions and mixed-integer formulations for aircraft conflict resolution

In this paper, we address the aircraft conflict resolution problem in air traffic control. We introduce new mixed-integer programming formulations for aircraft conflict resolution with speed, heading and altitude control which are based on disjunctive linear separation conditions. We first examine the two-dimensional aircraft conflict resolution problem with speed and heading control represented as continuous decision variables. We show that the proposed disjunctive linear separation conditions are equivalent to the classical nonlinear conditions for aircraft separation. Further, we characterise conflict-free trajectories based on aircraft velocity bounds and propose a simple pre-processing algorithm to identify aircraft pairs which are either always conflict-free, or which cannot be separated using speed and heading control only. We then incorporate altitude control and propose a lexicographic optimisation formulation that aims to minimise the number of flight level changes before resolving outstanding conflicts via two-dimensional velocity control. The proposed mixed-integer programming formulations are nonconvex, and we propose convex relaxations, decomposition methods and constraint generation algorithms to solve the two-dimensional and lexicographic optimisation formulations to guaranteed optimality. Numerical experiments on four types of conflict resolution benchmarking instances are conducted to test the performance of the proposed mixed-integer formulations. Further, the proposed method is compared against two benchmarks based on state-of-the-art approaches for the aircraft conflict resolution problem. Our numerical results show that the proposed method largely outperforms both benchmarks in terms of runtime and is able to solve significantly more instances to global optimality.

97 MATHEMATICS AND COMPUTING↗

Novel Geometric Operations for Linear Programming

This report summarizes the work performed under the project "Linear Programming in Strongly Polynomial Time." Linear programming (LP) is a classic combinatorial optimization problem heavily used directly and as an enabling subroutine in integer programming (IP). Specifically IP is the same as LP except that some solution variables must take integer values (e.g. to represent yes/no decisions). Together LP and IP have many applications in resource allocation including general logistics, and infrastructure design and vulnerability analysis. The project was motivated by the PI's recent success developing methods to efficiently sample Voronoi vertices (essentially finding nearest neighbors in high-dimensional point sets) in arbitrary dimension. His method seems applicable to exploring the high-dimensional convex feasible space of an LP problem. Although the project did not provably find a strongly-polynomial algorithm, it explored multiple algorithm classes. The new medial simplex algorithms may still lead to solvers with improved provable complexity. We describe medial simplex algorithms and some relevant structural/complexity results. We also designed a novel parallel LP algorithm based on our geometric insights and implemented it in the Spoke-LP code. A major part of the computational step is many independent vector dot products. Our parallel algorithm distributes the problem constraints across processors. Current commercial and high-quality free LP solvers require all problem details to fit onto a single processor or multicore. Our new algorithm might enable the solution of problems too large for any current LP solvers. We describe our new algorithm, give preliminary proof-of-concept experiments, and describe a new generator for arbitrarily large LP instances.

97 MATHEMATICS AND COMPUTING↗

SMEX-Lite Modular Solar Array Architecture

For the most part, Goddard solar arrays have been custom designs that are unique to each mission. The solar panel design has been frozen prior to issuing an RFP for their procurement. There has typically been 6-9 months between RFP release and contract award, followed by an additional 24 months for performance of the contract. For Small Explorer (SMEX) missions, with three years between mission definition and launch, this has been a significant problem. The SMEX solar panels have been sufficiently small that the contract performance period has been reduced to 12-15 months. The bulk of this time is used up in the final design definition and fabrication of flight solar cell assemblies. Even so, it has been virtually impossible to have the spacecraft design at a level of maturity sufficient to freeze the solar panel geometry and release the RFP in time to avoid schedule problems with integrating the solar panels to the spacecraft. With that in mind, the SMEX-Lite project team developed a modular architecture for the assembly of solar arrays to greatly reduce the cost and schedule associated with the development of a mission- specific solar array. In the modular architecture, solar cells are fabricated onto small substrate panels. This modular panel (approximately 8.5" x 17" in this case) becomes the building block for constructing solar arrays for multiple missions with varying power requirements and geometrical arrangements. The mechanical framework that holds these modules together as a solar array is the only mission-unique design, changing in size and shape as required for each mission. There are several advantages to this approach. First, the typical solar array development cycle requires a mission unique design, procurement, and qualification including a custom qualification panel. With the modular architecture, a single qualification of the SMEX-Lite modules and the associated mechanical framework in a typical configuration provided a qualification by similarity to multiple missions. It then becomes possible to procure solar array modules in advance of mission definition and respond quickly and inexpensively to a selected mission's unique requirements. The solar array modular architecture allows the procurement of solar array modules before the array geometry has been frozen. This reduces the effect of procurement lead-time on the mission integration and test flow by as much as 50%. Second, by spreading the non-recurring costs over multiple missions, the cost per unit area is also reduced. In the case of the SMEX-Lite procurement, this reduction was by about one third of the cost per unit area compared to previous SMEX mission-unique procurements. Third, the modular architecture greatly facilitates the infusion of new solar cell technologies into flight programs as these technologies become available. New solar cell technologies need only be fabricated onto a standard-sized module to be incorporated into the next available mission. The modular solar array can be flown in a mixed configuration with some new and some standard cell technologies. Since each module has its own wiring terminals, the array can be arranged as desired electrically with little impact to cost and schedule. The solar array modular architecture does impose some additional constraints on systems and subsystem engineers. First, they must work with discrete solar array modules rather than size the array to fit exactly within an available envelope. The array area is constrained to an integer multiple of the module area. Second, the modular design is optimized for space radiation and thermal environments not greatly different from a typical SMEX LEO environment. For example, a mission with a highly elliptical orbit (e.g., Polar, SMEX/FAST) would require thicker coverglasses to protect the solar cells from the more intense radiation environment.

Lyons, John↗

Aerial drone fleet deployment optimization with endogenous battery replacements for direct delivery of time-sensitive products

Aerial drones offer a distinct potential to reduce the delivery time and energy consumption for the delivery of time-sensitive and small products. However, there is still a need in the relevant industry to understand the performance of drone-based delivery under different business needs and drone operating conditions. We studied a drone deployment optimization problem for direct delivery of time-sensitive products with release dates to customers maintaining a specified time window. This paper presents a new mixed-integer programming model, new valid inequalities, a new greedy heuristic algorithm, and a Genetic algorithm to help business owners optimally schedule and route their drone fleet minimizing the required fleet size, the required number of additional batteries, and total energy consumption. A realistic feature of the optimization method is that instead of replacing the drone battery after each return to the depot, it keeps track of the remaining energy in the drone battery and decides on battery replacements accounting for the drone routing and the user-specified minimum required battery energy. Numerical results based on real data from drone flight tests and prepared food delivery industry provide insights into the effect of different practical drone operating parameters on the required fleet size, the required number of battery replacements, and energy consumption. Here, results demonstrate that the proposed heuristic algorithm substantially outperforms the accelerated CPLEX in runtime while sacrificing the solution quality by a small amount. Additionally, results show that using a mixed fleet of hexacopter and quadcopter drones reduces the total energy consumption by 48.52% compared to using a homogeneous fleet of only hexacopters.

Drone energy consumption↗