Abstract
This paper introduces an innovative variant of the Marine Predators Algorithm (MPA), termed the Dynamic Matrix Transformation-based Oppositional Marine Predators Algorithm (DMT-OMPA), aimed at enhancing the efficiency of engineering optimization strategies. Traditional MPAs have several shortcomings, including insufficient solution diversity and coverage in the initialization phase, a tendency to become trapped in local optima, and inadequate search capabilities in the later stages of iteration, all of which negatively impact the algorithm’s efficiency and effectiveness. To address these issues, the DMT-OMPA incorporates oppositional learning mechanisms and dynamic matrix transformation strategies, significantly enhancing global search capabilities and accelerating convergence speed, particularly in handling complex multidimensional optimization problems.Experimental results on the CEC2013 and CEC2017 test suites demonstrate that DMT-OMPA outperforms other recent MPA variants, various classical algorithm variants, and newly proposed algorithms, verifying its advantages in precision and reliability. Furthermore, the application of this algorithm to various real-world engineering problems substantiates its broad applicability and high efficiency. The study’s findings not only deepen our understanding of swarm intelligence optimization algorithms but also provide a new efficient tool for solving complex engineering problems. The results indicate a promising potential for wider application in diverse fields, suggesting that the DMT-OMPA algorithm could become an effective tool for tackling complex optimization problems in the future.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Computer Methods in Applied Mechanics and Engineering
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.