Search NASA⌕ Search

SEARCH · Search NASA

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 577 records · Page 32

The role of service areas in the optimization of FSS orbital and frequency assignments

A relationship is derived, on a single-entry interference basis, for the minimum allowable spacing between two satellites as a function of electrical parameters and service-area geometries. For circular beams, universal curves relate the topocentric satellite spacing angle to the service-area separation angle measured at the satellite. The corresponding geocentric spacing depends only weakly on the mean longitude of the two satellites, and this is true also for alliptical antenna beams. As a consequence, if frequency channels are preassigned, the orbital assignment synthesis of a satellite system can be formulated as a mixed-integer programming (MIP) problem or approximated by a linear programming (LP) problem, with the interference protection requirements enforced by constraints while some linear function is optimized. Possible objective-function choices are discussed and explicit formulations are presented for the choice of the sum of the absolute deviations of the orbital locations from some prescribed ideal location set. A test problem is posed consisting of six service areas, each served by one satellite, all using elliptical antenna beams and the same frequency channels. Numerical results are given for the three ideal location prescriptions for both the MIP and LP formulations. The resulting scenarios also satisfy reasonable aggregate interference protection requirements.

Levis, C. A.↗

Redesigning large-scale multimodal transit networks with shared autonomous mobility services

Here, this study addresses a large-scale multimodal transit network design problem, with Shared Autonomous Mobility Services (SAMS) as both transit feeders and an origin-to-destination mode. The framework captures spatial demand and modal characteristics, considers intermodal transfers and express services, determines transit infrastructure investment and path flows, and generates transit routes. A system-optimal multimodal transit network is designed with minimum total door-to-door generalized costs of users and operators, satisfying transit origin-destination demand within a pre-set infrastructure budget. Firstly, the geography, demand, and modes in each zone are characterized with continuous approximation. The decisions of network link investment and multimodal path flows in zonal connection optimization are formulated as a minimum-cost multi-commodity network flow (MCNF) problem and solved efficiently with a mixed-integer linear programming (MILP) solver. Subsequently, the route generation problem is solved by expanding the MCNF formulation to minimize intramodal transfers. The model is illustrated through a set of experiments with the Chicago network comprised of 50 zones and seven modes, under three scenarios. The computational results present savings in traveler journey time and operator cost demonstrating the potential benefits of collaboration between multimodal transit systems and SAMS.

Autonomous vehicles↗

A shared-mobility-based framework for evacuation planning and operations under forecast uncertainty

To meet evacuation needs from carless populations who need personalized assistance to evacuate safely, in this article we propose a ridesharing-based evacuation program that recruits volunteer drivers before a disaster strikes, and then matches volunteer drivers with evacuees once demand is realized. Here we optimize resource planning and evacuation operations under uncertain spatiotemporal demand, and construct a two-stage stochastic mixed-integer program to ensure high demand fulfillment rates. We consider three formulations to improve the number of evacuees served, by minimizing an expected penalty cost, imposing a probabilistic constraint, and enforcing a constraint on the conditional value at risk of the total number of unserved evacuees, respectively. We discuss the benefits and disadvantages of the different risk measures used in the three formulations, given certain carless population sizes and the variety of evacuation modes available. We also develop a heuristic approach to provide quick, dynamic and conservative solutions. We demonstrate the performance of our approaches using five different networks of varying sizes based on regions of Charleston County, South Carolina, an area that experienced a mandatory evacuation order during Hurricane Florence, and utilize real demographic data and hourly traffic count data to estimate the demand distribution.

97 MATHEMATICS AND COMPUTING↗

A Parallel Algorithm for the Vehicle Routing Problem

The vehicle routing problem (VRP) is a dicult and well-studied combinatorial optimization problem. We develop a parallel algorithm for the VRP that combines a heuristic local search improvement procedure with integer programming. We run our parallel algorithm with as many as 129 processors and are able to quickly nd high-quality solutions to standard benchmark problems. We assess the impact of parallelism by analyzing our procedure's performance under a number of dierent scenarios.

Groer, Christopher S↗

Community Microgrid Scheduling Considering Network Operational Constraints and Building Thermal Dynamics

Here, this paper proposes a Mixed Integer Conic Programming (MICP) model for community microgrids considering the network operational constraints and building thermal dynamics. The proposed optimization model optimizes not only the operating cost, including fuel cost, purchasing cost, battery degradation cost, voluntary load shedding cost and the cost associated with customer discomfort due to room temperature deviation from the set point, but also several performance indices, including voltage deviation, network power loss and power factor at the Point of Common Coupling (PCC). In particular, the detailed thermal dynamic model of buildings is integrated into the distribution optimal power flow (D-OPF) model for the optimal operation of community microgrids. The heating, ventilation and air-conditioning (HVAC) systems can be scheduled intelligently to reduce the electricity cost while maintaining the indoor temperature in the comfort range set by customers. Numerical simulation results show the effectiveness of the proposed model and significant saving in electricity cost could be achieved with network operational constraints satisfied.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Electric Grid Expansion Planning with High Levels of Variable Generation

Renewables are taking a large proportion of generation capacity in U.S. power grids. As their randomness has increasing influence on power system operation, it is necessary to consider their impact on system expansion planning. To this end, this project studies the generation and transmission expansion co-optimization problem of the US Eastern Interconnection (EI) power grid with a high wind power penetration rate. In this project, the generation and transmission expansion problem for the EI system is modeled as a mixed-integer programming (MIP) problem. This study analyzed a time series creation method to capture the diversity of load and wind power across balancing regions in the EI system. The obtained time series can be easily introduced into the MIP co-optimization problem and then solved robustly through available MIP solvers. Simulation results show that the proposed time series generation method and the expansion co-optimization model and can improve the expansion result significantly after considering the diversity of wind and load across EI regions. The improved expansion plan that combines generation and transmission will aid system planners and policy makers to maximize the social welfare. This study shows that modelling load and wind variations and diversities across balancing regions will produce significantly different expansion result compared with former studies. For example, if wind is modeled in more details (by increasing the number of wind output levels) so that more wind blocks are considered in expansion planning, transmission expansion will be larger and the expansion timing will be earlier. Regarding generation expansion, more wind scenarios will slightly reduce wind generation expansion in the EI system and increase the expansion of other generation such as gas. Also, adopting detailed wind scenarios will reveal that it may be uneconomic to expand transmission networks for transmitting a large amount of wind power through a long distance in the EI system. Incorporating more details of renewables in expansion planning will inevitably increase the computational burden. Therefore, high performance computing (HPC) techniques are urgently needed for power system operation and planning optimization. As a scoping study task, this project tested some preliminary parallel computation techniques such as breaking down the simulation task into several sub-tasks based on chronology splitting or sample splitting, and then assigning these sub-tasks to different cores. Testing results show significant time reduction when a simulation task is split into several sub-tasks for parallel execution.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Qualitative trend analysis based on a mixed-integer representation

Shape constrained spline fitting is a useful method to impose prior knowledge onto flexible semi-parametric models during parameter estimation. Most typically, the function shape is imposed through order restrictions on the regression coefficients. The intended shape is considered known or selected based on heuristic rules. In this study, we present a method to estimate the optimal set of order restrictions to segment a univariate data series into episodes with distinct shapes. This is also known as the qualitative trend analysis (QTA) problem. The obtained solution uses a trade-off between lack-of-fit and model complexity. Further, our practical implementation takes inspiration from the generalized order restricted information criterion (GORIC) for inequality-constrained model selection. From this, one learns (a) that QTA can be formulated as a mixed-integer quadratic program (MIQP) and (b) that the newly proposed mixed order restricted information criterion (MORIC) enables optimal segmentation. This is illustrated through didactic case studies.

42 ENGINEERING↗

Model Predictive Control of Discrete-Continuous Energy Systems via Generalized Disjunctive Programming

Generalized Disjunctive Programming (GDP) provides an alternative framework to model optimization problems with both discrete and continuous variables. The key idea behind GDP involves the use of logical disjunctions to represent discrete decisions in the continuous space, and logical propositions to denote algebraic constraints in the discrete space. Compared to traditional mixed-integer programming (MIP), the inherent logic structure in GDP yields tighter relaxations that are exploited by global branch and bound algorithms to improve solution quality. In this paper, we present a general GDP model for optimal control of hybrid systems that exhibit both discrete and continuous dynamics. Specifically, we use GDP to formulate a model predictive control (MPC) model for piecewise-affine systems with implicit switching logic. As an example, the GDP-based MPC approach is used as a supervisory control to improve energy efficiency in residential buildings with binary on/off, relay-based thermostats. A simulation study is used to demonstrate the validity of the proposed approach, and the improved solution quality compared to existing MIPbased control approaches.

Bhattacharya, Arnab↗

The Capability Portfolio Analysis Tool (CPAT): A Mixed Integer Linear Programming Formulation for Fleet Modernization Analysis.

In order to effectively plan the management and modernization of its large and diverse fleet of vehicles, the Program Executive Office Ground Combat Systems (PEO GCS) commissioned the development of a large-scale portfolio planning optimization tool. This software, the Capability Portfolio Analysis Tool (CPAT), creates a detailed schedule that optimally prioritizes the modernization or replacement of vehicles within the fleet - respecting numerous business rules associated with fleet structure, budgets, industrial base, research and testing, etc., while maximizing overall fleet performance through time. This paper contains a thorough documentation of the terminology, parameters, variables, and constraints that comprise the fleet management mixed integer linear programming (MILP) mathematical formulation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Joint optimization of electric bus charging infrastructure, vehicle scheduling, and charging management

High upfront costs of vehicles and charging infrastructure as well as the lack of knowledge related to infrastructure planning and electric bus system operation are major obstacles to the implementation of battery electric buses (BEBs). To tackle the obstacles and promote BEB adoption, a comprehensive optimization framework was developed to address the combined charging infrastructure planning, vehicle scheduling, and charging management problem for BEB systems, with the goal to minimize the total cost of ownership. The problem was formulated as a mixed-integer non-linear problem. A genetic algorithm-based approach was then proposed to solve the problem. Last, three alternative scenarios based on a sub-transit network in Salt Lake City, Utah, were analyzed and compared with the optimal scenario results in the numerical experiments. Our comparison results demonstrate the effectiveness of the proposed model and solution algorithm in determining a cost-efficient planning strategy for BEB systems.

33 ADVANCED PROPULSION SYSTEMS↗

A Stochastic Programming Formulation for Disinfectant Booster Station Placement to Protect Large-Scale Water Distribution Networks

We introduce a methodology for optimally locating fixed disinfectant booster stations for response to contamination incidents in water distribution networks. In this work a stochastic programming problem considering uncertainty in both the location and time of the contamination incident is formulated, resulting in a large Mixed Integer Linear Programming problem. While the original full-space problem is intractably large, we show a series of reductions that decrease the size of the problem by up to five orders of magnitude and allow solutions of the optimal placement problem for realistically-sized water network models.

42 ENGINEERING↗

An efficient level set method for tracking many materials

Here, we present an efficient level set method to track an arbitrary number of materials. The algorithm is optimal in the sense that it only needs to store a single unsigned distance-like function and a single integer indicator function, independent of the number of materials or distinct regions being tracked. Furthermore, for smooth velocity fields and smooth interface shape, arbitrarily high order solutions can be demonstrated. For interfaces that are or become kinked, the solution is limited to second-order convergence rates in the L 1 norm and first-order in the L ∞ norm.

97 MATHEMATICS AND COMPUTING↗

Intrinsic even-odd thickness-driven anomalous Hall effect in epitaxial MnBi2⁢Te4 thin films

We demonstrate precise control of magnetism in MnBi2⁢Te4 thin films through careful synthesis by molecular beam epitaxy, achieving minimal defects and accurate layer thickness control. By optimizing Mn-Bi-Te ratios and growth temperatures, we minimize detrimental self-doping effects and accurately target integer-layer films. X-ray diffraction and reflectivity provide quantitative measures of film quality and thickness. When these macroscale probes of structure and thickness are integrated with magnetotransport measurements, a striking even-odd layer dependence of the anomalous Hall effect is revealed. Odd-layer films exhibit a large hysteresis up to the Néel temperature (∼25K), consistent with noncompensated antiferromagnetism, while even-layer films show minimal response, as expected for an antiferromagnet. The sign of the anomalous Hall effect exhibits a sign reversal for intrinsic magnetism versus magnetism associated with defects. This work identifies critical factors for inducing pure, noncompensated ferromagnetism and reveals the characteristics of the intrinsic anomalous Hall effect in MnBi2⁢Te4, which together is a step toward realizing the zero-field quantum anomalous Hall effect in topological materials.

Mallick, Deb [ORNL] (ORCID:000900005806411X)↗

The allocation of a variable series reactor considering AC constraints and contingencies

The Variable Series Reactors (VSRs) can efficiently control the power flow through the adjustment of the line reactance. When they are appropriately allocated in the power network, the transmission congestion and generation cost can be reduced. Our work proposes a planning model to optimally allocate VSRs considering AC constraints and multi-scenarios including base case and contingencies. The planning model is originally a non-convex large scale mixed integer nonlinear program (MINLP), which is generally intractable. The proposed Benders approach decomposes the MINLP model into a mixed integer linear program (MILP) master problem and a number of nonlinear subproblems. Numerical case studies based on IEEE 118-bus demonstrate the high performance of the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Data-driven simultaneous process optimization and adsorbent selection for vacuum pressure swing adsorption

Technologies for post-combustion carbon capture are essential for the reduction of greenhouse gas emissions to the atmosphere. However, they are still associated with high costs and energy consumption. Intensified processes for carbon capture have the potential to overcome these challenges due to their higher efficiency, lower capital cost, and increased operational flexibility. Here, this work investigates simultaneous optimization of process conditions and adsorbent selection for a modular Vacuum Pressure-Swing Adsorption system designed for CO 2 capture. Both surrogate-based Nonlinear Programming and Mixed-Integer Nonlinear Programming approaches are applied and compared in terms of computational efficiency and solution accuracy. Moreover, process performance results are examined by applying several data analytics techniques to gain insights into the material-process correlations. Data-driven classifiers and neural networks can accurately predict whether a material is likely to satisfy purity, recovery, and energy constraints when operated at optimal process conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

pyomo.dae: a modeling and automatic discretization framework for optimization with differential and algebraic equations

We describe pyomo.dae, an open source Python-based modeling framework that enables high-level abstract specification of optimization problems with differential and algebraic equations. The pyomo.dae framework is integrated with the Pyomo open source algebraic modeling language, and is available at http://www.pyomo.org. One key feature of pyomo.dae is that it does not restrict users to standard, predefined forms of differential equations, providing a high degree of modeling flexibility and the ability to express constraints that cannot be easily specified in other modeling frameworks. Other key features of pyomo.dae are the ability to specify optimization problems with high-order differential equations and partial differential equations, defined on restricted domain types, and the ability to automatically transform high-level abstract models into finite-dimensional algebraic problems that can be solved with off-the-shelf solvers. Moreover, pyomo.dae users can leverage existing capabilities of Pyomo to embed differential equation models within stochastic and integer programming models and mathematical programs with equilibrium constraint formulations. Collectively, these features enable the exploration of new modeling concepts, discretization schemes, and the benchmarking of state-of-the-art optimization solvers.

97 MATHEMATICS AND COMPUTING↗