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

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.

1998 ◽  
Vol 120 (2) ◽  
pp. 162-164 ◽  
Author(s):  
K. Deb ◽  
M. Goyal

A flexible algorithm for solving nonlinear engineering design optimization problems involving zero-one, discrete, and continuous variables is presented. The algorithm restricts its search only to the permissible values of the variables, thereby reducing the search effort in converging near the optimum solution. The efficiency and ease of application of the proposed method is demonstrated by solving four different mechanical design problems chosen from the optimization literature. These results are encouraging and suggest the use of the technique to other more complex engineering design problems.


Author(s):  
Theodore Bardsz ◽  
Ibrahim Zeid

Abstract One of the most significant issues in applying case-based reasoning (CBR) to mechanical design is to integrate previously unrelated design plans towards the solution of a new design problem. The total design solution (the design plan structure) can be composed of both retrieved and dynamically generated design plans. The retrieved design plans must be mapped to fit the new design context, and the entire design plan structure must be evaluated. An architecture utilizing opportunistic problem solving in a blackboard environment is used to map and evaluate the design plan structure effectively and successfuly. The architecture has several assets when integrated into a CBR environment. First, the maximum amount of information related to the design is generated before any of the mapping problems are addressed. Second, mapping is preformed as just another action toward the evaluation of the design plan. Lastly, the architecture supports the inclusion of memory elements from the knowledge base in the design plan structure. The architecture is implemented using the GBB system. The architecture is part of a newly developed CBR System called DEJAVU. The paper describes DEJAVU and the architecture. An example is also included to illustrate the use of DEJAVU to solve engineering design problems.


Author(s):  
Janga Reddy Manne

Most of the engineering design problems are intrinsically complex and difficult to solve, because of diverse solution search space, complex functions, continuous and discrete nature of decision variables, multiple objectives and hard constraints. Swarm intelligence (SI) algorithms are becoming popular in dealing with these kind of complexities. The SI algorithms being population based random search techniques, use heuristics inspired from nature to enable effective exploration of optimal solutions to complex engineering problems. The SI algorithms derived based on principles of co-operative group intelligence and collective behavior of self-organized systems. This chapter presents key principles of multi-optimization, and swarm optimization for solving multi-objective engineering design problems with illustration through few examples.


Author(s):  
Jining Qiu ◽  
Bo Zhang ◽  
Huimin Dong ◽  
Yuan Gao

The ability to solve engineering design problems using academic knowledge flexibly is essential for mechanical engineering students and is also quality that employers look for. This paper introduces how students could explore and experience the process of mechanical design in the course project of Theory of Machines and Mechanisms (TMM) in Dalian University of Technology (DUT) through sharing the design process of accelerator (gear-box) in wind power generator by one representative team of students in the course project. Firstly, design requirements are set based on industrial need and the choosing of the best scheme of multi-stage gear train is conducted. Following that is the design of kinematic parameters of gears and the evaluation of selected system. Then, a possible solution to control the input speed of the generator is proposed. In the end, a survey to 279 students who participate in the course project shows the importance of course project in cultivating their ability to apply knowledge in design.


2021 ◽  
Vol 40 (1) ◽  
pp. 1667-1679
Author(s):  
Kangjian Sun ◽  
Heming Jia ◽  
Yao Li ◽  
Zichao Jiang

Slime mould algorithm (SMA) is a novel metaheuristic that simulates foraging behavior of slime mould. Regarding its drawbacks and properties, a hybrid optimization (BTβSMA) based on improved SMA is proposed to produce the higher-quality optimal results. Brownian motion and tournament selection mechanism are introduced into the basic SMA to improve the exploration capability. Moreover, a local search algorithm (Adaptive β-hill climbing, AβHC) is hybridized with the improved SMA. It is considered from boosting the exploitation trend. The proposed BTβSMA algorithm is evaluated in two main phases. Firstly, the two improved hybrid variants (BTβSMA-1 and BTβSMA-2) are compared with the basic SMA algorithm through 16 benchmark functions. Also, the performance of winner is further evaluated through comparisons with 7 state-of-the-art algorithms. The simulation results report fitness and computation time. The convergence curve and boxplot visualize the effects of fitness. The comparison results on the function optimization suggest that BTβSMA is superior to competitors. Wilcoxon rank-sum test is also employed to investigate the significance of the results. Secondly, the applicability on real-world tasks is proved by solving structure engineering design problems and training multilayer perceptrons. The numerical results indicate the merits of the BTβSMA algorithm in terms of solution precision.


Author(s):  
Janga Reddy Manne

Most of the engineering design problems are intrinsically complex and difficult to solve because of diverse solution search space, complex functions, continuous and discrete nature of decision variables, multiple objectives, and hard constraints. Swarm intelligence (SI) algorithms are becoming popular in dealing with these complexities. The SI algorithms, being population-based random search techniques, use heuristics inspired from nature to enable effective exploration of optimal solutions to complex engineering problems. The SI algorithms derived from principles of cooperative group intelligence and collective behavior of self-organized systems. This chapter presents key principles of multi-optimization and swarm optimization for solving multi-objective engineering design problems with illustration through a few examples.


2017 ◽  
Vol 2017 ◽  
pp. 1-23 ◽  
Author(s):  
Yuting Lu ◽  
Yongquan Zhou ◽  
Xiuli Wu

In this paper, a novel hybrid lightning search algorithm-simplex method (LSA-SM) is proposed to solve the shortcomings of lightning search algorithm (LSA) premature convergence and low computational accuracy and it is applied to function optimization and constrained engineering design optimization problems. The improvement adds two major optimization strategies. Simplex method (SM) iteratively optimizes the current worst step leaders to avoid the population searching at the edge, thus improving the convergence accuracy and rate of the algorithm. Elite opposition-based learning (EOBL) increases the diversity of population to avoid the algorithm falling into local optimum. LSA-SM is tested by 18 benchmark functions and five constrained engineering design problems. The results show that LSA-SM has higher computational accuracy, faster convergence rate, and stronger stability than other algorithms and can effectively solve the problem of constrained nonlinear optimization in reality.


Author(s):  
Madhur Agarwal

In real world, the structural engineering design problems are large scale non-linear constrained problems. In the present study, crow search algorithm (CSA) is applied to find the optimal solution of structural engineering design problems such as pressure vessel design problem, welded beam design problem and tension/ compression string design problem. The numerical results are compared with the existing results reported in the literature including metaheuristic algorithms and it is found that the results obtained by the crow search algorithm are better than other existing algorithms. Further, the effectiveness of the algorithm is verified to be better than the existing algorithms by statistical analysis using mean, median, best case, and worst case scenarios. The present study confirms that the crow search algorithm may be easily and effectively applied to various structural design problems.


Sign in / Sign up

Export Citation Format

Share Document