Abstract
Abstract In this paper, a novel hybrid optimization algorithm (H-HHONM) which combines the Nelder-Mead local search algorithm with the Harris hawks optimization algorithm is proposed for solving real-world optimization problems. This paper is the first research study in which both the Harris hawks optimization algorithm and the H-HHONM are applied for the optimization of process parameters in milling operations. The H-HHONM is evaluated using well-known benchmark problems such as the three-bar truss problem, cantilever beam problem, and welded beam problem. Finally, a milling manufacturing optimization problem is solved for investigating the performance of the H-HHONM. Additionally, the salp swarm algorithm is used to solve the milling problem. The results of the H-HHONM for design and manufacturing problems solved in this paper are compared with other optimization algorithms presented in the literature such as the ant colony algorithm, genetic algorithm, particle swarm optimization algorithm, simulated annealing algorithm, artificial bee colony algorithm, teaching learning-based optimization algorithm, cuckoo search algorithm, multi-verse optimization algorithm, Harris hawks optimization optimization algorithm, gravitational search algorithm, ant lion optimizer, moth-flame optimization algorithm, symbiotic organisms search algorithm, and mine blast algorithm. The results show that H-HHONM is an effective optimization approach for optimizing both design and manufacturing optimization problems.
Published Version
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 callDisclaimer: 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.
