prey predator algorithm is a swarm-based metaheuristic algorithm inspired by the interaction between a predator and its prey. The worst performing solution from the solution set is called a predator, the best preformi...
详细信息
prey predator algorithm is a swarm-based metaheuristic algorithm inspired by the interaction between a predator and its prey. The worst performing solution from the solution set is called a predator, the best preforming solution is called best prey and the rest are called ordinary prey. The predator focuses on exploration while the best prey totally focuses on exploitation. Parameter assignments, especially step length, plays an important role in rapid convergence of the solution to the optimal solution. If the step length is too short, the algorithm will take more time to converge whereas if it is too big, then the algorithm will oscillates by jumping over the solution, making it hard to obtain the desired quality of solution. In this paper, adaptive step length for prey predator algorithm will be used to produce a rapid convergence. The study is also supported by simulation results with appropriate statistical analysis.
In this study, artificial neural networks were employed to predict thermal conductivity of polyacrylonitrile (PAN) electrospun nanocomposite fibers embedded with multiwalled carbon nanotubes (MWCNTs) and Nickel Zinc f...
详细信息
In this study, artificial neural networks were employed to predict thermal conductivity of polyacrylonitrile (PAN) electrospun nanocomposite fibers embedded with multiwalled carbon nanotubes (MWCNTs) and Nickel Zinc ferrites [(Ni0.6Zn0.4) Fe2O4]. The prey predator algorithm was used to train the neural networks to find the best models. This is the first paper on the application of multilayer perception neural network (MLPNN) with the prey predator algorithm for the prediction of thermal conductivity of PAN Electrospun nanocomposites. The method of nonlinear regression was used to minimize the error distribution between the experimental data and the predicted results. Both MWCNTs and Nickel Zinc ferrites were used in different weight proportions. The predicted ANN responses were analyzed statistically using z-test and error functions for both nanoinclusions. The predicted ANN responses for PAN Electrospun nanocomposite fibers were compared with the experimental data and were found in good agreement. (C) 2018 Production and hosting by Elsevier B.V. on behalf of King Saud University.
Unlike their success in solving complex and difficult problems, there is a lack of proper mathematical analysis and discussion of metaheuristic algorithms. Even though some researches are done on these aspects, the ga...
详细信息
prey predator algorithm is a population based metaheuristic algorithm inspired by the interaction between a predator and its prey. In the algorithm, a solution with a better performance is called best prey and focuses...
详细信息
prey predator algorithm is a population based metaheuristic algorithm inspired by the interaction between a predator and its prey. In the algorithm, a solution with a better performance is called best prey and focuses totally on exploitation whereas the solution with least performance is called predator and focuses totally on exploration. The remaining solutions are called ordinary prey and either exploit promising regions by following better performing solutions or explore the solution space by randomly running away from the predator. Recently, it has been shown that by increasing the number of best prey or predator, it is possible to adjust the degree of exploitation and exploration. Even though, this tuning has the advantage of easily controlling these search behaviors, it is not an easy task. As any other metaheuristic algorithm, the performance of prey predator algorithm depends on the proper degree of exploration and exploitation of the decision space. In this paper, the concept of hyperheuristic is employed to balance the degree of exploration and exploitation of the algorithm. So that it learns and decides the best search behavior for the problem at hand in iterations. The ratio of the number of the best prey and the predators are used as low level heuristics. From the simulation results the balancing of the degree of exploration and exploitation by using hyperheuristic mechanism indeed improves the performance of the algorithm. Comparison with other algorithms shows the effectiveness of the proposed approach. (C) 2017 Elsevier B.V. All rights reserved.
We propose a new adaptive NURBS upper-bound limit analysis approach for the assessment of general three-dimensional curved masonry structures, based on different meta-heuristic mesh adaptation schemes. The method, whi...
详细信息
We propose a new adaptive NURBS upper-bound limit analysis approach for the assessment of general three-dimensional curved masonry structures, based on different meta-heuristic mesh adaptation schemes. The method, which can easily be integrated within CAD modeling environments, allows to establish the actual failure mechanism and load bearing capacity of a masonry structure by iteratively adjusting a tentative pattern of yield lines, defined upon a suitable initial mesh of NURBS rigid elements, by means of a suitable meta-heuristic algorithm which searches for the minimum collapse load multiplier, thus enforcing the upper-bound theorem of limit analysis. In particular, we investigate and discuss the efficiency of several meta-heuristic algorithms in delivering the optimal solution: a specifically devised prey predator algorithm (PPA) is compared with the Particle Swarm Optimization (PSO) algorithm, the Firefly algorithm (FA) and a suitable Genetic algorithm (GA). Four masonry vaults have been chosen as case studies. In particular, the modified PPA proves to be the most efficient mesh-adjustment scheme for the proposed adaptive NURBS-based limit analysis procedure. (C) 2020 Elsevier Ltd. All rights reserved.
暂无评论