Self-adaptive step fruit fly algorithm optimized support vector regression model for dynamic response prediction of magnetorheological elastomer base isolator

© 2016 Elsevier B.V. Parameter optimization of support vector regression (SVR) plays a challenging role in improving the generalization ability of machine learning. Fruit fly optimization algorithm (FFOA) is a recently developed swarm optimization algorithm for complicated multi-objective optimization problems and is also suitable for optimizing SVR parameters. In this work, parameter optimization in SVR using FFOA is investigated. In view of problems of premature and local optimum in FFOA, an improved FFOA algorithm based on self-adaptive step update strategy (SSFFOA) is presented to obtain the optimal SVR model. Moreover, the proposed method is utilized to characterize magnetorheological elastomer (MRE) base isolator, a typical hysteresis device. In this application, the obtained displacement, velocity and current level are used as SVR inputs while the output is the shear force response of the device. Experimental testing of the isolator with two types of excitations is applied for model performance evaluation. The results demonstrate that the proposed SSFFOA-optimized SVR (SSFFOA_SVR) has perfect generalization ability and more accurate prediction accuracy than other machine learning models, and it is a suitable and effective method to predict the dynamic behaviour of MRE isolator

An Improved Fruit Fly Optimization Algorithm Inspired from Cell Communication Mechanism

Fruit fly optimization algorithm (FOA) invented recently is a new swarm intelligence method based on fruit fly’s foraging behaviors and has been shown to be competitive with existing evolutionary algorithms, such as particle swarm optimization (PSO) algorithm. However, there are still some disadvantages in the FOA, such as low convergence precision, easily trapped in a local optimum value at the later evolution stage. This paper presents an improved FOA based on the cell communication mechanism (CFOA), by considering the information of the global worst, mean, and best solutions into the search strategy to improve the exploitation. The results from a set of numerical benchmark functions show that the CFOA outperforms the FOA and the PSO in most of the experiments. Further, the CFOA is applied to optimize the controller for preoxidation furnaces in carbon fibers production. Simulation results demonstrate the effectiveness of the CFOA

Field programmable gate array based sigmoid function implementation using differential lookup table and second order nonlinear function

Artificial neural network (ANN) is an established artificial intelligence technique that is widely used for solving numerous problems such as classification and clustering in various fields. However, the major problem with ANN is a factor of time. ANN takes a longer time to execute a huge number of neurons. In order to overcome this, ANN is implemented into hardware namely field-programmable-gate-array (FPGA). However, implementing the ANN into a field-programmable gate array (FPGA) has led to a new problem related to the sigmoid function implementation. Often used as the activation function for ANN, a sigmoid function cannot be directly implemented in FPGA. Owing to its accuracy, the lookup table (LUT) has always been used to implement the sigmoid function in FPGA. In this case, obtaining the high accuracy of LUT is expensive particularly in terms of its memory requirements in FPGA. Second-order nonlinear function (SONF) is an appealing replacement for LUT due to its small memory requirement. Although there is a trade-off between accuracy and memory size. Taking the advantage of the aforementioned approaches, this thesis proposed a combination of SONF and a modified LUT namely differential lookup table (dLUT). The deviation values between SONF and sigmoid function are used to create the dLUT. SONF is used as the first step to approximate the sigmoid function. Then it is followed by adding or deducting with the value that has been stored in the dLUT as a second step as demonstrated via simulation. This combination has successfully reduced the deviation value. The reduction value is significant as compared to previous implementations such as SONF, and LUT itself. Further simulation has been carried out to evaluate the accuracy of the ANN in detecting the object in an indoor environment by using the proposed method as a sigmoid function. The result has proven that the proposed method has produced the output almost as accurately as software implementation in detecting the target in indoor positioning problems. Therefore, the proposed method can be applied in any field that demands higher processing and high accuracy in sigmoid function outpu

Stochastic Fractal Based Multiobjective Fruit Fly Optimization

The fruit fly optimization algorithm (FOA) is a global optimization algorithm inspired by the foraging behavior of a fruit fly swarm. In this study, a novel stochastic fractal model based fruit fly optimization algorithm is proposed for multiobjective optimization. A food source generating method based on a stochastic fractal with an adaptive parameter updating strategy is introduced to improve the convergence performance of the fruit fly optimization algorithm. To deal with multiobjective optimization problems, the Pareto domination concept is integrated into the selection process of fruit fly optimization and a novel multiobjective fruit fly optimization algorithm is then developed. Similarly to most of other multiobjective evolutionary algorithms (MOEAs), an external elitist archive is utilized to preserve the nondominated solutions found so far during the evolution, and a normalized nearest neighbor distance based density estimation strategy is adopted to keep the diversity of the external elitist archive. Eighteen benchmarks are used to test the performance of the stochastic fractal based multiobjective fruit fly optimization algorithm (SFMOFOA). Numerical results show that the SFMOFOA is able to well converge to the Pareto fronts of the test benchmarks with good distributions. Compared with four state-of-the-art methods, namely, the non-dominated sorting generic algorithm (NSGA-II), the strength Pareto evolutionary algorithm (SPEA2), multi-objective particle swarm optimization (MOPSO), and multiobjective self-adaptive differential evolution (MOSADE), the proposed SFMOFOA has better or competitive multiobjective optimization performance

Assembly sequence planning using hybrid binary particle swarm optimization

Assembly Sequence Planning (ASP) is known as a large-scale, timeconsuming combinatorial problem. Therefore time is the main factor in production planning. Recently, ASP in production planning had been studied widely especially to minimize the time and consequently reduce the cost. The first objective of this research is to formulate and analyse a mathematical model of the ASP problem. The second objective is to minimize the time of the ASP problem and hence reduce the product cost. A case study of a product consists of 19 components have been used in this research, and the fitness function of the problem had been calculated using Binary Particle Swarm Optimization (BPSO), and hybrid algorithm of BPSO and Differential Evolution (DE). The novel algorithm of BPSODE has been assessed with performance-evaluated criteria (performance measure). The algorithm has been validated using 8 comprehensive benchmark problems from the literature. The results show that the BPSO algorithm has an improved performance and can reduce further the time of assembly of the 19 parts of the ASP compared to the Simulated Annealing and Genetic Algorithm. The novel hybrid BPSODE algorithm shows a superior performance when assessed via performance-evaluated criteria compared to BPSO. The BPSODE algorithm also demonstrated a good generation of the recorded optimal value for the 8 standard benchmark problems