Abstract

Combinatorial metaheuristic optimization algorithms have newly become a remarkable domain for handling real-world and engineering design optimization problems. In this paper, the Whale Optimization Algorithm (WOA) and the Woodpecker Mating Algorithm (WMA) are combined as HWMWOA. WOA is an effective algorithm with the advantage of global searching ability, where the control parameters are very less. But WOA is more probable to get trapped in the local optimum points and miss diversity of population, therefore suffering from premature convergence. The fundamental goal of the HWMWOA algorithm is to overcome the drawbacks of WOA. This betterment includes three basic mechanisms. First, a modified position update equation of WMA by efficient exploration ability is embedded into HWMWOA. Second, a new self-regulation Cauchy mutation operator is allocated to the proposed hybrid method. Finally, an arithmetic spiral movement with a novel search guide pattern is used in the suggested HWMWOA algorithm. The efficiency of the suggested algorithm is appraised over 48 test functions, and the optimal outcomes are compared with 15 most popular and newest metaheuristic optimization algorithms. Moreover, the HWMWOA algorithm is applied for simultaneously optimizing the parameters of SVM (Support Vector Machine) and feature weighting to handle the data classification problem on several real-world datasets from the UCI database. The outcomes prove the superiority of the suggested hybrid algorithm compared to both WOA and WMA. In addition, the results represent that the HWMWOA algorithm outperforms other efficient techniques impressively.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.