Runner System Balancing for Injection Molds Using Approximation Concepts and Numerical Optimization

Author(s):  
Rohinton K. Irani ◽  
Srinivas Kodiyalam ◽  
David O. Kazmer

Abstract The goal during runner balancing is to vary the diameters of the runner segments such that all the cavities, in a multi-cavity injection mold, fill at the same time. If the runner system is unbalanced, some cavities will fill before others, begin to overpack, and result in material wastage and inconsistent part quality. Numerical optimization methods and finite element mold-filling simulation are used to solve this nonlinear discrete variable problem. Approximation concepts are used to reduce the computational effort required for solving this iterative problem. This automated system has been successfully tested on a number of family molds.

Author(s):  
Kazufumi Ito ◽  
Karl Kunisch

Abstract In this paper we discuss applications of the numerical optimization methods for nonsmooth optimization, developed in [IK1] for the variational formulation of image restoration problems involving bounded variation type energy criterion. The Uzawa’s algorithm, first order augmented Lagrangian methods and Newton-like update using the active set strategy are described.


Author(s):  
R. Ellsworth ◽  
A. Parkinson ◽  
F. Cain

Abstract In many engineering design problems, the designer converges upon a good design by iteratively evaluating a mathematical model of the design problem. The trial-and-error method used by the designer to converge upon a solution may be complex and difficult to capture in an expert system. It is suggested that in many cases, the design rule base could be made significantly smaller and more maintainable by using numerical optimization methods to identify the best design. The expert system is then used to define the optimization problem and interpret the solution, as well as to apply the true heuristics to the problem. An example of such an expert system is presented for the design of a valve anti-cavitation device. Because of the capabilities provided by the optimization software, the expert system has been able to outperform the expert in the test cases evaluated so far.


1990 ◽  
Vol 20 (7) ◽  
pp. 961-969 ◽  
Author(s):  
Lauri T. Valsta

A two-species, whole-stand, deterministic growth model was combined with three optimization methods to derive management regimes for species composition, thinnings, and rotation age, with the objective of maximizing soil expectation value. The methods compared were discrete time – discrete state dynamic programming, direct search using the Hooke and Jeeves algorithm, and random search. Optimum solutions for each of the methods varied considerably, required unequal amounts of computational time, and were not equally stable. Dynamic programming located global optimal solutions but did not determine them accurately, owing to discretized state space. Direct search yielded the largest objective function values with comparable computational effort, although the likelihood of finding a global optimum solution was high only for smaller problems with up to two or three thinnings during the rotation. Random search solutions varied considerably with regard to growing stock level and species composition and did not define a consistent management guideline. In general, direct search and dynamic programming appeared to be superior to random search.


Author(s):  
Michael Benz ◽  
Markus Hehn ◽  
Christopher H. Onder ◽  
Lino Guzzella

This paper proposes a novel optimization method that allows a reduction in the pollutant emission of diesel engines during transient operation. The key idea is to synthesize optimal actuator commands using reliable models of the engine system and powerful numerical optimization methods. The engine model includes a mean-value engine model for the dynamics of the gas paths, including the turbocharger of the fuel injection, and of the torque generation. The pollutant formation is modeled using an extended quasi-static modeling approach. The optimization substantially changes the input signals, such that the engine model is enabled to extrapolate all relevant outputs beyond the regular operating area. A feedforward controller for the injected fuel mass is used to eliminate the nonlinear path constraints during the optimization. The model is validated using experimental data obtained on a transient engine test bench. A direct single shooting method is found to be most effective for the numerical optimization. The results show a significant potential for reducing the pollutant emissions during transient operation of the engine. The optimized input trajectories derived assist the design of sophisticated engine control systems.


2014 ◽  
Vol 59 (4) ◽  
pp. 1-16 ◽  
Author(s):  
Bérénice Mettler ◽  
Zhaodan Kong ◽  
Chad Goerzen ◽  
Matthew Whalley

This paper describes a framework for performance evaluation of autonomous guidance systems. The elements of the framework consist of a set of spatial geometries, flight tasks, performance metrics, a flightdynamic model, and baseline solutions. The spatial benchmarks consist of six tasks in simple geometrical environments and 10 tasks in more complex urban environments based on a real digital terrain elevation map. The framework also includes a set of performance metrics used to compare trajectories. The performance baselines used in the proposed framework are near-optimal solutions computed using one of two trajectory optimization methods: numerical optimization based on nonlinear programming for the simple geometric environments and a motion primitive automaton for problems involving the urban environments. The paper concludes with a demonstration of the benchmarking framework using the Obstacle Field Navigation system developed by the Army Aeroflightdynamics Directorate.


2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Lihong Guo ◽  
Gai-Ge Wang ◽  
Heqi Wang ◽  
Dinan Wang

A hybrid metaheuristic approach by hybridizing harmony search (HS) and firefly algorithm (FA), namely, HS/FA, is proposed to solve function optimization. In HS/FA, the exploration of HS and the exploitation of FA are fully exerted, so HS/FA has a faster convergence speed than HS and FA. Also, top fireflies scheme is introduced to reduce running time, and HS is utilized to mutate between fireflies when updating fireflies. The HS/FA method is verified by various benchmarks. From the experiments, the implementation of HS/FA is better than the standard FA and other eight optimization methods.


Author(s):  
S.P. Levashkin ◽  
S.N. Agapov ◽  
O.I. Zakharova ◽  
K.N. Ivanov ◽  
E.S. Kuzmina ◽  
...  

A systemic approach to the study of a new multi-parameter model of the COVID-19 pandemic spread is proposed, which has the ultimate goal of optimizing the manage parameters of the model. The approach consists of two main parts: 1) an adaptive-compartmental model of the epidemic spread, which is a generalization of the classical SEIR model, and 2) a module for adjusting the parameters of this model from the epidemic data using intelligent optimization methods. Data for testing the proposed approach using the pandemic spread in some regions of the Russian Federation were collected on a daily basis from open sources during the first 130 days of the epidemic, starting in March 2020. For this, a so-called data farm was developed and implemented on a local server (an automated system for collecting, storing and preprocessing data from heterogeneous sources, which, in combination with optimization methods, allows most accurately tune the parameters of the model, thus turning it into an intelligent system to support management decisions). Among all model parameters used, the most important are the rate of infection transmission, the government actions and the population reaction.


Sign in / Sign up

Export Citation Format

Share Document