Improving convergence in swarm algorithms by controlling range of random movement

2021 ◽  
Author(s):  
Reshu Chaudhary ◽  
Hema Banati
2016 ◽  
Author(s):  
M. C. Oliveira Junior ◽  
M. G. P. Lacerda ◽  
E. A. Barboza ◽  
P. R. G. Cordeiro ◽  
C. J. A. Bastos-Filho

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Kuan-Cheng Lin ◽  
Sih-Yang Chen ◽  
Jason C. Hung

Rapid advances in information and communication technology have made ubiquitous computing and the Internet of Things popular and practicable. These applications create enormous volumes of data, which are available for analysis and classification as an aid to decision-making. Among the classification methods used to deal with big data, feature selection has proven particularly effective. One common approach involves searching through a subset of the features that are the most relevant to the topic or represent the most accurate description of the dataset. Unfortunately, searching through this kind of subset is a combinatorial problem that can be very time consuming. Meaheuristic algorithms are commonly used to facilitate the selection of features. The artificial fish swarm algorithm (AFSA) employs the intelligence underlying fish swarming behavior as a means to overcome optimization of combinatorial problems. AFSA has proven highly successful in a diversity of applications; however, there remain shortcomings, such as the likelihood of falling into a local optimum and a lack of multiplicity. This study proposes a modified AFSA (MAFSA) to improve feature selection and parameter optimization for support vector machine classifiers. Experiment results demonstrate the superiority of MAFSA in classification accuracy using subsets with fewer features for given UCI datasets, compared to the original FASA.


Author(s):  
Slami Saadi ◽  
Abderrezak Guessoum ◽  
Mohamed Elaguab ◽  
Maamar Bettayeb
Keyword(s):  

Author(s):  
Safaa K. Kadhem ◽  
Sadeq A. Kadhim

Recently, there are many works that proposed modeling approaches to describe the random movement of individuals for COVID-19 infection. However, these models have not taken into account some key aspects for disease such the prediction of expected time of patients remaining at certain health state before entering an absorption state (e.g., exit out of the system for ever such as death state or recovery). Therefore, we propose a dynamical model approach called the absorbing Markov chains for analyzing COVID-19 infections. From this modeling approach, we seek to focus and predict two states of absorption: recovery and death, as these two conditions are considered as important indicators in assessment of the health level. Based on the absorbing Markov model, the study suggested that there is a gradually increase in the predicted death number, while a decrease in the number of recovered individuals.


2021 ◽  
Vol 63 (3) ◽  
pp. 266-271
Author(s):  
Hammoudi Abderazek ◽  
Ferhat Hamza ◽  
Ali Riza Yildiz ◽  
Sadiq M. Sait

Abstract In this study, two recent algorithms, the whale optimization algorithm and moth-flame optimization, are used to optimize spur gear design. The objective function is the minimization of the total weight of the spur gear pair. Moreover, the optimization problem is subjected to constraints on the main kinematic and geometric conditions as well as to the resistance of the material of the gear system. The comparison between moth-flame optimization (MFO), the whale optimization algorithm (WOA), and previous studies indicate that the final results obtained from both algorithms lead to a reduction in gear weight by 1.05 %. MFO and the WOA are compared with four additional swarm algorithms. The experimental results indicate that the algorithms introduced here, in particular MFO, outperform the four other methods when compared in terms of solution quality, robustness, and high success rate.


Author(s):  
P. Matrenin ◽  
V. Myasnichenko ◽  
N. Sdobnyakov ◽  
D. Sokolov ◽  
S. Fidanova ◽  
...  

<span lang="EN-US">In recent years, hybrid approaches on population-based algorithms are more often applied in industrial settings. In this paper, we present the approach of a combination of universal, problem-free Swarm Intelligence (SI) algorithms with simple deterministic domain-specific heuristic algorithms. The approach focuses on improving efficiency by sharing the advantages of domain-specific heuristic and swarm algorithms. A heuristic algorithm helps take into account the specifics of the problem and effectively translate the positions of agents (particle, ant, bee) into the problem's solution. And a Swarm algorithm provides an increase in the adaptability and efficiency of the approach due to stochastic and self-organized properties. We demonstrate this approach on two non-trivial optimization tasks: scheduling problem and finding the minimum distance between 3D isomers.</span>


Sign in / Sign up

Export Citation Format

Share Document