Design Optimization Method for MR-Brake Actuators

2011 ◽  
Author(s):  
Ozan G. Erol ◽  
Hakan Gurocak ◽  
Berk Gonenc
Keyword(s):  
Optimal Solution ◽  
Volume Ratio ◽  
Optimization Methods ◽  
Search Space ◽  
Optimization Method ◽  
Friction Torque ◽  
Element Analysis ◽  
Taguchi Design Of Experiments ◽  
Variable Friction ◽  
Electronically Controllable

MR-brakes work by varying viscosity of a magnetorheological (MR) fluid inside the brake. This electronically controllable viscosity leads to variable friction torque generated by the actuator. A properly designed MR-brake can have a high torque-to-volume ratio which is quite desirable for an actuator. However, designing an MR-brake is a complex process as there are many parameters involved in the design which can affect the size and torque output significantly. The contribution of this study is a new design approach that combines the Taguchi design of experiments method with parameterized finite element analysis for optimization. Unlike the typical multivariate optimization methods, this approach can identify the dominant parameters of the design and allows the designer to only explore their interactions during the optimization process. This unique feature reduces the size of the search space and the time it takes to find an optimal solution. It normally takes about a week to design an MR-brake manually. Our interactive method allows the designer to finish the design in about two minutes. In this paper, we first present the details of the MR-brake design problem. This is followed by the details of our new approach. Next, we show how to design an MR-brake using this method. Prototype of a new brake was fabricated. Results of experiments with the prototype brake are very encouraging and are in close agreement with the theoretical performance predictions.

Taguchi Methodology to Optimize the Design of a MR-Brake With Permanent Magnet

2012 ◽  
Author(s):  
Ozan Erol ◽  
Hakan Gurocak
Keyword(s):  
Permanent Magnet ◽  
Volume Ratio ◽  
Search Space ◽  
Friction Torque ◽  
Optimization Techniques ◽  
Design Parameters ◽  
Physical Factors ◽  
Optimization Approach ◽  
Taguchi Optimization ◽  
Element Analysis

Magnetorheological (MR) brakes provide variable friction torque by electronically changing the viscosity of a magnetic fluid inside the actuator. The MR-brakes have many desirable characteristics, such as high torque-to-volume ratio, inherent stability and ease of control. However, the design process of such an actuator is complex and time consuming due to many parameters involved in the design, including geometric and physical factors and their interactions. The first contribution of this research is a new optimization approach where we combined the Taguchi optimization method with parameterized magnetic finite element analysis. Unlike other optimization techniques, this method can identify the dominant parameters of the design and investigate their interactions with the design output while reducing the search space and the design time. The second contribution is the design optimization of a novel MR-brake, which incorporates a serpentine flux path and a permanent magnet. To the best of our knowledge, this is the first such MR-brake. The new MR-brake design provides a fail-safe feature while reducing the volume by decreasing the number of coil turns required. Results showed that some of the geometric parameters and the current have the most significant effect on the torque output out of the 12 design parameters.

scholarly journals A two-stage evolutionary optimization approach for an irrigation system design

2016 ◽  
Vol 19 (1) ◽  
pp. 115-122 ◽  
Author(s):  
Milan Cisty ◽  
Zbynek Bajtek ◽  
Lubomir Celar
Keyword(s):  
Water Distribution ◽  
Irrigation System ◽  
Optimal Solution ◽  
Water Distribution Network ◽  
Search Space ◽  
Optimization Method ◽  
Global Optimum ◽  
Optimization Approach ◽  
Nsga Ii ◽  
Irrigation Network

In this work, an optimal design of a water distribution network is proposed for large irrigation networks. The proposed approach is built upon an existing optimization method (NSGA-II), but the authors are proposing its effective application in a new two-step optimization process. The aim of the paper is to demonstrate that not only is the choice of method important for obtaining good optimization results, but also how that method is applied. The proposed methodology utilizes as its most important feature the ensemble approach, in which more optimization runs cooperate and are used together. The authors assume that the main problem in finding the optimal solution for a water distribution optimization problem is the very large size of the search space in which the optimal solution should be found. In the proposed method, a reduction of the search space is suggested, so the final solution is thus easier to find and offers greater guarantees of accuracy (closeness to the global optimum). The method has been successfully tested on a large benchmark irrigation network.

Nesting Arbitrary Shapes Using Geometric Mating

2002 ◽  
Vol 2 (3) ◽  
pp. 171-178
Author(s):  
Chan Yu ◽  
Souran Manoochehri
Keyword(s):  
Optimization Problem ◽  
Optimal Solution ◽  
Computation Time ◽  
Search Space ◽  
Optimization Method ◽  
The Other ◽  
Reasonable Time ◽  
Common Features ◽  
Object Relative ◽  
Arbitrary Shapes

A genetic algorithm-based optimization method is proposed for solving the problem of nesting arbitrary shapes. Depending on the number of objects and the size of the search space, realizing an optimal solution within a reasonable time may not be possible. In this paper, a mating concept is introduced to reduce the solution time. Mating between two objects is defined as the positioning of one object relative to the other by merging common features that are assigned by the mating condition between them. A constrained move set is derived from a mating condition that allows the transformation of the object in each mating pair to be fully constrained with respect to the other. Properly mated objects can be placed together, thus reducing the overall computation time. Several examples are presented to demonstrate the efficiency of utilizing the mating concept to solve a nesting optimization problem.

A New Global Optimization Method for Simultaneous Computation on Expensive Black-Box Functions

2003 ◽  
Author(s):  
Liqun Wang ◽  
Songqing Shan ◽  
G. Gary Wang
Keyword(s):  
Global Optimization ◽  
Optimization Problems ◽  
Optimization Methods ◽  
Search Space ◽  
Optimization Method ◽  
Global Optimum ◽  
Black Box ◽  
Efficient Global Optimization ◽  
Global Optimization Method ◽  
Global Optimization Methods

The presence of black-box functions in engineering design, which are usually computation-intensive, demands efficient global optimization methods. This work proposes a new global optimization method for black-box functions. The global optimization method is based on a novel mode-pursuing sampling (MPS) method which systematically generates more sample points in the neighborhood of the function mode while statistically covers the entire search space. Quadratic regression is performed to detect the region containing the global optimum. The sampling and detection process iterates until the global optimum is obtained. Through intensive testing, this method is found to be effective, efficient, robust, and applicable to both continuous and discontinuous functions. It supports simultaneous computation and applies to both unconstrained and constrained optimization problems. Because it does not call any existing global optimization tool, it can be used as a standalone global optimization method for inexpensive problems as well. Limitation of the method is also identified and discussed.

S-Metaheuristics Approach to Solve Traveling Salesman Problem

Jurnal METRIS ◽  
2020 ◽  
Vol 21 (02) ◽  
pp. 111-115
Author(s):  
Agung Chandra ◽  
Aulia Naro
Keyword(s):  
State Of The Art ◽  
Optimal Solution ◽  
Optimization Methods ◽  
Optimization Method ◽  
Complex Problem ◽  
Traveling Salesman ◽  
Solution Technique ◽  
Metaheuristic Algorithm ◽  
Shortest Distance ◽  
Single Solution

Metaheuristic algorithm is a state of the art optimization method which suitable for solving large and complex problem. Single solution technique – Smetaheuristic is one of metaheuristic algorithm that search near optimal solution and known as exploitation based. The research conducted to seek a better solution for deliverying goods to 29 destinations by comparing two well known optimization methods that can produce the shortest distance: Simulated Annealing (SA) and Tabu Search (TS). The result shows that TS – 107 KM has a shorter distance than SA – 119 KM. Exploration based method should be conducted for next research to produce information in which one is a better method

Comparative Study of Different Optimization Algorithms Used for Obtaining Diesel-Biodiesel Blends

2019 ◽  
Vol 70 (6) ◽  
pp. 1893-1896
Author(s):  
Stefan Sandru ◽  
Ion Onutu
Keyword(s):  
Artificial Intelligence ◽  
Genetic Algorithms ◽  
Linear Programming ◽  
Classical Method ◽  
Optimal Solution ◽  
Optimization Methods ◽  
Optimization Method ◽  
Biodiesel Blends ◽  
Dual Simplex ◽  
Linear Programming Problems

The purpose of this paper is to compare two different optimization methods, used in acquiring diesel-biodiesel blends. There were used five types of samples in order to enable the optimization of the final blend: there were chosen two types of hydrofined diesel fuel and there were synthesized three original types of biodiesel. The first optimization method used, dual simplex, is a classical method being used in solving linear programming problems. The second optimization method, the genetic algorithms, falls in the type of artificial intelligence algorithms, being an evolutionary method used when the problem requires searching an optimal solution in a great variety of valid solutions.

scholarly journals Designation of Candidate Solutions in Differential Evolution Based on Bandit Algorithm and its Evaluation

2019 ◽  
Vol 23 (4) ◽  
pp. 758-766
Author(s):  
Masaya Sakakibara ◽  
◽  
Akira Notsu ◽  
Seiki Ubukata ◽  
Katsuhiro Honda
Keyword(s):  
Differential Evolution ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Random Search ◽  
Optimal Solution ◽  
Search Space ◽  
Optimization Method ◽  
Local Solution ◽  
Search Speed ◽  
Mathematical Programming Problems

We propose UCT-Grid Area Search (UCT-GAS), which is an efficient optimization method that roughly estimates specific values in areas, and consider exploration and exploitation in optimization problems. This approach divides the search space and imagines it to be a multi-armed bandit, which enables us to use bandit algorithms to solve mathematical programming problems. Although the search speed is fast than other search algorithm like differential evolution, it might converge to a local solution. In this study, we improve this algorithm by replacing its random search part with differential evolution after several searches. Comparative experiments confirmed the search ability of the optimal solution, and our method benefits by showing that it avoids falling into a local solution and that its search speed is fast.

scholarly journals Architectural Models Enabled Dynamic Optimization for System-of-Systems Evolution

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Zhemei Fang ◽  
Xiaozhou Zhou ◽  
Ani Song
Keyword(s):  
Dynamic Optimization ◽  
Systems Engineering ◽  
Conceptual Models ◽  
Mathematical Optimization ◽  
Optimal Solution ◽  
Optimization Methods ◽  
Optimization Method ◽  
System Of Systems ◽  
Architectural Representation ◽  
Architecture Framework

System of Systems (SoS) is designed to deliver value to participant stakeholders in a dynamic and uncertain environment where new systems are added and current systems are removed continuously and on their own volition. This requires effective evolution management at the SoS architectural level with adequate support of process, methods, and tools. This paper follows the principle of Model-Based Systems Engineering (MBSE) and develops a holistic framework integrating MBSE conceptual representations and approximate dynamic programming (ADP) to support the SoS evolution. The conceptual models provide a common architectural representation to improve communication between various decision makers while the dynamic optimization method suggests evolution planning decisions from the analytical perspective. The Department of Defense Architecture Framework (DoDAF) models using Systems Modeling Language (SysML) are used as MBSE artifacts to connect with ADP modeling elements through DoDAF metamodels to increase information traceability and reduce unnecessary information loss. Using a surface warfare SoS as an example, this paper demonstrates and explains the procedures of developing DoDAF models, mapping DoDAF models to ADP elements, formulating ADP formulation, and generating evolutionary decisions. The effectiveness of using ADP in supporting evolution to achieve a near-optimal solution that can maximize the SoS capability over time is illustrated by comparing ADP solution to other alternative solutions. The entire framework also sheds light on bridging the DoDAF-based conceptual models and other mathematical optimization methods.

scholarly journals Urban Drainage Network Rehabilitation Considering Storm Tank Installation and Pipe Substitution

Water ◽  
2019 ◽  
Vol 11 (3) ◽  
pp. 515 ◽  
Author(s):  
Ulrich Ngamalieu-Nengoue ◽  
Pedro Iglesias-Rey ◽  
F. Martínez-Solano ◽  
Daniel Mora-Meliá ◽  
Juan Saldarriaga Valderrama
Keyword(s):  
Cost Optimization ◽  
Optimal Solution ◽  
Optimization Methods ◽  
Optimization Method ◽  
Drainage Network ◽  
Storm Water Management Model ◽  
Drainage Networks ◽  
Combined Use ◽  
The City ◽  
Swmm Model

The drainage networks of our cities are currently experiencing a growing increase in runoff flows, caused mainly by the waterproofing of the soil and the effects of climate change. Consequently, networks originally designed correctly must endure floods with frequencies much higher than those considered in the design phase. The solution of such a problem is to improve the network. There are several ways to rehabilitate a network: conduit substitution as a former method or current methods such as storm tank installation or combined use of conduit substitution and storm tank installation. To find an optimal solution, deterministic or heuristic optimization methods are used. In this paper, a methodology for the rehabilitation of these drainage networks based on the combined use of the installation of storm tanks and the substitution of some conduits of the system is presented. For this, a cost-optimization method and a pseudo-genetic heuristic algorithm, whose efficiency has been validated in other fields, are applied. The Storm Water Management Model (SWMM) model for hydraulic analysis of drainage and sanitation networks is used. The methodology has been applied to a sector of the drainage network of the city of Bogota in Colombia, showing how the combined use of storm tanks and conduits leads to lower cost rehabilitation solutions.

scholarly journals The Hybrid Invasive Weed Optimization-Shuffled Frog-leaping Algorithm Applied to Optimal Design of Frame Structures

2019 ◽  
Author(s):  
Ali Kaveh ◽  
Siamak Talatahari ◽  
Nima Khodadadi
Keyword(s):  
Optimization Algorithm ◽  
Optimal Solution ◽  
Optimization Methods ◽  
Optimization Method ◽  
Population Based ◽  
Frame Structures ◽  
Invasive Weed Optimization ◽  
Shuffled Frog Leaping Algorithm ◽  
Invasive Weed ◽  
Shuffled Frog Leaping

In this article, an efficient hybrid optimization algorithm based on invasive weed optimization algorithm and shuffled frog-leaping algorithm is utilized for optimum design of skeletal frame structures. The shuffled frog-leaping algorithm is a population-based cooperative search metaphor inspired by natural memetic, and the invasive weed optimization algorithm is an optimization method based on dynamic growth of weeds colony. In the proposed algorithm, shuffled frog-leaping algorithm works to find optimal solution region rapidly, and invasive weed optimization performs the global search. Different benchmark frame structures are optimized using the new hybrid algorithm. Three design examples are tested using the new method. This algorithm converges to better or at least the same solutions compared the utilized methods with a smaller number of analyses. The outcomes are compared to those obtained previously using other recently developed meta-heuristic optimization methods.

Sign in / Sign up

Export Citation Format

Share Document