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 55 records · Page 3

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↗

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↗

Predictive modeling of a subcritical pulverized-coal power plant for optimization: Parameter estimation, validation, and application

As renewable power generation deployment increases, fossil fuel plants are increasingly required to operate more flexibly. Many coal-fired power plants were originally designed to operate at base load and do not operate optimally at partial load. Predictive first-principles plant-wide models can be employed to identify opportunities for flexibility improvements and diagnose low-load operating issues. This paper describes the application of the Institute for the Design of Advanced Energy Systems Integrated Platform (IDAES) to model and optimize flexible power plant operations. The key benefits of using IDAES are that it provides an open-source, fully equation-oriented modeling framework for efficient modular model construction, reuse, and customization, together with a mathematical optimization framework leveraging powerful, state-of-the-art solvers. The process systems engineering workflow from predictive process simulation to parameter estimation, model validation, and plant optimization is applicable to a variety of existing and next-generation energy systems as well as other chemical and environmental processes. Here, to demonstrate this capability, a physics-based, steady-state model was developed to improve full- and part-load performance of the Escalante Generating Station, a 245 MWe (net) subcritical pulverized coal-fired power plant owned and operated by Tri-State Generation and Transmission Association. Specifically, sixty-nine model parameters were simultaneously estimated from several months of operating data enabling prediction of flow rates, temperatures, pressures, and steam quality throughout the plant. The validated model was leveraged by Escalante to reduce the minimum operating load from 90 MW to 50 MW by diagnosing a low-load water-hammer issue, enabling coal usage and emissions reductions during periods of low power demand. Additionally, opportunities for heat rate reduction (i.e., efficiency improvement) through a steeper sliding-pressure approach to load-following and optimization of other boiler operating variables were also identified and quantified. For example, a potential efficiency improvement of 0.7 percentage points was observed at half-load operation.

01 COAL, LIGNITE, AND PEAT↗

LLGOMAX: Enhancing Industry-Standard Tools for AC Optimal Unit Commitment (CRADA Final Report)

This was a collaborative effort between Lawrence Livermore National Security, LLC ("LLNS"), as manager and operator of Lawrence Livermore National Laboratory ("LLNL") and ECCO International Inc. ("Participant"). The team designed and implemented a new approach for the Security-Constrained Alternating-Current Unit Commitment (SCACUC) problem. The SCACUC problem is a mathematical optimization problem that decides which generating units should be online and how much power should be produced (and consumed) at each point of the power grid. The decisions are made so as to minimize the total cost of supplying electricity while respecting technical constraints of the power grid, both under normal and emergency conditions. The team developed a solution for SCACUC as specified in the ARPA-E Grid Optimization Competition (GOC) Challenge 3, which put forth a forward-looking version of the problem, which many features not present in today’s electricity market specifications for SCACUC.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimization approaches to volumetric modulated arc therapy planning

Volumetric modulated arc therapy (VMAT) has found widespread clinical application in recent years. A large number of treatment planning studies have evaluated the potential for VMAT for different disease sites based on the currently available commercial implementations of VMAT planning. In contrast, literature on the underlying mathematical optimization methods used in treatment planning is scarce. VMAT planning represents a challenging large scale optimization problem. In contrast to fluence map optimization in intensity-modulated radiotherapy planning for static beams, VMAT planning represents a nonconvex optimization problem. In this paper, the authors review the state-of-the-art in VMAT planning from an algorithmic perspective. Different approaches to VMAT optimization, including arc sequencing methods, extensions of direct aperture optimization, and direct optimization of leaf trajectories are reviewed. Their advantages and limitations are outlined and recommendations for improvements are discussed.

07 ISOTOPE AND RADIATION SOURCES↗

Epigraph: A Vaccine Design Tool Applied to an HIV Therapeutic Vaccine and a Pan-Filovirus Vaccine

Epigraph is an efficient graph-based algorithm for designing vaccine antigens to optimize potential T-cell epitope (PTE) coverage. Functionally, epigraph vaccine antigens are similar to Mosaic vaccines, which have demonstrated effectiveness in preliminary HIV non-human primate studies. In contrast to the Mosaic algorithm, Epigraph is substantially faster, and in restricted cases, provides a mathematically optimal solution. Furthermore, epigraph has new features that enable enhanced vaccine design flexibility. These features include the ability to exclude rare epitopes from a design, to optimize population coverage based on inexact epitope matches, and to apply the code to both aligned and unaligned input sequences. Epigraph was developed to provide practical design solutions for two outstanding vaccine problems. The first of these is a personalized approach to a therapeutic T-cell HIV vaccine that would provide antigens with an excellent match to an individual’s infecting strain, intended to contain or clear a chronic infection. The second is a pan-filovirus vaccine, with the potential to protect against all known viruses in the Filoviradae family, including ebolaviruses. A web-based interface to run the Epigraph tool suite is available (http://www.hiv.lanl.gov/content/sequence/EPIGRAPH/epigraph.html).

60 APPLIED LIFE SCIENCES↗

Computed Axial Lithography (CAL):Toward Single Step 3D Printing of Arbitrary Geometries

Most additive manufacturing processes today operate by printing voxels (3D pixels) serially point-by-point to build up a 3D part. In some more recently-developed techniques, for example optical printing methods such as projection stereolithography [Zheng et al. 2012], [Tumbleston et al. 2015], parts are printed layer-by-layer by curing full 2d (very thin in one dimension) layers of the 3d part in each print step. There does not yet exist a technique which is able to print arbitrarily-defined 3D geometries in a single print step. If such a technique existed, it could be used to expand the range of printable geometries in additive manufacturing and relax constraints on factors such as overhangs in topology optimization. It could also vastly increase print speed for 3D parts. In this work, we develop the principles for an approach for single exposure 3D printing of arbitrarily defined geometries. Our approach, termed Computed Axial Lithgography (CAL), is based on tomographic reconstruction, with mathematical optimization to generate a set of projections to optically define an arbitrary dose distribution within a target volume. We demonstrate the potential ability of the technique to print 3D parts using a prototype CAL system based on sequential illumination from many angles. Finally, we propose new hardware designs which will help us to realize true single-shot arbitrary-geometry 3D CAL.

42 ENGINEERING↗

Optimal control of mathematical models for the radiotherapy of gliomas: the scalar case

This paper deals with the optimal control of a mathematical model of glioma progression incorporating the basic facts of the evolution of primary brain tumors. We will consider a model of the simplest possible kind, based on the Fischer-Kolmogorov equations, using ideas from Pérez-García (Mathematical models for the radiotherapy of gliomas (preprint), 2016). The control is the 2n-tuple (t{sub 1},..., t{sub n}; d{sub 1},..., d{sub n}), where d{sub i} is the i-th applied radiotherapy dose an t{sub i} is the i-th administration for 1 ≤ i ≤ n. We search for controls that maximize the survival time, that is, the time at which the tumor mass reaches a critical value M{sub ∗}, over the class of admissible radiation times and doses. We present theoretical and numerical results that justify the relevance of the model and the existence of potential medical applications.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Optimizing colormaps with consideration for color vision deficiency to enable accurate interpretation of scientific data

Color vision deficiency (CVD) affects more than 4% of the population and leads to a different visual perception of colors. Though this has been known for decades, colormaps with many colors across the visual spectra are often used to represent data, leading to the potential for misinterpretation or difficulty with interpretation by someone with this deficiency. Until the creation of the module presented here, there were no colormaps mathematically optimized for CVD using modern color appearance models. While there have been some attempts to make aesthetically pleasing or subjectively tolerable colormaps for those with CVD, our goal was to make optimized colormaps for the most accurate perception of scientific data by as many viewers as possible. We developed a Python module, cmaputil , to create CVD-optimized colormaps, which imports colormaps and modifies them to be perceptually uniform in CVD-safe colorspace while linearizing and maximizing the brightness range. The module is made available to the science community to enable others to easily create their own CVD-optimized colormaps. In this paper, we present an example CVD-optimized colormap created with this module that is optimized for viewing by those without a CVD as well as those with red-green colorblindness. This colormap, cividis, enables nearly-identical visual-data interpretation to both groups, is perceptually uniform in hue and brightness, and increases in brightness linearly.

59 BASIC BIOLOGICAL SCIENCES↗

Can search algorithms save large-scale automatic performance tuning?

Empirical performance optimization of computer codes using autotuners has received significant attention in recent years. Given the increased complexity of computer architectures and scientific codes, evaluating all possible code variants is prohibitively expensive for all but the simplest kernels. One way for autotuners to overcome this hurdle is through use of a search algorithm that finds high-performing code variants while examining relatively few variants. In this paper we examine the search problem in autotuning from a mathematical optimization perspective. As an illustration of the power and limitations of this optimization, we conduct an experimental study of several optimization algorithms on a number of linear algebra kernel codes. We find that the algorithms considered obtain performance gains similar to the optimal ones found by complete enumeration or by large random searches but in a tiny fraction of the computation time.

97 MATHEMATICS AND COMPUTING↗