Optimization of constrained mechanical design problems using the equilibrium optimization algorithm

2021 ◽  
Vol 63 (6) ◽  
pp. 552-559
Author(s):  
Hammoudi Abderazek ◽  
Ali Riza Yildiz ◽  
Sadiq M. Sait
Keyword(s):  
Optimization Algorithm ◽  
Thrust Bearing ◽  
Mechanical Design ◽  
The Other ◽  
Truss Structure ◽  
Computational Results ◽  
Design Problems ◽  
Planetary Gearbox ◽  
Robot Gripper

Abstract In this work, the optimization of structural and mechanical problems is carried out using the equilibrium optimizer (EO), which is a recent physical-based algorithm.The the ten-bar planar truss structure, planetary gearbox, hydrostatic thrust bearing, and robot gripper mechanism problems are solved using the EO algorithm. The results achieved using the EO in solving these problems are compared with those of recent algorithms. The computational results show that EO yields better outcomes and competitive results that can also be applied for the other problems studied.

Improved Grey Wolf Optimization Algorithm for Constrained Mechanical Design Problems

2016 ◽  
Vol 851 ◽  
pp. 553-558 ◽  
Author(s):  
Jian Chun Yang ◽  
Wen Long
Keyword(s):  
Optimization Algorithm ◽  
State Of The Art ◽  
Mechanical Design ◽  
Grey Wolf ◽  
Convergence Factor ◽  
Grey Wolf Optimization ◽  
Design Problems ◽  
Tournament Selection ◽  
Simulation Results

An improved grey wolf optimization (IGWO) algorithm is proposed for solving constrained mechanical design problems in this paper. In proposed IGWO algorithm, a novel nonlinearly update equation of convergence factor based on sines function is presented to balance the exploration ability and exploitation ability. The feasibility-based rules based on tournament selection was introduced to handle constrains. Simulation results and comparisons with other state-of-the-art algorithms using three constrained mechanical design problems are provided.

Robust design of a robot gripper mechanism using new hybrid grasshopper optimization algorithm

2021 ◽  
Author(s):  
Betül Sultan Yildiz ◽  
Nantiwat Pholdee ◽  
Sujin Bureerat ◽  
Ali Riza Yildiz ◽  
Sadiq M. Sait
Keyword(s):  
Robust Design ◽  
Optimization Algorithm ◽  
Robot Gripper ◽  
Grasshopper Optimization Algorithm ◽  
Grasshopper Optimization

The Numerical Analysis of the Velocity and Pressure Distribution of the Oil Film in Heavy Hydrostatic Thrust Bearing

2014 ◽  
Vol 541-542 ◽  
pp. 658-662
Author(s):  
Jian Li ◽  
Yuan Chen ◽  
Yang Chun Yu ◽  
Zhu Xin Tian ◽  
Yu Huang
Keyword(s):  
Mathematical Model ◽  
Numerical Analysis ◽  
Pressure Distribution ◽  
Working Conditions ◽  
Thrust Bearing ◽  
Rotation Speed ◽  
The Other ◽  
Surface Load ◽  
Oil Film ◽  
Volume Method

To study the velocity and pressure distribution of the oil film in a heavy hydrostatic thrust bearing, a mathematical model of the velocity is proposed and the finite volume method (FVM) has been used to simulate the flow field under different working conditions. Some pressure experiments were carried out and the results verified the correctness of the simulation. It is concluded that the pressure distribution varies small under different rotation speed when the surface load on the workbench is constant. But the velocity of the oil film is influenced greatly by the rotation speed. When the rotation speed of the workbench is as quick as enough, the velocity of the oil film on one radial side of the pad will be zero, that is to say the lubrication oil will be drained from the other three sides of the recess.

scholarly journals A Novel Approach to Oil Layer Recognition Model Using Whale Optimization Algorithm and Semi-Supervised SVM

Symmetry ◽  
2021 ◽  
Vol 13 (5) ◽  
pp. 757
Author(s):  
Yongke Pan ◽  
Kewen Xia ◽  
Li Wang ◽  
Ziping He
Keyword(s):  
Optimization Algorithm ◽  
Oil And Gas ◽  
The Other ◽  
Whale Optimization Algorithm ◽  
Classification Model ◽  
Support Vector ◽  
Recognition Model ◽  
Novel Approach ◽  
Whale Optimization ◽  
Oil And Gas Reservoir

The dataset distribution of actual logging is asymmetric, as most logging data are unlabeled. With the traditional classification model, it is hard to predict the oil and gas reservoir accurately. Therefore, a novel approach to the oil layer recognition model using the improved whale swarm algorithm (WOA) and semi-supervised support vector machine (S3VM) is proposed in this paper. At first, in order to overcome the shortcomings of the Whale Optimization Algorithm applied in the parameter-optimization of the S3VM model, such as falling into a local optimization and low convergence precision, an improved WOA was proposed according to the adaptive cloud strategy and the catfish effect. Then, the improved WOA was used to optimize the kernel parameters of S3VM for oil layer recognition. In this paper, the improved WOA is used to test 15 benchmark functions of CEC2005 compared with five other algorithms. The IWOA–S3VM model is used to classify the five kinds of UCI datasets compared with the other two algorithms. Finally, the IWOA–S3VM model is used for oil layer recognition. The result shows that (1) the improved WOA has better convergence speed and optimization ability than the other five algorithms, and (2) the IWOA–S3VM model has better recognition precision when the dataset contains a labeled and unlabeled dataset in oil layer recognition.

Proving the Labeled Interval Calculus for Inferences on Catalogs

1990 ◽  
Author(s):  
Walid Habib ◽  
Allen C. Ward
Keyword(s):  
Mechanical Design ◽  
Formal System ◽  
Constraint Propagation ◽  
Operating Conditions ◽  
Manufacturing Processes ◽  
Entire System ◽  
High Level Language ◽  
Design Problems ◽  
High Level ◽  
Interval Constraint

Abstract The “labeled interval calculus” is a formal system that performs quantitative inferences about sets of artifacts under sets of operating conditions. It refines and extends the idea of interval constraint propagation, and has been used as the basis of a program called a “mechanical design compiler,” which provides the user with a “high level language” in which design problems for systems to be built of cataloged components can be quickly and easily formulated. The compiler then selects optimal combinations of catalog numbers. Previous work has tested the calculus empirically, but only parts of the calculus have been proven mathematically. This paper presents a new version of the calculus and shows how to extend the earlier proofs to prove the entire system. It formalizes the effects of toleranced manufacturing processes through the concept of a “selectable subset” of the artifacts under consideration. It demonstrates the utility of distinguishing between statements which are true for all artifacts under consideration, and statements which are merely true for some artifact in each selectable subset.

The Mechanical Design of Large Turbogenerators

1987 ◽  
Vol 201 (2) ◽  
pp. 91-103
Author(s):  
B A Marlow
Keyword(s):  
High Speed ◽  
Mechanical Design ◽  
Rotating Machinery ◽  
Design Problems ◽  
Detail Design ◽  
Insight Into

Experience shows that the reliability of large turbogenerators depends substantially on the quality of detail design, particularly the quality of the mechanical design. In addition to the design problems common to all high-speed rotating machinery, the mechanical design of generators must take account of certain electrical requirements. This paper gives an insight into the detail mechanical design of large turbogenerators paying particular attention to the interaction of electrical requirements on the mechanical design.

scholarly journals Performance Comparison of Recent Population-Based Metaheuristic Optimisation Algorithms in Mechanical Design Problems of Machinery Components

Machines ◽  
2021 ◽  
Vol 9 (12) ◽  
pp. 341
Author(s):  
Bugra Alkan ◽  
Malarvizhi Kaniappan Chinnathai
Keyword(s):  
Engineering Design ◽  
Mechanical Design ◽  
Search Algorithm ◽  
Computation Time ◽  
Population Based ◽  
Performance Comparison ◽  
Design Problems ◽  
Component Design ◽  
Engineering Design Problems ◽  
Optimisation Algorithms

The optimisation of complex engineering design problems is highly challenging due to the consideration of various design variables. To obtain acceptable near-optimal solutions within reasonable computation time, metaheuristics can be employed for such problems. However, a plethora of novel metaheuristic algorithms are developed and constantly improved and hence it is important to evaluate the applicability of the novel optimisation strategies and compare their performance using real-world engineering design problems. Therefore, in this paper, eight recent population-based metaheuristic optimisation algorithms—African Vultures Optimisation Algorithm (AVOA), Crystal Structure Algorithm (CryStAl), Human-Behaviour Based Optimisation (HBBO), Gradient-Based Optimiser (GBO), Gorilla Troops Optimiser (GTO), Runge–Kutta optimiser (RUN), Social Network Search (SNS) and Sparrow Search Algorithm (SSA)—are applied to five different mechanical component design problems and their performance on such problems are compared. The results show that the SNS algorithm is consistent, robust and provides better quality solutions at a relatively fast computation time for the considered design problems. GTO and GBO also show comparable performance across the considered problems and AVOA is the most efficient in terms of computation time.

scholarly journals An evolutionary-based optimization algorithm for truss sizing design

2016 ◽  
Vol 38 (4) ◽  
pp. 307-317
Author(s):  
Pham Hoang Anh
Keyword(s):  
Local Search ◽  
Objective Function ◽  
Optimization Algorithm ◽  
Optimization Problems ◽  
Optimal Solution ◽  
The Other ◽  
Truss Structures ◽  
Benchmark Problems ◽  
Discrete Variables ◽  
Objective Functions

In this paper, the optimal sizing of truss structures is solved using a novel evolutionary-based optimization algorithm. The efficiency of the proposed method lies in the combination of global search and local search, in which the global move is applied for a set of random solutions whereas the local move is performed on the other solutions in the search population. Three truss sizing benchmark problems with discrete variables are used to examine the performance of the proposed algorithm. Objective functions of the optimization problems are minimum weights of the whole truss structures and constraints are stress in members and displacement at nodes. Here, the constraints and objective function are treated separately so that both function and constraint evaluations can be saved. The results show that the new algorithm can find optimal solution effectively and it is competitive with some recent metaheuristic algorithms in terms of number of structural analyses required.

scholarly journals An improved arithmetic optimization algorithm with forced switching mechanism for global optimization problems

2022 ◽  
Vol 19 (1) ◽  
pp. 473-512
Author(s):  
Rong Zheng ◽  
◽  
Heming Jia ◽  
Laith Abualigah ◽  
Qingxin Liu ◽  
...  
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Heuristic Method ◽  
Population Diversity ◽  
Test Functions ◽  
Design Problems ◽  
Local Optima ◽  
Switching Mechanism ◽  
Engineering Design Problems

<abstract> <p>Arithmetic optimization algorithm (AOA) is a newly proposed meta-heuristic method which is inspired by the arithmetic operators in mathematics. However, the AOA has the weaknesses of insufficient exploration capability and is likely to fall into local optima. To improve the searching quality of original AOA, this paper presents an improved AOA (IAOA) integrated with proposed forced switching mechanism (FSM). The enhanced algorithm uses the random math optimizer probability (<italic>RMOP</italic>) to increase the population diversity for better global search. And then the forced switching mechanism is introduced into the AOA to help the search agents jump out of the local optima. When the search agents cannot find better positions within a certain number of iterations, the proposed FSM will make them conduct the exploratory behavior. Thus the cases of being trapped into local optima can be avoided effectively. The proposed IAOA is extensively tested by twenty-three classical benchmark functions and ten CEC2020 test functions and compared with the AOA and other well-known optimization algorithms. The experimental results show that the proposed algorithm is superior to other comparative algorithms on most of the test functions. Furthermore, the test results of two training problems of multi-layer perceptron (MLP) and three classical engineering design problems also indicate that the proposed IAOA is highly effective when dealing with real-world problems.</p> </abstract>

Nonlinear Mixed Integer-Discrete-Continuous Programming and its Application to Engineering Design Problems

1989 ◽  
Author(s):  
J.-F. Fu ◽  
R. G. Fenton ◽  
W. L. Cleghorn
Keyword(s):  
Nonlinear Programming ◽  
Objective Function ◽  
Engineering Design ◽  
Optimization Algorithm ◽  
Mixed Integer ◽  
Continuous Variables ◽  
Design Problems ◽  
Continuous Programming ◽  
Engineering Design Problems ◽  
Standard Values

Abstract An algorithm for solving nonlinear programming problems containing integer, discrete and continuous variables is presented. Based on a commonly employed optimization algorithm, penalties on integer and/or discrete violations are imposed on the objective function to force the search to converge onto standard values. Examples are included to illustrate the practical use of this algorithm.

Sign in / Sign up

Export Citation Format

Share Document