Topic
Firefly algorithm
About: Firefly algorithm is a research topic. Over the lifetime, 3931 publications have been published within this topic receiving 105010 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this article, a hybrid algorithm combining particle swarm optimization (PSO) algorithm with back-propagation (BP) algorithm, also referred to as PSO-BP algorithm, is proposed to train the weights of feedforward neural network (FNN), the hybrid algorithm can make use of not only strong global searching ability of the PSOA, but also strong local searching capability of the BP algorithm.
591 citations
01 Mar 2012
TL;DR: This paper presents a novel approach to determining the feasible optimal solution of the ED problems using the recently developed Firefly Algorithm, and shows that the proposed FA is able to find more economical loads than those determined by other methods.
Abstract: The growing costs of fuel and operation of power generating units warrant improvement of optimization methodologies for economic dispatch (ED) problems. The practical ED problems have non-convex objective functions with equality and inequality constraints that make it much harder to find the global optimum using any mathematical algorithms. Modern optimization algorithms are often meta-heuristic, and they are very promising in solving nonlinear programming problems. This paper presents a novel approach to determining the feasible optimal solution of the ED problems using the recently developed Firefly Algorithm (FA). Many nonlinear characteristics of power generators, and their operational constraints, such as generation limitations, prohibited operating zones, ramp rate limits, transmission loss, and nonlinear cost functions, were all contemplated for practical operation. To demonstrate the efficiency and applicability of the proposed method, we study four ED test systems having non-convex solution spaces and compared with some of the most recently published ED solution methods. The results of this study show that the proposed FA is able to find more economical loads than those determined by other methods. This algorithm is considered to be a promising alternative algorithm for solving the ED problems in practical power systems.
578 citations
TL;DR: It has been observed that the reactive approaches are more robust and perform well in all terrain when compared to classical approaches and are used to improve the performance of the classical approaches as a hybrid algorithm.
450 citations
TL;DR: It is concluded that the FA can be efficiently used for clustering and compared with other two nature inspired techniques — Artificial Bee Colony, Particle Swarm Optimization and other nine methods used in the literature.
Abstract: A Firefly Algorithm (FA) is a recent nature inspired optimization algorithm, that simulates the flash pattern and characteristics of fireflies. Clustering is a popular data analysis technique to identify homogeneous groups of objects based on the values of their attributes. In this paper, the FA is used for clustering on benchmark problems and the performance of the FA is compared with other two nature inspired techniques — Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO), and other nine methods used in the literature. Thirteen typical benchmark data sets from the UCI machine learning repository are used to demonstrate the results of the techniques. From the results obtained, we compare the performance of the FA algorithm and conclude that the FA can be efficiently used for clustering.
437 citations
TL;DR: In this paper, the authors extend the recently developed firefly algorithm to solve multi-objective optimization problems and validate the proposed approach using a selected subset of test functions and then apply it to solve design optimization benchmarks.
Abstract: Design problems in industrial engineering often involve a large number of design variables with multiple objectives, under complex nonlinear constraints. The algorithms for multiobjective problems can be significantly different from the methods for single objective optimization. To find the Pareto front and non-dominated set for a nonlinear multiobjective optimization problem may require significant computing effort, even for seemingly simple problems. Metaheuristic algorithms start to show their advantages in dealing with multiobjective optimization. In this paper, we extend the recently developed firefly algorithm to solve multiobjective optimization problems. We validate the proposed approach using a selected subset of test functions and then apply it to solve design optimization benchmarks. We will discuss our results and provide topics for further research.
414 citations