Levy Flight and Chaos Theory Based Gravitational Search Algorithm for Global Optimization

The Gravitational Search Algorithm (GSA) is one of the highly regarded population-based algorithms. It has been reported that GSA has a powerful global exploration capability but suffers from the limitations of getting stuck in local optima and slow convergence speed. In order to resolve the aforementioned issues, a modified version of GSA has been proposed based on levy flight distribution and chaotic maps (LCGSA). In LCGSA, the diversification is performed by utilizing the high step size value of levy flight distribution while exploitation is carried out by chaotic maps. The LCGSA is tested on well-known 23 classical benchmark functions. Moreover, it is also applied to three constrained engineering design problems. Furthermore, the analysis of results is performed through various performance metrics like statistical measures, convergence rate, and so on. Also, a signed Wilcoxon rank-sum test has also been conducted. The simulation results indicate that LCGSA provides better results as compared to standard GSA and most of the competing algorithms.

A Modified Cuckoo Search Algorithm and Its Applications in Function Optimization

A modified Cuckoo search algorithm (MCS) is proposed in this paper to improve the accuracy of the algorithm’s convergence by implementing random operators and adapt the adjustment mechanism of the Levy Flight search step length. Comparative experiments reveal that MCS can effectively adjust the search mechanism in the high-dimensional function optimization and converge to the optimal global value.

Intrinsic bursts facilitate learning of Lévy flight movements in recurrent neural network models

Isolated spikes and bursts of spikes are thought to provide the two major modes of information coding by neurons. Bursts are known to be crucial for fundamental processes between neuron pairs, such as neuronal communications and synaptic plasticity. Deficits in neuronal bursting can also impair higher cognitive functions and cause mental disorders. Despite these findings on the roles of bursts, whether and how bursts have an advantage over isolated spikes in the network-level computation remains elusive. Here, we demonstrate in a computational model that not isolated spikes but intrinsic bursts can greatly facilitate learning of Lévy flight random walk trajectories by synchronizing burst onsets across neural population. Lévy flight is a hallmark of optimal search strategies and appears in cognitive behaviors such as saccadic eye movements and memory retrieval. Our results suggest that bursting is a crucial component of sequence learning by recurrent neural networks in the brain.