Discrete optimizing.
Discrete optimization problem approach and evaluation of results of applying it to variety of traveling salesman problems
SEARCH · Search NASA
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.
Discrete optimization problem approach and evaluation of results of applying it to variety of traveling salesman problems
Discrete-optimal model-reduction techniques such as the Gauss{Newton with Approximated Tensors (GNAT) method have shown promise, as they have generated stable, accurate solutions for large-scale turbulent, compressible ow problems where standard Galerkin techniques have failed. However, there has been limited comparative analysis of the two approaches. This is due in part to difficulties arising from the fact that Galerkin techniques perform projection at the time-continuous level, while discrete-optimal techniques do so at the time-discrete level. This work provides a detailed theoretical and experimental comparison of the two techniques for two common classes of time integrators: linear multistep schemes and Runge{Kutta schemes. We present a number of new ndings, including conditions under which the discrete-optimal ROM has a time-continuous representation, conditions under which the two techniques are equivalent, and time-discrete error bounds for the two approaches. Perhaps most surprisingly, we demonstrate both theoretically and experimentally that decreasing the time step does not necessarily decrease the error for the discrete-optimal ROM; instead, the time step should be `matched' to the spectral content of the reduced basis. In numerical experiments carried out on a turbulent compressible- ow problem with over one million unknowns, we show that increasing the time step to an intermediate value decreases both the error and the simulation time of the discrete-optimal reduced-order model by an order of magnitude.
Optimal discrete control strategy for terminal guidance using computation procedure based on theory of dynamic programming
Not provided.
Primal and dual algorithms for discrete optimal control incorporating antijamming procedures
This archive contains data related to the paper, "A framework for discrete optimization of stellarator coils", published in Nuclear Fusion (https://doi.org/10.1088/1741-4326/adbb02). Included are data plotted in the figures, as well as scripts for reproducing the results in the paper.
Applying method of stochastic algorithms to solution of discrete optimization problems
Numerical optimization is a powerful method for identifying energy-efficient building designs. Automating the search process facilitates the evaluation of many more options than is possible with one-off parametric simulation runs. However, input data uncertainties and qualitative aspects of building design work against standard optimization formulations that return a single, so-called optimaldesign. This paper presents a method for harnessing a discrete optimization algorithm to obtain significantly different, economically viable building designs that satisfy an energy efficiency goal. The method is demonstrated using NREL's first-generation building analysis platform, Opt- E-Plus, and two example problems. We discuss the information content of the results, and the computationaleffort required by the algorithm.
Designing magnets for three-dimensional plasma confinement is a key task for advancing the stellarator as a fusion reactor concept. Stellarator magnets must produce an accurate field while leaving adequate room for other components and being reasonably simple to construct and assemble. In this paper, a framework for coil design and optimization is introduced that enables the attainment of sparse magnet solutions with arbitrary restrictions on where coils may be located. The solution space is formulated as a 'wireframe' consisting of a mesh of interconnected wire segments enclosing the plasma. Two methods are developed for optimizing the current distribution on a wireframe: Regularized Constrained Least Squares, which uses a linear least-squares approach to optimize the currents in each segment, and Greedy Stellarator Coil Optimization, a fully discrete procedure in which loops of current are added to the mesh one by one to achieve the desired magnetic field on the plasma boundary. Examples are presented of solutions obtainable with each method, some of which achieve high field accuracy while obeying spatial constraints that permit easy assembly.
This report presents an application of the recently developed theory of optimal Discrete Event Supervisory (DES) control that is based on a signed real measure of regular languages. The DES control techniques are validated on an aircraft gas turbine engine simulation test bed. The test bed is implemented on a networked computer system in which two computers operate in the client-server mode. Several DES controllers have been tested for engine performance and reliability.
The stochastic, infinite time, discrete output feedback problem for time invariant linear systems is examined. Two sets of sufficient conditions for the existence of a stable, globally optimal solution are presented. An expression for the total change in the cost function due to a change in the feedback gain is obtained. This expression is used to show that a sequence of gains can be obtained by an algorithm, so that the corresponding cost sequence is monotonically decreasing and the corresponding sequence of the cost gradient converges to zero. The algorithm is guaranteed to obtain a critical point of the cost function. The computational steps necessary to implement the algorithm on a computer are presented. The results are applied to a digital outer loop flight control problem. The numerical results for this 13th order problem indicate a rate of convergence considerably faster than two other algorithms used for comparison.
A two-time scale discrete control system is considered. The closed-loop optimal linear quadratic (LQ) regulator for the system requires the solution of a full-order algebraic matrix Riccati equation. Alternatively, the original system is decomposed into reduced-order slow and fast subsystems. The closed-loop optimal control of the subsystems requires the solution of two algebraic matrix Riccati equations of order lower than that required for the full-order system. A composite, closed-loop suboptimal control is created from the sum of the slow and fast feedback optimal controls. Numerical results obtained for an aircraft model show a very close agreement between the exact (optimal) solutions and computationally simpler composite (suboptimal) solutions. The main advantage of the method is the considerable reduction in the overall computational requirements for the closed-loop optimal control of digital flight systems.
Explore the source record for details and available documents.
Description of a computer-oriented technique to generate the necessary control inputs to guide an aircraft in a given time from a given initial state to a prescribed final state subject to the constraints on airspeed, acceleration, and pitch and bank angles of the aircraft. A discrete-time mathematical model requiring five state variables and three control variables is obtained, assuming steady wind and zero sideslip. The guidance problem is posed as a discrete nonlinear optimal control problem with a cost functional of Bolza form. A solution technique for the control problem is investigated, and numerical examples are presented. It is believed that this approach should prove to be useful in automated air traffic control schemes near large terminal areas.
Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing this field of research, this manuscript has three distinct purposes. First, we present an intuitive method for synthesizing and analyzing discrete (i.e., integer-based) optimization problems, wherein the problem and corresponding algorithmic primitives are expressed using a discrete quantum intermediate representation (DQIR) that is encoding-independent. This compact representation often allows for more efficient problem compilation, automated analyses of different encoding choices, easier interpretability, more complex runtime procedures, and richer programmability, as compared to previous approaches, which we demonstrate with a number of examples. Second, we perform numerical studies comparing several qubit encodings; the results exhibit a number of preliminary trends that help guide the choice of encoding for a particular set of hardware and a particular problem and algorithm. Our study includes problems related to graph coloring, the traveling salesperson problem, factory/machine scheduling, financial portfolio rebalancing, and integer linear programming. Third, we design low-depth graph-derived partial mixers (GDPMs) up to 16-level quantum variables, demonstrating that compact (binary) encodings are more amenable to QAOA than previously understood. We expect this toolkit of programming abstractions and low-level building blocks to aid in designing quantum algorithms for discrete combinatorial problems.
A numerical method is presented for the solution of nonlinear discrete optimization problems. The applicability of discrete optimization to engineering design is discussed, and several standard structural optimization problems are solved using discrete design variables. The method uses approximation techniques to create subproblems suitable for linear mixed-integer programming methods. The method employs existing software for continuous optimization and integer programming.
In this manuscript we have examined an extension of BCB that encompasses a mix of continuous and quasi-discrete, as well as truly-discrete applications. FVe began by testing two refinements to the discrete version of BCB. The testing of midpoint versus fitness (Tables 1 and 2) proved inconclusive. The testing of discrete normal tails versus standard mutation showed was conclusive and demonstrated that the discrete normal tails are better. Next, we implemented these refinements in a combined continuous and discrete BCB and compared the performance of two discrete distance on the hub problem. Here we found when "order does matter" it pays to take it into account.
A method for synthesizing digital active flutter suppression controllers using the concept of optimal output feedback is presented. A recently developd convergent algorithm is employed to determine constrained control law parameters that minimize an infinite-time discrete quadratic performance index. Low-order compensator dynamics are included in the control law and the compensator parameters are computed along with the output feedback gain as part of the optimization process. An input noise adjustment procedure is used to improve the stability margins of the digital active flutter controller. Results from investigations into sample rate variation, prefilter pole variation, and effects of varying flight condtions are discussed. The study indicates that a digital control law which accommodates computation delay can stabilize the wing with reasonable rms performance and adequate stability margins.