Search NASA⌕ Search

SEARCH · Search NASA

Results for “solution 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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

MOOGLE: A Multi-Objective Optimization tool for three-dimensional nuclear fuel assembly design

MOOGLE is a new genetic algorithm methodology for the three-dimensional design of nuclear fuel assemblies. MOOGLE uses common fuel rod types as the decision variable to develop a suite of three-dimensional fuel assemblies to provide optimized solutions to the design problem. Pressurized Water Reactor (PWR) fuel assemblies were optimized using IFBA and gadolinium (Gd 2 O 3 ) as burnable poisons in order to compare how burnable poison choice affects optimization results. Boiling Water Reactor (BWR) fuel bundles were also optimized using three unique fuel rod palettes to study how the size of the design space affects optimization results. Burnable poison analysis showed that utilizing IFBA and Gd 2 O 3 as burnable poisons produced the best and widest range of optimized solutions. Further, BWR fuel bundle optimization results indicate that the inclusion of additional fuel rod types produced a wider solution space but did not improve optimization results for regions explored using fewer unique fuel rods. These tests demonstrate MOOGLE's ability to analyze the tradeoffs between the inclusion of different fuel elements and their effects on assembly performance.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2019

Integrated Solutions for Optimized Performance (ISOP) Final Technical Report

The goal of this project was to demonstrate technical feasibility of an integrated approach for deep energy retrofits by packaging innovative technologies with smart communicating controls that represent the next generation of energy efficiency. The integrated solutions for optimized performance (ISOP) package integrates (i) advanced lighting and plug load controls; (ii) intelligent daylight harvesting through automated self-powered shades and window films; (iii) advanced HVAC controls sequences (ASHRAE Guideline (GDL) 36); and (iv) fault detection and diagnosis (FDD) and continuous commissioning (CCx) using advanced analytics. These technologies address energy use across multiple building end uses that represent more than 60% of the energy consumption in all commercial buildings. The project was structured to be implemented over three budget periods: Budget Period 1 scope included site selection, project design, site-specific customization of technology packages, procurement of technologies, initiation of installation of technologies, the development of a measurement and verification plan and collection of pre-retrofit data collection. The first year go/no-go decision was based on securing host sites representing 250,000 sq. ft. of occupied operational spaces, savings analysis, technology procurement and initiation of installation. Budget Period 2 planned to complete technology installations and initiate data collection of post-retrofit performance data. The second year go/no-go was to be the completion of technology installations and commissioning, metering and data collecting to support the requirements laid out in site specific M&V plans. Budget Period 3 planned to collect and analyze post-retrofit performance data and provide data and reporting to support energy efficiency rebate programs. After the team completed activities planned for Budget Period 1, the team reached a Go/No-Go Decision Point. At that point, TRC recommended that DOE discontinue the project without prejudice due to challenges with securing demonstration sites to meet the full 250,000 sf of occupied operational spaces and DOE concurred. In Budget Period 1, the TRC team developed criteria to recruit and evaluate potential demonstration host sites. TRC worked with Princeton University, the project demonstration partner, to identify buildings on their campus as potential candidates for the demonstration. Following the selection of demonstration sites, the TRC team customized energy technology packages according to the needs and characteristics of each site. TRC defined technology specifications, identified vendors, and conducted analysis to estimate energy and cost savings potential. The project team then developed schedules for technology procurement processes and scheduled for installation at all selected demonstration sites. The project team worked with Princeton University and DOE to develop an approach to verify energy savings achieved through measurement and verification (M&V) 2.0 methods. Princeton University initiated open bids to procure the necessary materials and installation contractors. Bid results came back higher than estimates due to a couple of factors – lack of familiarity of the bidders with the proposed technologies and lack of local trained installers to execute the installation of these new measures. Due to the higher bids, projects no longer met the internal cost-effectiveness criteria used by Princeton to proceed with procurement of the full suite of technologies as proposed in ISOP. Princeton had already procured parts of the ISOP package as part of a campus-wide initiative for FDD and lighting retrofits, but with the higher costs for other ISOP components, Princeton could no longer commit to the full ISOP package on the selected sites. Based on this, the team reached the Go/No-Go decision point, where they decided not to proceed with the project. Princeton is separately installing portions of the ISOP package where they individually meet Princeton’s payback criteria but on a different schedule than would have been needed for the DOE ISOP project. The team has learned several lessons from project progress in the first budget period. The team will utilize these lessons in future projects, as should any team which proceeds with a project around the ISOP technology. The first lesson is that more information about the proposed sites is required earlier in the process (perhaps even at the proposal stage) in order to have a successful demonstration. Technical details not evident earlier in the process (such as the TLED limitations for ALCS) can derail project execution. The second lesson is that pricing of emerging technologies is highly variable due to lack of familiarity of local installers and distributor with the proposed technologies as well as alternate bids using products they were more familiar with, but that cost more than the ones proposed by TRC. Finally, the last major lesson is that the host site’s internal project criteria is of critical importance. Based on these higher installed costs and lack of an informed installer base for the products proposed for this project, the project does not meet Princeton’s simple payback goals of five years.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

Economic Evaluation of a Coupled Nuclear Power Plant and Hydrogen Production Facility: A Case Study

This study optimized the design sizes and operation of a power-to-hydrogen-to-power integrated energy system to allow a baseload power plant to operate flexibly in the energy market. In collaboration with a utility industry partner, the system, consisting of an electrolyzer, compressors, storage tank, and fuel cell, was optimized under conditions specific to the proposed project at the site of a nuclear power plant. The Design Integration and Synthesis Platform to Advance Tightly Coupled Hybrid Energy Systems (DISPATCHES) maximized net present value by optimizing sizing of components and dispatch decisions. Revenues included sale of electricity, capacity payments typical of the New York Independent System Operator, and the section 45V hydrogen production tax credit of the Inflation Reduction Act of 2022 (the tax credit was assumed to be available to legacy plants in the absence of clear guidance at present). Under default assumptions which excluded many capital expenditures, the base case optimized solution had a net present value of $\$$1.4 million over a 30 year lifetime, with a 0.365 MW fuel cell operating nearly continuously and 85% of revenues supplied by the hydrogen production tax credit (which was counted as a revenue regardless of profit, thus assuming credit monetization or offset of taxes within the larger firm was possible in all years). Beyond the base case, a sensitivity study elucidated drivers of the economics as capacity payment rate and hydrogen production tax credit rate vary. Additional sensitivity studies also extended results to variation of other, previously fixed parameters, including the fuel cell capital cost, and to imposition of further constraints. Optimization was also repeated for the default assumptions but recognizing tax credits upon use of hydrogen rather than upon its production, producing no change in the optimal solution. Most notably, capacity payments above $\$$15/kW-month drove optimal fuel cells multiple times larger than those with the default estimated capacity payment of $\$$2.5/kW-month (approaching 11 vs. 0.365 MW), and these larger fuel cells operated rarely (capacity factors of ~0.03). Furthermore, when the hydrogen production tax credit was provided for only 10 years, under the specific assumptions of this study (e.g., neither site preparation costs nor electrolyzer capital cost counted), the optimal solution avoided economic loss by ceasing system operation after the 10th year. Viewed broadly, this study demonstrated the capabilities of DISPATCHES, which can be user-adapted to serve other industrial case studies.

08 HYDROGEN↗
DOE OSTI2022

Data-Driven Simulation-Based Planning for Electric Airport Shuttle Systems: A Real-World Case Study

Many airports are adopting battery electric buses in their shuttle fleets due to concerns over air quality and regulations. This study proposes a simulation-based optimization modeling framework to help airport shuttle operators effectively deploy electric buses. We evaluated a planned airport electric shuttle system with an event-driven simulator. Empirical data collected from existing systems were used to drive the simulations. We then proposed a simulation-based optimization model to determine the battery capacity, charging power, and number of chargers so that predefined objective(s) (e.g., minimizing total capital cost, minimizing emissions) are optimized. Compared to existing studies, the primary contribution of the proposed method is that it can model the real-world stochastic nature of operations in an electric bus system with much higher fidelity. To demonstrate the proposed modeling framework, we study a real-world shuttle system at the Dallas-Fort Worth International Airport, and present extensive numerical studies. When considering partial fleet electrification, the model can provide a set of Pareto optimal solutions. When considering full fleet electrification, the optimal solution requires a 50-kWh battery capacity and four 210-kW chargers, resulting in a total capital cost of $26,744,000. The results demonstrate that the proposed modeling framework can effectively optimize the planning of electric airport shuttle systems with partial or full fleet electrification.

ADVANCED PROPULSION SYSTEMS,ENERGY PLANNING, POLIC↗
DOE OSTI2020

Efficient proactive vehicle relocation for on-demand mobility service with recurrent neural networks

One major challenge for on-demand mobility service (OMS) providers is to seamlessly match empty vehicles with trip requests so that the total vacant mileage is minimized. In this work, we develop an innovative data-driven approach for devising efficient vehicle relocation policy for OMS that (1) proactively relocates vehicles before the demand is observed and (2) reduces the inequality among drivers' income so that the proactive relocation policy is fair and is likely to be followed by drivers. Our approach represents the fusion of optimization and machine learning methods, which comprises three steps: First, we formulate the optimal proactive relocation as an optimal/stable matching problems and solve for global optimal solutions based on historical data. Second, the optimal solutions are then grouped and fed to train the deep learning models which consist of fully connected layers and long short-term memory networks. Low rank approximation is introduced to reduce the model complexity and improve the training performances. Finally, we use the trained model to predict the relocation policy which can be implemented in real time. We conduct comprehensive numerical experiments and sensitivity analyses to demonstrate the performances of the proposed method using New York City taxi data. Here, the results suggest that our method will reduce empty mileage per trip by 54-70% under optimal matching strategy, and a 25-32% reduction can also be achieved by following stable matching strategy. We also validate that the predicted relocation policies are robust in the presence of uncertain passenger demand level and passenger trip-requesting behavior.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2023

Posiform planting: generating QUBO instances for benchmarking

We are interested in benchmarking both quantum annealing and classical algorithms for minimizing quadratic unconstrained binary optimization (QUBO) problems. Such problems are NP-hard in general, implying that the exact minima of randomly generated instances are hard to find and thus typically unknown. While brute forcing smaller instances is possible, such instances are typically not interesting due to being too easy for both quantum and classical algorithms. In this contribution, we propose a novel method, called posiform planting , for generating random QUBO instances of arbitrary size with known optimal solutions, and use those instances to benchmark the sampling quality of four D-Wave quantum annealers utilizing different interconnection structures (Chimera, Pegasus, and Zephyr hardware graphs) and the simulated annealing algorithm. Posiform planting differs from many existing methods in two key ways. It ensures the uniqueness of the planted optimal solution, thus avoiding groundstate degeneracy, and it enables the generation of QUBOs that are tailored to a given hardware connectivity structure, provided that the connectivity is not too sparse. Posiform planted QUBOs are a type of 2-SAT boolean satisfiability combinatorial optimization problems. Our experiments demonstrate the capability of the D-Wave quantum annealers to sample the optimal planted solution of combinatorial optimization problems with up to 5, 627 qubits.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Fast Iterative Multi-site Hosting Capacity Analysis for Distribution Systems With Search Space Pruning

Interconnection studies for distributed energy resources (DERs) is a time-intensive process, primarily due to the necessity of solving large number of power flow scenarios. Hosting capacity analysis (HCA) is a time-consuming aspect of interconnection studies that is divided into single-site HCA (SHCA) and multi-site HCA (MHCA). From a computational and understandable standpoint, the industry seeks iteration-based solutions for SHCA, although it doesn't maximize the total DER hosting capacity (DERHC) of the grid, as MHCA does. While non-iterative solutions are available for MHCA, they involve a trade-off between the modeling accuracy of the distribution system, solution quality, and ease of understanding. In this work, we present a fast iterative solution for MHCA, reducing computational complexity by eliminating the need to solve power flows for a large amount of search space, thus making iterative solutions feasible. This iterative approach guarantees both a global optimal solution with sufficient time and a fast, close-to-optimal solution through efficient search space pruning. It also easily integrates with existing utility HCA tools. The results are demonstrated on select locations in the IEEE-123 bus system for community-scale interconnection studies. We highlight the benefits of skipping the need to solve millions of power flows, all while maximizing the grid's total DERHC.

Guddanti, Kishan Prudhvi↗
DOE OSTI2021

Tuning successive linear programming to solve AC optimal power flow problem for large networks

Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in the proximity of the near-optimal solution (i.e., Stage 2 and Stage 3). The numerical experiments on test cases ranging from 500-bus to 30,000-bus systems show that the algorithm is tractable. Here the results show that our proposed algorithm is tractable and can solve more than 80% of test cases faster than the well-known Interior Point Method while significantly reduce the number of iterations required to solve ACOPF. The number of iterations is considered an important factor in the examination of tractability which can drastically reduce the computational time required within each iteration.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Integrating tactical planning, operational planning and scheduling using data-driven feasibility analysis

Supply chain operations and scheduling are well-studied problems in the literature. Although these problems are related, they are often solved sequentially. This uncoordinated approach usually leads to sub-optimal solutions. Here this paper proposes a methodology for integrating scheduling operations into the supply chain network, motivated by the available enterprise data, and feasibility analysis. Existing literature on integrated models for addressing the supply chain is reviewed and classified. Then the mathematical model formulation for each level is discussed, after which the proposed data-driven integrated framework is described. The methodology is tested on two different case studies of varying dimensions. For each case study, the solution solves a multi-objective problem with the overall aim of an optimal solution that is robust towards achieving optimal cost while keeping customer satisfaction in mind.

42 ENGINEERING↗
DOE OSTI2020

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗
DOE OSTI2024

Revealing Decision Conservativeness Through Inverse Distributionally Robust Optimization

This paper introduces Inverse Distributionally Robust Optimization (I-DRO) as a method to infer the conservativeness level of a decision-maker, represented by the size of a Wasserstein metric-based ambiguity set, from the optimal decisions made using Forward Distributionally Robust Optimization (F-DRO). By leveraging the Karush-Kuhn-Tucker (KKT) conditions of the convex F-DRO model, we formulate I-DRO as a bi-linear program, which can be solved using off-the-shelf optimization solvers. Additionally, this formulation exhibits several advantageous properties. We demonstrate that I-DRO not only guarantees the existence and uniqueness of an optimal solution but also establishes the necessary and sufficient conditions for this optimal solution to accurately match the actual conservativeness level in F-DRO. Furthermore, we identify three extreme scenarios that may impact I-DRO effectiveness. Our case study applies F-DRO for power system scheduling under uncertainty and employs I-DRO to recover the conservativeness level of system operators. Numerical experiments based on an IEEE 5-bus system and a realistic NYISO 11-zone system demonstrate I-DRO performance in both normal and extreme scenarios. An extended version of this paper with additional analyses is available at li2024revealing.

distributionally robust optimization↗
DOE OSTI2024

Optimizing Desalination Operations for Energy Flexibility

Despite the value of energy optimization in desalination processes, modeling dynamic operations for monthly billing periods has remained a computational challenge. This work proposes a framework for energy flexibility optimization, which includes new modeling features for independent operation of parallel skids, start-up delays associated with chemical stabilization, the consideration of industrial energy tariff structures, and inclusion of hourly electrical carbon intensities. This is done using a modular and computationally efficient formulation that guarantees a globally optimal solution with standard optimization solvers. In this study, the approach is demonstrated in two distinct case studies: a seawater desalination plant in Santa Barbara, CA, and an indirect potable reuse facility in San Jose, CA. Trends predicted from the model are validated against operational facility measurements from a demand response shutdown event. Preliminary results show that optimizing energy flexibility can result in 18.51% monthly cost savings over energy efficiency-optimized operation. The value extracted from a facility-wide shutdown during peak electricity price hours is hampered by start-up delays in post-treatment chemical stabilization. In cases in which a facility does not have much excess capacity, using a flow equalization tank or operating over a wide recovery range may be cost-effective.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2019

Approximate Mixed-Integer Programming Solution with Machine Learning Technique and Linear Programming Relaxation

Security constrained unit commitment (SCUC) is solved in the day-ahead electricity market to determine electricity generation schedule for the following date. The associated mixed integer programming (MIP) problem is known computationally hard. Heuristics like rounding can be computationally efficient for solving large MIP problems however often produces lower quality solutions due to discrepancy between MIP solution and linear programming relaxation (LPR) solution, i.e., variables taking different discrete values between MIP and LPR solutions. In this work, we applied the machine learning-based algorithms—Classification and Regression Tree (CART) model and random forest (RF) model—to obtain an LPR-based approximation that close to an MIP solution without actually solving the MIP problem. By computing feature importance derived from the CART and RF models, we assessed the link between coefficients in the MIP model, the LPR solution, and the optimal solution of the MIP problem. We applied the CART and RF approaches to solve SCUC problems using day-ahead energy market cases from Midcontinent Independent System Operator. The results show that our method is computationally efficient and could achieve an approximation sufficiently close to the SCUC solution with <0.15% error and ~78% reduction in the discrepancies between LPR and MIP solutions.

Lin, Xinming↗
DOE OSTI2022

Hierarchical Distributed Optimal Power Flow of HV and MV Distribution Networks With Continuous and Discrete Devices

With large-scale distributed photovoltaics (PVs) being integrated into distribution networks (DNs), coordinated optimal power flow (OPF) of high voltage (HV) and medium voltage (MV) DNs should be investigated to optimally dispatch the distributed PVs and other network devices. Here, this paper presents a hierarchical distributed OPF method for HV and MV DNs with on-load tap changers, reactive power compensators, feeder switches and distributed PVs. A hierarchical master-slave control architecture is applied to implement coordinated OPF of two-layer DNs. The HV master problem and MV subproblems are transformed into mixed-integer convex problems respectively with second order cone programming and LinDistFlow approximation. Since there is no efficient distributed algorithm to solve such OPF models with integer subproblems, a novel distributed algorithm is proposed in this paper to efficiently solve the hierarchical coordinated OPF model with integer subproblems in a distributed manner. In the proposed algorithm, the coordinated OPF model is solved in a branch-and-bound framework, where in each branch node generalized Benders decomposition (GBD) algorithm is applied to decompose the coordinated OPF model into a master problem and relaxed subproblems and solves them iteratively to get optimal solution. The GBD optimal and feasible cutting planes generated in a branch node are proved to be valid for its descendants. Moreover, three acceleration techniques are introduced into the proposed algorithm to improve computational efficiency. Finally, the effectiveness and accuracy of the proposed method are verified via simulation tests in Jinzhai DNs of China.

42 ENGINEERING↗
DOE OSTI2024

T3CO (Transportation Technology Total Cost of Ownership) Open Source [SWR-21-54]

T3CO (Transportation Technology Total Cost of Ownership), is open source software for modeling total cost of ownership for commercial vehicles with advanced powertrains. T3CO is a modeling framework for determining geospatially and temporally optimized total cost of ownership (TCO) for vehicle powertrain technologies. T3CO runs NREL's FASTSim™ software for a representative set of operating conditions to minimize TCO based on vehicle parameters that affect purchase and operating costs (e.g., fuel/electricity consumption, asset depreciation, opportunity costs associated with charging time) while simultaneously ensuring that firm performance constraints (e.g. zero-to-sixty time, gradeability) are satisfied. T3CO will enable the user to control which powertrain parameters are used in optimizing TCO, and these parameters will be modified by a multi-objective optimization (MOO) algorithm to identify a Pareto-optimal solution set. The optimization algorithm will be modular so that users can choose from many different MOO options or insert their own user-defined optimization tool. NREL T3CO Homepage: https://www.nrel.gov/transportation/t3co.html PyPI package: https://pypi.org/project/t3co/

Lustbader, Jason↗
DOE OSTI2023

Integrate FARM with PID controllers: IES Simulation Ecosystem Control System Development

The FARM (Feasible Actuator Range Modifier) software module is a component of the RAVEN-based FORCE framework for analysis of Integrated Energy Systems (IES). FARM was designed to support the HERON software module in the solution of the optimal dispatch problem for IES units. As the result of HERON-FARM dispatch simulation, the set-point trajectories are optimized to meet constraints on both the production variables (i.e., the variables to be optimized such as the electrical power, the hydrogen production rate, etc.) and the process variables tied to the service life of equipment (e.g., steam flowrate, vessel pressure, turbine firing temperature, etc.) at a coarse time resolution (every 10 or 100 seconds) over long time horizons (several days or weeks). In case the operational constraints need to be met at finer time resolution, the computational burden of HERON-FARM would linearly increase with the sampling rate, and sub-optimal solutions might be obtained. System responses characterized by overshoots and damped oscillations temporarily violating the imposed constraints might occur during abrupt power transients. In this report, a hierarchical control system architecture for the operation of the Dynamic Energy Technology and Integration Laboratory (DETAIL) facility constructed at INL was proposed. First, the preliminary studies on the proposed control strategy for operating the facility and the designed PI controllers were reviewed. In particular, the current approach for generating the set-point trajectories was studied, and its limits were identified. To this aim, the inclusion of a Supervisory Control layer embedding a modified version of the FARM algorithm for preserving the system safe operation over both long and real-time horizons was proposed. In this way, FARM would be applied twice, i.e., the original version (“FARM Validator”) aiding the solution of the power dispatch problem, and the modified version (“FARM Supervisory” coordinating the PI controllers to address the real-time control tasks. Despite the kernel of the two modules is the same algorithm, their roles, tasks, and capabilities are quite different. A detailed description of the role of FARM at addressing low-level control tasks is provided, along with tentative operational procedures for training the models embedded into the algorithm by using the collected experimental data.

42 ENGINEERING↗
DOE OSTI2024

CI-MOR Final Report: Analysis and Validation of Critical Infrastructure Models using Model Order Reduction

This report summarizes the research and capabilities developed as part of the project “Analysis and Validation of Critical Infrastructure Models using Model Order Reduction” (CI-MOR) LDRD project. CI-MOR research enables the solution of large, complex optimization models that naturally arise in national security challenges involving critical infrastructures. Specifically, CI-MOR researchers developed methods to (1) rigorously approximate complex, nonlinear optimization formulations, (2) identify alternative near-optimal solutions, (3) accelerate optimization workflows used for complex applications, and (4) rigorously integrate domain knowledge in stochastic-process models. This report provides an overview of the research done in CI-MOR, and we describe application exemplars used to illustrate CI-MOR capabilities. Furthermore, we describe the software developed by CI-MOR that researchers can leverage to analyze new applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A Hierarchical Optimization Method for Electric Vertical Takeoff and Landing Aircraft Network Design

Electric vertical takeoff and landing aircraft (eVTOLs) are expected to serve urban air mobility in a station-to-station configuration, which makes the optimal network design of eVTOL stations a critical question to explore. Existing approaches often face limitations, such as the inability to interact station locations with demand or difficulty in finding the optimal solution for large study regions. Here, this paper first proposes a mathematical model to generate optimal eVTOL station locations while considering associated potential eVTOL demand, and then proposes a heuristic algorithm, Hierarchical Optimization MEthod (HOME), to efficiently solve the model. With a case study of Southern California, HOME was compared to 1) directly solving the original integer linear programming-based network design problem, and 2) employing the widely used genetic algorithm. Results suggest that HOME can find optimal solutions with limited computational resources. The proposed framework powered by HOME provides a computationally efficient way to support urban air mobility planning.

97 MATHEMATICS AND COMPUTING↗