It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
As a new meta heuristic intelligent algorithm, crow search algorithm simulates the behavior of crows following each other and stealing food. Due to the simplicity and robustness of crow search algorithm, it has been successfully applied in many fields. However, like other swarm intelligence optimization algorithms, crow search algorithm also has the disadvantages of slow convergence speed and easy to fall into local optimization. In order to improve the convergence accuracy and later search ability of the algorithm, a new hybrid crow search algorithm called multi strategy disturbance improved crow search algorithm (MSD-CSA) is proposed based on the traditional crow search algorithm. In MSD-CSA, the sharing mechanism is added to improve the location update mode of random tracking in the original algorithm, reduce the search blindness and improve the convergence speed. In addition, the global optimal location is perturbed with different sizes in different iterative stages, which effectively improves the probability of jumping out of the local optimal and ensures the balance between the global search ability and the local search ability of the algorithm. In order to evaluate the effectiveness of MSD-CSA algorithm, it is applied to 20 basic test functions for optimization experiments, and compared with other intelligent optimization algorithms. Experimental results show that the average convergence and robustness of the proposed algorithm are better than other algorithms, and the overall performance is good.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer