Abstract

The success of the search in the firefly algorithm is highly dependent on a good balance between exploration and exploitation. Although, the basic firefly algorithm is relatively efficient; two chaotic firefly algorithms based on Logistic map (CLFA) and Gaussian map (CGFA) have been presented to improve basic FA. As numerical examples, some large-scale domes are designed for multiple frequency constraints optimization. Despite the fact that these problems are highly nonlinear, results illustrate a desirable performance of the algorithms in both obtaining lower weight and having a higher convergence rate.

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.