Abstract
Along with the rapid development of mobile Internet, Internet of things and cloud computing technology, the data volume has shown an explosive growth in different industries. Big data technology, which provides new solutions to data-related problems, draws an increasing attention, especially in the field of artificial intelligence. Swarm intelligence is an important tool for solving complex problems in both scientific research and engineering practice. Representing a major development trend in artificial intelligence and information science, swarm intelligence has displayed great application potentials in big data analysis and data mining. Firefly algorithm (FA), an optimization technique based on swarm intelligence, has been successfully applied to a diversity of complex engineering optimization problems. In a standard FA, particles migrate blindly towards those better ones, without considering the status of the object of learning. However, this type of particle regeneration may result in a solution being trapped into local optima, with fast convergence speed but low convergence precision. We propose an FA with Gaussian disturbance and local search. The swarm is updated using random attraction model. The current position of the particle is compared with particle’s historical optimal position. If the current position is inferior to the historical optimal position, the particle is updated by Gaussian disturbance and local search strategy. The optimal particle will be selected for the next round of learning. This method not only enhances population diversity, but also increases optimizing precision. Simulations were performed on 12 benchmark functions under the same parameters. The results indicate that the optimizing performance of the proposed algorithm is superior to the other 5 recently provided FA methods. Local search strategy, as compared with random attraction model and Gaussian disturbance, can dramatically improve the optimizing performance.
Sign-in/Register to access full text options 
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.
