Gravitational search algorithm combined with modified differential evolution learning for planarization in graph drawing

Author(s):  
Hang Yu ◽  
Huisheng Zhu ◽  
Huiqin Chen ◽  
Dongbao Jia ◽  
Yang Yu ◽  
...  
2020 ◽  
Vol 17 (3) ◽  
pp. 172988142092529
Author(s):  
Jianzhong Huang ◽  
Yuwan Cen ◽  
Nenggang Xie ◽  
Xiaohua Ye

For the inverse calculation of laser-guided demolition robot, its global nonlinear mapping model from laser measuring point to joint cylinder stroke has been set up with an artificial neural network. Due to the contradiction between population diversity and convergence rate in the optimization of complex neural networks by using differential evolution, a gravitational search algorithm and differential evolution is proposed to accelerate the convergence rate of differential evolution population driven by gravity. Gravitational search algorithm and differential evolution is applied to optimize the inverse calculation neural network mapping model of demolition robot, and the algorithm simulation shows that gravity can effectively regulate the convergence process of differential evolution population. Compared with the standard differential evolution, the convergence speed and accuracy of gravitational search algorithm and differential evolution are significantly improved, which has better optimization stability. The calculation results show that the output accuracy of this gravitational and differential evolution neural network can meet the calculation requirements of the positioning control of demolition robot’s manipulator. The optimization using gravitational search algorithm and differential evolution is done with the connection weights of a neural network in this article, and as similar techniques can be applied to the other hyperparameter optimization problem. Moreover, such an inverse calculation method can provide a reference for the autonomous positioning of large hydraulic series manipulator, so as to improve the robotization level of construction machinery.


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.


Sign in / Sign up

Export Citation Format

Share Document