Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematical 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 73 records · Page 4

Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC)

With the rapid growth in the capabilities of smaller satellites, satellite architectures that replace a single, extremely capable spacecraft with multiple, cheaper ones are gaining in popularity. Unfortunately, the orbit design process for constellations can be significantly more involved, especiallywhen the relative placement of the individual spacecraft within the constellation is not constrained by mission and/or science objectives. Optimizing a satellite constellation in the presence of multiple, competing objectives is a highly complex problem to which many traditional mathematical optimization methods cannot be applied and few tools exist to help mission designers search for promising candidate mission designs. The Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC) has been created to search for near-optimal constellation design options. GenETOC combines a modified version of the Non-dominated Sorting Genetic Algorithm II (NSGA II) with STK Components libraries (a 3rdparty .NET package created by Analytical Graphics Inc.) to create a framework that enables a mission designer to generate a simulation that models the design problem and obtain a family of potential, near-optimal solutions that can be investigated more in detail.

mission design↗

Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC)

With the rapid growth in the capabilities of smaller satellites, satellite architectures that replace a single, extremely capable spacecraft with multiple, cheaper ones are gaining in popularity. Unfortunately, the orbit design process for constellations can be significantly more involved, especiallywhen the relative placement of the individual spacecraft within the constellation is not constrained by mission and/or science objectives. Optimizing a satellite constellation in the presence of multiple, competing objectives is a highly complex problem to which many traditional mathematical optimization methods cannot be applied and few tools exist to help mission designers search for promising candidate mission designs. The Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC) has been created to search for near-optimal constellation design options. GenETOC combines a modified version of the Non-dominated Sorting Genetic Algorithm II (NSGA II) with STK Components libraries (a 3rdparty .NET package created by Analytical Graphics Inc.) to create a framework that enables a mission designer to generate a simulation that models the design problem and obtain a family of potential, near-optimal solutions that can be investigated more in detail. GenETOC was developed in C# using the .NET framework with Windows Presentation Foundation (WPF) serving as the framework from which to create the graphical user interface (GUI). GenETOC user inputs can be categorized into three major data components: definition of the problem (areas of interest, satellite decision parameters, and sensor configurations), definition of performance objectives, and specification of the genetic algorithm (GA) parameters. In the problem definition component, the user is prompted to define the areas of interest against which the performance metrics will be computed, define the sensor parameters and attach them to specific spacecraft, select which satellite orbital parameters will be added to the decision space of the GA, and specify the range of desired values for each optimization parameter. For performance objectives, the user is presented with a list of available coverage and revisit performance based calculation options from which two metrics are chosen to serve as the objective functions that the GA will use to evaluate solutions during the optimization process. Finally, the definition of the GA parameters provides user control over the number of generations (number of optimization iterations), the population size (number of candidate constellations created in each generation), and the adaptive mutation and crossover threshold values (control parameters for how frequently each process occurs during the optimization). GenETOC has been extensively tested to verify the individual components of the optimization process. The GA has been tested against a suite of GA test problems to confirm convergence to the known two and three-dimensional Pareto fronts. The coverage and revisit performance metrics obtained in GenETOC are compared with STK desktop scenarios, confirming the constellations are being appropriately modeled within GenETOC simulations. A walkthrough of a simple, example problem is provided to illustrate the workings of GenETOC and to demonstrate the output available to the mission designer.

mission design↗

Integrated structure electromagnetic optimization of large space antenna reflectors

The requirements for extremely precise and powerful large space antenna reflectors have motivated the development of a procedure for shape control of the reflector surface. A mathematical optimization procedure has been developed which improves antenna performance while minimizing necessary shape correction effort. In contrast to previous work which proposed controlling the rms distortion error of the surface thereby indirectly improving antenna performance, the current work includes electromagnetic (EM) performance calculations as an integral of the control procedure. The application of the procedure to a radiometer design with a tetrahedral truss backup structure demonstrates the potential for significant improvement. The results indicate the benefit of including EM performance calculations in procedures for shape control of large space antenna reflectors.

Padula, Sharon L.↗

Integrated structural electromagnetic optimization of large space antenna reflectors

The requirements for extremely precise and powerful large space antenna reflectors have motivated the development of a procedure for shape control of the reflector surface. A mathematical optimization procedure has been developed which improves antenna performance while minimizing necessary shape correction effort. In contrast to previous work which proposed controlling the rms distortion error of the surface thereby indirectly improving antenna performance, the current work includes electromagnetic (EM) performance calculations as an integral part of the control procedure. The application of the procedure to a radiometer design with a tetrahedral truss backup structure demonstrates the potential for significant improvement. The results indicate the benefit of including EM performance calculations in procedures for shape control of large space antenna reflectors.

Padula, S. L.↗

TH-E-17A-05: Optimizing Four Dimensional Cone Beam Computed Tomography Projection Allocation to Respiratory Bins

Purpose: Four dimensional cone beam computed tomography (4DCBCT) is an emerging image guidance strategy but it can suffer from poor image quality. To avoid repeating scans it is beneficial to make the best use of the imaging data obtained. For conventional 4DCBCT the location and size of respiratory bins is fixed and projections are allocated to the respiratory bin within which it falls. Strictly adhering to this rule is unnecessary and can compromise image quality. In this study we optimize the size and location of respiratory bins and allow projections to be sourced from adjacent phases of the respiratory cycle. Methods: A mathematical optimization framework using mixed integer quadratic programming has been developed that determines when to source projections from adjacent respiratory bins and optimizes the size and location of the bins. The method, which we will call projection sharing, runs in under 2 seconds of CPU time. Five 4DCBCT datasets of stage III-IV lung cancer patients were used to test the algorithm. The standard deviation of the angular separation between projections (SD-A) and the standard deviation in the volume of the reconstructed fiducial gold coil (SD-V) were used as proxies to measure streaking artefacts and motion blur respectively. Results: The SD-A using displacement binning and projection sharing was 30%–50% smaller than conventional phase based binning and 59%–76% smaller than conventional displacement binning indicating more uniformly spaced projections and fewer streaking artefacts. The SD-V was 20–90% smaller when using projection sharing than using conventional phase based binning suggesting more uniform marker segmentation and less motion blur. Conclusion: Image quality was visibly and significantly improved with projection sharing. Projection sharing does not require any modifications to existing hardware and offers a more robust replacement to phase based binning, or, an option if phase based reconstruction is not of a suitable quality. This project is supported by an NHMRC Australia Fellowship and NHMRC project grant number 1034060.

60 APPLIED LIFE SCIENCES↗

Droning on to Delivery: Examining the Energy Impacts of Using Drones for Moving Goods

The demand for fast, localized delivery has grown significantly in recent years. Whether for cheesy snacks, prepared food, medical solutions, or business deliveries, fast and efficient delivery is increasingly a demand and differentiator. Drone delivery in the freight sector offers to revolutionize last-mile logistics and improve services. This research analyzes the impacts of drone energy for delivery operations, aiming to compare various types of drones (large and small, rotary and VTOL) and various types of business methods. The project executes novel open-air and laboratory-based testing to look at the impacts of weights, operations, temperatures and weather conditions. The study combines this real-world experimental data with fleet optimization mathematical models to assess energy consumption of different scenarios as well as examine the minimum fleet size and additional battery requirements. These fleet optimization models compare energy between types of deployments with existing delivery methods. The model was also extended to look at mixed fleets of aerial drones and ground vehicles to accommodate different restrictions on drones or when weather prohibits their use. The analysis provided insights into factors such as drone design, payload weight, flight distance, weather conditions and operational parameters and impacts of each. It showed how to combine different types of vehicles to reduce energy and improve services. And it showed that drone speed, routing restrictions, and unfavorable weather significantly influence energy consumption. Our open experiment data and optimization models can assist stakeholders and industry in understanding drone package delivery and offers keys to improving deployment.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Optimal placement of tuning masses for vibration reduction in helicopter rotor blades

Described are methods for reducing vibration in helicopter rotor blades by determining optimum sizes and locations of tuning masses through formal mathematical optimization techniques. An optimization procedure is developed which employs the tuning masses and corresponding locations as design variables which are systematically changed to achieve low values of shear without a large mass penalty. The finite-element structural analysis of the blade and the optimization formulation require development of discretized expressions for two performance parameters: modal shaping parameter and modal shear amplitude. Matrix expressions for both quantities and their sensitivity derivatives are developed. Three optimization strategies are developed and tested. The first is based on minimizing the modal shaping parameter which indirectly reduces the modal shear amplitudes corresponding to each harmonic of airload. The second strategy reduces these amplitudes directly, and the third strategy reduces the shear as a function of time during a revolution of the blade. The first strategy works well for reducing the shear for one mode responding to a single harmonic of the airload, but has been found in some cases to be ineffective for more than one mode. The second and third strategies give similar results and show excellent reduction of the shear with a low mass penalty.

Pritchard, Jocelyn I.↗

An integrated computer procedure for sizing composite airframe structures

A computerized algorithm to generate cross-sectional dimensions and fiber orientations for composite airframe structures is described, and its application in a wing structural synthesis is established. The algorithm unifies computations of aeroelastic loads, stresses, and deflections, as well as optimal structural sizing and fiber orientations in an open-ended system of integrated computer programs. A finite-element analysis and a mathematical-optimization technique are discussed.

Sobieszczanski-Sobieski, J.↗

Integration of discrete-event dynamics and machining dynamics for machine tool: Modeling, analysis and algorithms

Machining dynamics research lays a solid foundation for machining operations by providing stable combinations of spindle speed and depth of cut. Furthermore, machine learning has been applied to predict tool life as a function of cutting speed. However, the existing research does not consider the discrete-event dynamics in machine shop, i.e., the machine tool needs to process a series of parts in queue under various practical production requirements. This paper addresses the integration of discrete-event dynamics and machining dynamics to achieve cost savings in machining. A learning-based cost function is first proposed for the studied integrated optimization problem of machine tool. The proposed cost function utilizes the predicted tool life under different stable cutting speeds for further optimizing speed selection of machine tool to deal with the discrete-event dynamics in machine shop. Then, according to the practical production requirements, effective mathematical optimization models are developed for the related integrated optimization problems with the consideration of cost, makespan and due date, respectively. Numerical results show the effectiveness of our proposed methods and also the potential to be used in practice.

Ma, Mason↗

A mixed optimization method for automated design of fuselage structures.

A procedure for automating the design of transport aircraft fuselage structures has been developed and implemented in the form of an operational program. The structure is designed in two stages. First, an overall distribution of structural material is obtained by means of optimality criteria to meet strength and displacement constraints. Subsequently, the detailed design of selected rings and panels consisting of skin and stringers is performed by mathematical optimization accounting for a set of realistic design constraints. The practicality and computer efficiency of the procedure is demonstrated on cylindrical and area-ruled large transport fuselages.

Sobieszczanski, J.↗

TH-CD-202-08: Feasibility Study of Planning Phase Optimization Using Patient Geometry-Driven Information for Better Dose Sparing of Organ at Risks

Purpose: To propose a simple and effective cost value function to search optimal planning phase (gating window) and demonstrated its feasibility for respiratory correlated radiation therapy. Methods: We acquired 4DCT of 10 phases for 10 lung patients who have tumor located near OARs such as esophagus, heart, and spinal cord (i.e., central lung cancer patients). A simplified mathematical optimization function was established by using overlap volume histogram (OVH) between the target and organ at risk (OAR) at each phase and the tolerance dose of selected OARs to achieve surrounding OARs dose-sparing. For all patients and all phases, delineation of the target volume and selected OARs (esophagus, heart, and spinal cord) was performed (by one observer to avoid inter-observer variation), then cost values were calculated for all phases. After the breathing phases were ranked according to cost value function, the relationship between score and dose distribution at highest and lowest cost value phases were evaluated by comparing the mean/max dose. Results: A simplified mathematical cost value function showed noticeable difference from phase to phase, implying it is possible to find optimal phases for gating window. The lowest cost value which may result in lower mean/max dose to OARs was distributed at various phases for all patients. The mean doses of the OARs significantly decreased about 10% with statistical significance for all 3 OARs at the phase with the lowest cost value. Also, the max doses of the OARs were decreased about 2∼5% at the phase with the lowest cost value compared to the phase with the highest cost value. Conclusion: It is demonstrated that optimal phases (in dose distribution perspective) for gating window could exist differently through each patient and the proposed cost value function can be a useful tool for determining such phases without performing dose optimization calculations. This research was supported by the Mid-career Researcher Program through NRF funded by the Ministry of Science, ICT & Future Planning of Korea (NRF-2014R1A2A1A10050270) and by the Radiation Technology R&D program through the National Research Foundation of Korea funded by the Ministry of Science, ICT & Future Planning (No. 2013M2A2A7038291)

60 APPLIED LIFE SCIENCES↗

Fast yaw optimization for wind plant wake steering using Boolean yaw angles

Abstract. In wind plants, turbines can be yawed into the wind to steer their wakes away from downstream turbines and achieve an overall increase in plant power. Mathematical optimization is typically used to determine the best yaw angles at which to operate the turbines in a plant. In this paper, we present a new heuristic to rapidly determine the yaw angles in a wind plant. In this method, we define the turbine yaw angles as Boolean – either yawed at a predefined angle or nonyawed – as opposed to the typical methods of defining yaw angles as continuous or with fine discretizations. We then optimize which turbines should be yawed with an algorithm that sweeps through the turbines from the most upstream to the most downstream. We demonstrate that our new Boolean optimization method can find turbine yaw angles that perform well compared to a traditionally used gradient-based optimizer for which the yaw angles are defined as continuous. There is less than 0.6 % difference in the optimized power between the two optimization methods for randomly placed turbine layouts and less than a 0.6 % difference in the optimal annual energy production between the two optimization methods for a real wind farm. Additionally, we show that our new method is much more computationally efficient than the traditional method. For plants with nonzero optimal yaw angles, our new method is generally able to solve for the turbine yaw angles 50–150 times faster, and in some extreme cases up to 500 times faster, than the traditional method.

17 WIND ENERGY↗

GlobiPack v. 1.0

GlobiPack contains a small collection of optimization globalization algorithms. These algorithms are used by optimization and various nonlinear equation solver algorithms.Used as the line-search procedure with Newton and Quasi-Newton optimization and nonlinear equation solver methods. These are standard published 1-D line search algorithms such as are described in the book Nocedal and Wright Numerical Optimization: 2nd edition, 2006. One set of algorithms were copied and refactored from the existing open-source Trilinos package MOOCHO where the linear search code is used to globalize SQP methods. This software is generic to any mathematical optimization problem where smooth derivatives exist. There is no specific connection or mention whatsoever to any specific application, period. You cannot find more general mathematical software.

Bartlett, Roscoe↗

GlobiPack v. 1.0

GlobiPack contains a small collection of optimization globalization algorithms. These algorithms are used by optimization and various nonlinear equation solver algorithms.Used as the line-search procedure with Newton and Quasi-Newton optimization and nonlinear equation solver methods. These are standard published 1-D line search algorithms such as are described in the book Nocedal and Wright Numerical Optimization: 2nd edition, 2006. One set of algorithms were copied and refactored from the existing open-source Trilinos package MOOCHO where the linear search code is used to globalize SQP methods. This software is generic to any mathematical optimization problem where smooth derivatives exist. There is no specific connection or mention whatsoever to any specific application, period. You cannot find more general mathematical software.

Bartlett, Roscoe↗

ADAM: A web platform for graph-based modeling and optimization of supply chains

Modeling and optimization are essential tasks that arise in the analysis and design of supply chains (SCs). SC models are essential for understanding emergent behavior such as transactions between participants, inherent value of products exchanged, as well as impact of externalities (e.g., policy and climate) and of constraints. Unfortunately, most users of SC models have limited expertise in mathematical optimization, and this hinders the adoption of advanced decision-making tools. Here, in this work, we present ADAM, a web platform that enables the modeling and optimization of SCs. ADAM facilitates modeling by leveraging intuitive and compact graph-based abstractions that allow the user to express dependencies between locations, products, and participants. ADAM model objects serve as repositories of experimental, technology, and socio-economic data; moreover, the graph abstractions facilitate the organization and exchange of models and provides a natural framework for education and outreach. Here, we discuss the graph abstractions and software design principles behind ADAM, its key functional features and workflows, and application examples.

97 MATHEMATICS AND COMPUTING↗

A Low-cost, High-yield Process for the Direct Productin of High Energy Density Liquid Fuel from Biomass

The primary objective and outcome of this project was the development and validation of a novel, low-cost, high-pressure fast-hydropyrolysis/hydrodeoxygenation (HDO) process (H 2 Bioil) using supplementary hydrogen (H 2 ) to produce liquid hydrocarbons from biomass. The research efforts under the various tasks of the project have culminated in the first experimental demonstration of the H 2 Bioil process, producing 100% deoxygenated >C4+ hydrocarbons containing 36-40% of the carbon in the feed of pyrolysis products from biomass. The demonstrated H{sub 2}Bioil process technology (i.e. reactor, catalyst, and downstream product recovery) is scalable to a commercial level and is estimated to be economically competitive for the cases when supplementary H 2 is sourced from coal, natural gas, or nuclear. Additionally, energy systems modeling has revealed several process integration options based on the H 2 Bioilprocess for energy and carbon efficient liquid fuel production. All project tasks and milestones were completed or exceeded. Novel, commercially-scalable, high-pressure reactors for both fast-hydropyrolysis and hydrodeoxygenation were constructed, completing Task A. These reactors were capable of operation under a wide-range of conditions; enabling process studies that lead to identification of optimum process conditions. Model compounds representing biomass pyrolysis products were studied, completing Task B. These studies were critical in identifying and developing HDO catalysts to target specific oxygen functional groups. These process and model compound catalyst studies enabled identification of catalysts that achieved 100% deoxygenation of the real biomass feedstock, sorghum, to form hydrocarbons in high yields as part of Task C. The work completed during this grant has identified and validated the novel and commercially scalable H 2 Bioil process for production of hydrocarbon fuels from biomass. Studies on model compounds as well as real biomass feedstocks were utilized to identify optimized process conditions and selective HDO catalyst for high yield production of hydrocarbons from biomass. In addition to these experimental efforts, in Tasks D and E, we have developed a mathematical optimization framework to identify carbon and energy efficient biomass-to-liquid fuel process designs that integrate the use of different primary energy sources along with biomass (e.g. solar, coal or natural gas) for liquid fuel production. Using this tool, we have identified augmented biomass-to-liquid fuel configurations based on the fast-hydropyrolysis/HDO pathway, which was experimentally studied in this project. The computational approach used for screening alternative process configurations represents a unique contribution to the field of biomass processing for liquid fuel production.

09 BIOMASS FUELS↗

Implementing a unified solver for nonlinearly constrained optimization

SQP and interior-point methods (also referred to as Lagrange-Newton methods) typically share key algorithmic components, such as strategies for computing descent directions and mechanisms that promote global convergence. Building on this insight, we introduce a unifying framework with eight building blocks that abstracts the workflows of Lagrange-Newton methods. We then present Uno, a modular C++ solver that implements our unifying framework and allows the automatic combination of a wide range of strategies with no programming effort from the user. Uno is meant to (1) organize mathematical optimization strategies into a coherent hierarchy; (2) offer a wide range of efficient and robust methods that can be compared for a given instance; (3) enable researchers to experiment with novel optimization strategies; and (4) reduce the cost of development and maintenance of multiple optimization solvers. Uno’s software design allows user to compose new customized solvers for emerging optimization areas such as robust optimization or optimization problems with complementarity constraints, while building on reliable nonlinear optimization techniques. We demonstrate that Uno is highly competitive against state-of-the-art solvers filterSQP, IPOPT, SNOPT, MINOS, LANCELOT, LOQO, and CONOPT on a subset of 429 small problems from the CUTE collection. Uno is available as open-source software under the MIT license at https://github.com/cvanaret/Uno and via its C, Julia, Python, Fortran, and AMPL interfaces.

97 MATHEMATICS AND COMPUTING↗

Quantum Optimization: Potential, Challenges, and the Path Forward

Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization being one of the most pronounced domains. Across computer science and physics, there are a number of algorithmic approaches, often with little linkage. This is further complicated by the fragmented nature of the field of mathematical optimization, where major classes of optimization problems, such as combinatorial optimization, convex optimization, non-convex optimization, and stochastic extensions, have devoted communities. With these aspects in mind, this work draws on multiple approaches to study quantum optimization. Provably exact versus heuristic settings are first explained using computational complexity theory — highlighting where quantum advantage is possible in each context. Then, the core building blocks for quantum optimization algorithms are outlined to subsequently define prominent problem classes and identify key open questions that, if answered, will advance the field. The effects of scaling relevant problems on noisy quantum devices are also outlined in detail, alongside meaningful benchmarking problems. We underscore the importance of benchmarking by proposing clear metrics to conduct appropriate comparisons with classical optimization techniques. Lastly, we highlight two domains – finance and sustainability – as rich sources of optimization problems that could be used to benchmark, and eventually validate, the potential real-world impact of quantum optimization.

97 MATHEMATICS AND COMPUTING↗