Abstract
Dragonfly algorithm (DA) is a new optimization technique based on swarm intelligence. DA simulates the static and dynamic swarming behaviors of dragonflies in nature. The search pattern of DA consists of two essential phases: exploration and exploitation that are inspired by the survival rule of dragonflies in navigating, searching for food and fleeing enemies when dynamically or statistically swarming. This method is straightforward to implement and is efficient in solving real-world problems. However, an excessive number of social interactions in DA may result in low solution accuracy, easy stagnation at local optima and an imbalance between exploration and exploitation. To overcome these deficiencies, an improved Nelder–Mead algorithm is added to the conventional DA (INMDA) to strengthen its local explorative capability and avoid the possibility of falling into local optima. Simulation experiments were conducted on several well-known benchmark functions with different dimensions. In addition, the three classic classification problems are utilized to benchmark the performance of the proposed algorithm in training a multilayer perceptron. The experimental results and statistical significance show that the performance of the proposed INMDA is superior to that of the other algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.