Improved binary artificial fish swarm algorithm for the 0–1 multidimensional knapsack problems

The 0–1 multidimensional knapsack problem (MKP) arises in many fields of optimization and is NP-hard. Several exact as well as heuristic methods exist. Recently, an artificial fish swarm algorithm has been developed in continuous global optimization. The algorithm uses a population of points in space to represent the position of fish in the school. In this paper, a binary version of the artificial fish swarm algorithm is proposed for solving the 0–1 MKP. In the proposed method, a point is represented by a binary string of 0/1 bits. Each bit of a trial point is generated by copying the corresponding bit from the current point or from some other specified point, with equal probability. Occasionally, some randomly chosen bits of a selected point are changed from 0 to 1, or 1 to 0, with an user defined probability. The infeasible solutions are made feasible by a decoding algorithm. A simple heuristic add_item is implemented to each feasible point aiming to improve the quality of that solution. A periodic reinitialization of the population greatly improves the quality of the solutions obtained by the algorithm. The proposed method is tested on a set of benchmark instances and a comparison with other methods available in literature is shown. The comparison shows that the proposed method gives a competitive performance when solving this kind of problems.Fundação para a Ciência e a Tecnologia (FCT

Application of Artificial Fish Swarm Algorithm in Radial Basis Function Neural Network

Neural network is one of the branches with the most active research, development and application in computational intelligence and machine study. Radial basis function neural network (RBFNN) has achieved some success in more than one application field, especially in pattern recognition and functional approximation. Due to its simple structure, fast training speed and excellent generalization ability, it has been widely used. Artificial fish swarm algorithm (AFSA) is a new swarm intelligent optimization algorithm derived from the study on the preying behavior of fish swarm. This algorithm is not sensitive to the initial value and the parameter selection, but strong in robustness and simple and easy to realize and it also has parallel processing capability and global searching ability. This paper mainly researches the weight and threshold of AFSA in optimizing RBFNN. The simulation experiment proves that AFSA-RBFNN is significantly advantageous in global optimization capability and that it has outstanding global optimization ability and stability

Structural multi-damage identification based on strain energy and micro-search artificial fish swarm algorithm

A two-stage damage detection method based on strain energy and micro-search artificial fish swarm algorithm (MSAFSA) is presented for solving structural multi-damage problem. First, structural modal strain energy and energy dissipation process are analyzed and an improved modal strain energy dissipation ration index (IMSEDRI) is proposed to preliminarily detect suspected damage elements. Then, artificial fish swarm algorithm (AFSA) is used to identify damage extent of suspected damage elements. In general, the search efficiency of a basic AFSA isn’t very efficient for the search procedure. So, a micro-search artificial fish swarm algorithm is presented in this paper. The simulation results demonstrate that the damage detection method can estimate the damage locations and extent with good accuracy, and the calculated results of the proposed MSAFSA are obviously superior to those of both the basic AFSA and the AFSA with visual-step change strategy

An analysis of the inertia weight parameter for binary particle swarm optimization

In particle swarm optimization, the inertia weight is an important parameter for controlling its search capability. There have been intensive studies of the inertia weight in continuous optimization, but little attention has been paid to the binary case. This study comprehensively investigates the effect of the inertia weight on the performance of binary particle swarm optimization, from both theoretical and empirical perspectives. A mathematical model is proposed to analyze the behavior of binary particle swarm optimization, based on which several lemmas and theorems on the effect of the inertia weight are derived. Our research findings suggest that in the binary case, a smaller inertia weight enhances the exploration capability while a larger inertia weight encourages exploitation. Consequently, this paper proposes a new adaptive inertia weight scheme for binary particle swarm optimization. This scheme allows the search process to start first with exploration and gradually move towards exploitation by linearly increasing the inertia weight. The experimental results on 0/1 knapsack problems show that the binary particle swarm optimization with the new increasing inertia weight scheme performs significantly better than that with the conventional decreasing and constant inertia weight schemes. This study verifies the efficacy of increasing inertia weight in binary particle swarm optimization

A Review of the Family of Artificial Fish Swarm Algorithms: Recent Advances and Applications

The Artificial Fish Swarm Algorithm (AFSA) is inspired by the ecological behaviors of fish schooling in nature, viz., the preying, swarming, following and random behaviors. Owing to a number of salient properties, which include flexibility, fast convergence, and insensitivity to the initial parameter settings, the family of AFSA has emerged as an effective Swarm Intelligence (SI) methodology that has been widely applied to solve real-world optimization problems. Since its introduction in 2002, many improved and hybrid AFSA models have been developed to tackle continuous, binary, and combinatorial optimization problems. This paper aims to present a concise review of the family of AFSA, encompassing the original ASFA and its improvements, continuous, binary, discrete, and hybrid models, as well as the associated applications. A comprehensive survey on the AFSA from its introduction to 2012 can be found in [1]. As such, we focus on a total of {\color{blue}123} articles published in high-quality journals since 2013. We also discuss possible AFSA enhancements and highlight future research directions for the family of AFSA-based models.Comment: 37 pages, 3 figure