engineering design problems
Recently Published Documents


TOTAL DOCUMENTS

383
(FIVE YEARS 119)

H-INDEX

24
(FIVE YEARS 5)

Author(s):  
Samira El Moumen ◽  
Siham Ouhimmou

Various engineering design problems are formulated as constrained multi-objective optimization problems. One of the relevant and popular methods that deals with these problems is the weighted method. However, the major inconvenience with its application is that it does not yield a well distributed set. In this study, the use of the Normal Boundary Intersection approach (NBI) is proposed, which is effective in obtaining an evenly distributed set of points in the Pareto set. Given an evenly distributed set of weights, it can be strictly shown that this approach is absolutely independent of the relative scales of the functions. Moreover, in order to ensure the convergence to the Global Pareto frontier, NBI approach has to be aligned with a global optimization method. Thus, the following paper suggests NBI-Simulated Annealing Simultaneous Perturbation method (NBI-SASP) as a new method for multiobjective optimization problems. The study shall test also the applicability of the NBI-SASP approach using different engineering multi-objective optimization problems and the findings shall be compared to a method of reference (NSGA). Results clearly demonstrate that the suggested method is more efficient when it comes to search ability and it provides a well distributed global Pareto Front.


2022 ◽  
Vol 19 (1) ◽  
pp. 473-512
Author(s):  
Rong Zheng ◽  
◽  
Heming Jia ◽  
Laith Abualigah ◽  
Qingxin Liu ◽  
...  

<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>


2022 ◽  
Vol 13 (1) ◽  
pp. 0-0

The Gravitational Search Algorithm (GSA) is one of the highly regarded population-based algorithms. It has been reported that GSA has a powerful global exploration capability but suffers from the limitations of getting stuck in local optima and slow convergence speed. In order to resolve the aforementioned issues, a modified version of GSA has been proposed based on levy flight distribution and chaotic maps (LCGSA). In LCGSA, the diversification is performed by utilizing the high step size value of levy flight distribution while exploitation is carried out by chaotic maps. The LCGSA is tested on well-known 23 classical benchmark functions. Moreover, it is also applied to three constrained engineering design problems. Furthermore, the analysis of results is performed through various performance metrics like statistical measures, convergence rate, and so on. Also, a signed Wilcoxon rank-sum test has also been conducted. The simulation results indicate that LCGSA provides better results as compared to standard GSA and most of the competing algorithms.


2022 ◽  
Vol 19 (3) ◽  
pp. 2240-2285
Author(s):  
Shihong Yin ◽  
◽  
Qifang Luo ◽  
Yanlian Du ◽  
Yongquan Zhou ◽  
...  

<abstract> <p>The slime mould algorithm (SMA) is a metaheuristic algorithm recently proposed, which is inspired by the oscillations of slime mould. Similar to other algorithms, SMA also has some disadvantages such as insufficient balance between exploration and exploitation, and easy to fall into local optimum. This paper, an improved SMA based on dominant swarm with adaptive t-distribution mutation (DTSMA) is proposed. In DTSMA, the dominant swarm is used improved the SMA's convergence speed, and the adaptive t-distribution mutation balances is used enhanced the exploration and exploitation ability. In addition, a new exploitation mechanism is hybridized to increase the diversity of populations. The performances of DTSMA are verified on CEC2019 functions and eight engineering design problems. The results show that for the CEC2019 functions, the DTSMA performances are best; for the engineering problems, DTSMA obtains better results than SMA and many algorithms in the literature when the constraints are satisfied. Furthermore, DTSMA is used to solve the inverse kinematics problem for a 7-DOF robot manipulator. The overall results show that DTSMA has a strong optimization ability. Therefore, the DTSMA is a promising metaheuristic optimization for global optimization problems.</p> </abstract>


Author(s):  
Ximing Liang ◽  
◽  
Yang Zhang ◽  

Spider monkey optimization (SMO) algorithm is a new swarm intelligence optimization algorithm proposed in recent years. It simulates the foraging behavior of spider monkeys which have fission-fusion social structure (FFSS). In this paper, a modified spider monkey optimization algorithm is proposed. The self-adaptive inertia weight is introduced in the local leader phase to enhance the self-learning ability of the spider monkey. According to the function value of an individual, the distance from the optimal value is determined, so the inertia weight related the individual function value is added to strength the global search ability or local search ability. The proposed algorithm is tested on 20 benchmark problems and compared with the original SMO and the hybrid algorithm SMOGA and GASMO. The numerical results show that the proposed algorithm has a certain degree of improvement in convergence accuracy and convergence speed. The performance of the proposed algorithm is also inspected by two classical engineering design problems.


2021 ◽  
Author(s):  
Muhammad Farhan Tabassum ◽  
Ali Akgul ◽  
Sana Akram ◽  
Saadia Hassan ◽  
. Saman ◽  
...  

Abstract It is very necessary and applicable to optimize all disciplines. In practical engineering problems the optimization has been a significant component. This article presents the hybrid approach named as differential gradient evolution plus (DGE+) algorithm which is the combination of differential evolution (DE) algorithm and gradient evolution (GE) algorithm. DE was used to diversify and GE was used for intensification with a perfect equilibrium between exploration and exploitation with an improvised distribution of dynamic probability and offers a new shake-off approach to prevent premature convergence to local optimum. To describe the success, the proposed algorithm is compared to modern meta-heuristics. To see the accuracy, robustness, and reliability of DGE+ it has been implemented on eight complex practical engineering problems named as: pressure vessel, belleville spring, tension/compression spring, three-bar truss, welded beam, speed reducer, gear train and rolling element bearing design problem, the results revealed that DGE+ algorithm can deliver highly efficient, competitive and promising results.


Machines ◽  
2021 ◽  
Vol 9 (12) ◽  
pp. 341
Author(s):  
Bugra Alkan ◽  
Malarvizhi Kaniappan Chinnathai

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.


Sign in / Sign up

Export Citation Format

Share Document