Firefly Algorithm, Stochastic Test Functions and Design Optimisation

Modern optimisation algorithms are often metaheuristic, and they are very promising in solving NP-hard optimization problems. In this paper, we show how to use the recently developed Firefly Algorithm to solve nonlinear design problems. For the standard pressure vessel design optimisation, the optimal solution found by FA is far better than the best solution obtained previously in literature. In addition, we also propose a few new test functions with either singularity or stochastic components but with known global optimality, and thus they can be used to validate new optimisation algorithms. Possible topics for further research are also discussed.Comment: 12 pages, 11 figure

Firefly Algorithms for Multimodal Optimization

Nature-inspired algorithms are among the most powerful algorithms for optimization. This paper intends to provide a detailed description of a new Firefly Algorithm (FA) for multimodal optimization applications. We will compare the proposed firefly algorithm with other metaheuristic algorithms such as particle swarm optimization (PSO). Simulations and results indicate that the proposed firefly algorithm is superior to existing metaheuristic algorithms. Finally we will discuss its applications and implications for further research

An outline of cellular automaton universe via cosmological KdV equation

It has been known for long time that the cosmic sound wave was there since the early epoch of the Universe. Signatures of its existence are abound. However, such a sound wave model of cosmology is rarely developed fully into a complete framework. This paper can be considered as our second attempt towards such a complete description of the Universe based on soliton wave solution of cosmological KdV equation. Then we advance further this KdV equation by virtue of Cellular Automaton method to solve the PDEs. We submit wholeheartedly Robert Kuruczs hypothesis that Big Bang should be replaced with a finite cellular automaton universe with no expansion [4][5]. Nonetheless, we are fully aware that our model is far from being complete, but it appears the proposed cellular automaton model of the Universe is very close in spirit to what Konrad Zuse envisaged long time ago. It is our hope that the new proposed method can be verified with observation data. But we admit that our model is still in its infancy, more researches are needed to fill all the missing detail

A Brief Review of Bio-Inspired Algorithms in Computational Perspective - Bio Inspired Algorithms

Computing over the years has evolved from being simplex mathematical processing machine to more sophisticated problem solving entity pushing limits around reasoning and intelligence. Along the way, lots scientists and engineers have closely observed some of the biological processes achieving certain things in a more efficient and simple fashion than traditional computational mechanisms. This has led to development of various techniques and algorithms which try and mimic these biological processes and are categorised under, Bio-Inspired Computing

Emergent Adaptive Noise Reduction from Communal Cooperation of Sensor Grid

In the last decade, the realization of small, inexpensive, and powerful devices with sensors, computers, and wireless communication has promised the development of massive sized sensor networks with dense deployments over large areas capable of high fidelity situational assessments. However, most management models have been based on centralized control and research has concentrated on methods for passing data from sensor devices to the central controller. Most implementations have been small but, as it is not scalable, this methodology is insufficient for massive deployments. Here, a specific application of a large sensor network for adaptive noise reduction demonstrates a new paradigm where communities of sensor/computer devices assess local conditions and make local decisions from which emerges a global behaviour. This approach obviates many of the problems of centralized control as it is not prone to single point of failure and is more scalable, efficient, robust, and fault toleran

Numerical Comparison of the Performance of Genetic Algorithm and Particle Swarm Optimization in Excavations

Today, the back analysis methods are known as reliable and effective approaches for estimating the soil strength parameters in the site of project. The back analysis can be performed by genetic algorithm and particle swarm optimization in the form of an optimization process. In this paper, the back analysis is carried out using genetic algorithm and particle swarm optimization in order to determine the soil strength parameters in an excavation project in Tehran city. The process is automatically accomplished by linking between MATLAB and Abaqus software using Python programming language. To assess the results of numerical method, this method is initially compared with the results of numerical studies by Babu and Singh. After the verification of numerical results, the values of the three parameters of elastic modulus, cohesion and friction angle (parameters of the Mohr–Coulomb model) of the soil are determined and optimized for three soil layers of the project site using genetic algorithm and particle swarm optimization. The results optimized by genetic algorithm and particle swarm optimization show a decrease of 72.1% and 62.4% in displacement differences in the results of project monitoring and numerical analysis, respectively. This research shows the better performance of genetic algorithm than particle swarm optimization in minimization of error and faster success in achieving termination conditions