Downloads & Free Reading Options - Results

Swarm Intelligence algorithms are meta-heuristic and population-based stochastic optimization algorithms. These algorithms are influenced by an intelligent and  collective behaviour of insects or animals such as ants, fireflies, dragonflies, wolves, cuckoo, hawks etc. The behaviour of these insects and animals offers information and strategy to win the hunts in their own way. Their behaviour of hunting uses an optimised approach i.e. they win over their prey by using least number of hunting steps. The algorithms are developed on the basis of their behaviour to solve the real-world problems. This research paper presents a comparative study of various swarm intelligence optimization algorithms.

Many optimization algorithms have been developed by drawing inspiration from swarm intelligence (SI). These SI-based algorithms can have some advantages over traditional algorithms. In this paper, we carry out a critical analysis of these SI-based algorithms by analyzing their ways to mimic evolutionary operators. We also analyze the ways of achieving exploration and exploitation in algorithms by using mutation, crossover and selection. In addition, we also look at algorithms using dynamic systems, self-organization and Markov chain framework. Finally, we provide some discussions and topics for further research.

In this research paper, we focused on the developing a secure and efficient time-series forecasting of nuclear reactions using swarm intelligence (SI) algorithm. Nuclear radioactive management and efficient time series for casting of nuclear reactions is a problem to be addressed if nuclear power is to deliver a major part of our energy consumption. This problem explains how SI processing techniques can be used to automate accurate nuclear reaction forecasting. The goal of the study was to use swarm analysis to understand patterns and reactions in the dataset while forecasting nuclear reactions using swarm intelligence. The results obtained by training the SI algorithm for longer periods of time for predicting the efficient time series events of nuclear reactions with 94.58 percent accuracy, which is higher than the deep convolution neural networks (DCNNs) 93% accuracy for all predictions, such as the number of active reactions, to see how the results can improve. Our earliest research focused on determining the best settings and preprocessing for working with a certain nuclear reaction, such as fusion and fusion task: forecasting the time series as the reactions took 0-500 ticks being trained on 300 epochs.

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.

High dimensional optimization considers being one of the most challenges that face the algorithms for finding an optimal solution for real-world problems. These problems have been appeared in diverse practical fields including business and industries. Within a huge number of algorithms, selecting one algorithm among others for solving the high dimensional optimization problem is not an easily accomplished task. This paper presents a comprehensive study of two swarm intelligence based algorithms: 1- particle swarm optimization (PSO), 2-cuckoo search (CS).The two algorithms are analyzed and compared for problems consisting of high dimensions in respect of solution accuracy, and runtime performance by various classes of benchmark functions.