A hierarchical gravitational search algorithm with an effective gravitational constant

2019 ◽  
Vol 46 ◽  
pp. 118-139 ◽  
Author(s):  
Yirui Wang ◽  
Yang Yu ◽  
Shangce Gao ◽  
Haiyu Pan ◽  
Gang Yang
2020 ◽  
Vol 17 (1) ◽  
pp. 97-114
Author(s):  
Sajad Ahmad Rather ◽  
P. Shanthi Bala

Purpose The purpose of this paper is to investigate the performance of chaotic gravitational search algorithm (CGSA) in solving mechanical engineering design frameworks including welded beam design (WBD), compression spring design (CSD) and pressure vessel design (PVD). Design/methodology/approach In this study, ten chaotic maps were combined with gravitational constant to increase the exploitation power of gravitational search algorithm (GSA). Also, CGSA has been used for maintaining the adaptive capability of gravitational constant. Furthermore, chaotic maps were used for overcoming premature convergence and stagnation in local minima problems of standard GSA. Findings The chaotic maps have shown efficient performance for WBD and PVD problems. Further, they have depicted competitive results for CSD framework. Moreover, the experimental results indicate that CGSA shows efficient performance in terms of convergence speed, cost function minimization, design variable optimization and successful constraint handling as compared to other participating algorithms. Research limitations/implications The use of chaotic maps in standard GSA is a new beginning for research in GSA particularly convergence and time complexity analysis. Moreover, CGSA can be used for solving the infinite impulsive response (IIR) parameter tuning and economic load dispatch problems in electrical sciences. Originality/value The hybridization of chaotic maps and evolutionary algorithms for solving practical engineering problems is an emerging topic in metaheuristics. In the literature, it can be seen that researchers have used some chaotic maps such as a logistic map, Gauss map and a sinusoidal map more rigorously than other maps. However, this work uses ten different chaotic maps for engineering design optimization. In addition, non-parametric statistical test, namely, Wilcoxon rank-sum test, was carried out at 5% significance level to statistically validate the simulation results. Besides, 11 state-of-the-art metaheuristic algorithms were used for comparative analysis of the experimental results to further raise the authenticity of the experimental setup.


2016 ◽  
Vol 3 (4) ◽  
pp. 1-11
Author(s):  
M. Lakshmikantha Reddy ◽  
◽  
M. Ramprasad Reddy ◽  
V.C. Veera Reddy ◽  
◽  
...  

Author(s):  
Umit Can ◽  
Bilal Alatas

The classical optimization algorithms are not efficient in solving complex search and optimization problems. Thus, some heuristic optimization algorithms have been proposed. In this paper, exploration of association rules within numerical databases with Gravitational Search Algorithm (GSA) has been firstly performed. GSA has been designed as search method for quantitative association rules from the databases which can be regarded as search space. Furthermore, determining the minimum values of confidence and support for every database which is a hard job has been eliminated by GSA. Apart from this, the fitness function used for GSA is very flexible. According to the interested problem, some parameters can be removed from or added to the fitness function. The range values of the attributes have been automatically adjusted during the time of mining of the rules. That is why there is not any requirements for the pre-processing of the data. Attributes interaction problem has also been eliminated with the designed GSA. GSA has been tested with four real databases and promising results have been obtained. GSA seems an effective search method for complex numerical sequential patterns mining, numerical classification rules mining, and clustering rules mining tasks of data mining.


2021 ◽  
Vol 11 (10) ◽  
pp. 4438
Author(s):  
Satyendra Singh ◽  
Manoj Fozdar ◽  
Hasmat Malik ◽  
Maria del Valle Fernández Moreno ◽  
Fausto Pedro García Márquez

It is expected that large-scale producers of wind energy will become dominant players in the future electricity market. However, wind power output is irregular in nature and it is subjected to numerous fluctuations. Due to the effect on the production of wind power, producing a detailed bidding strategy is becoming more complicated in the industry. Therefore, in view of these uncertainties, a competitive bidding approach in a pool-based day-ahead energy marketplace is formulated in this paper for traditional generation with wind power utilities. The profit of the generating utility is optimized by the modified gravitational search algorithm, and the Weibull distribution function is employed to represent the stochastic properties of wind speed profile. The method proposed is being investigated and simplified for the IEEE-30 and IEEE-57 frameworks. The results were compared with the results obtained with other optimization methods to validate the approach.


Sign in / Sign up

Export Citation Format

Share Document