A Novel Hybrid Firefly Algorithm for Global Optimization

نویسندگان

  • Lina Zhang
  • Liqiang Liu
  • Xin-She Yang
  • Yuntao Dai
چکیده

Global optimization is challenging to solve due to its nonlinearity and multimodality. Traditional algorithms such as the gradient-based methods often struggle to deal with such problems and one of the current trends is to use metaheuristic algorithms. In this paper, a novel hybrid population-based global optimization algorithm, called hybrid firefly algorithm (HFA), is proposed by combining the advantages of both the firefly algorithm (FA) and differential evolution (DE). FA and DE are executed in parallel to promote information sharing among the population and thus enhance searching efficiency. In order to evaluate the performance and efficiency of the proposed algorithm, a diverse set of selected benchmark functions are employed and these functions fall into two groups: unimodal and multimodal. The experimental results show better performance of the proposed algorithm compared to the original version of the firefly algorithm (FA), differential evolution (DE) and particle swarm optimization (PSO) in the sense of avoiding local minima and increasing the convergence rate.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A HYBRID CHARGED SYSTEM SEARCH - FIREFLY ALGORITHM FOR OPTIMIZATION OF WATER DISTRIBUTION NETWORKS

Water distribution networks are one of the important and costly infrastructures of cities and many meta-heuristic algorithms in standard or hybrid forms were used for optimizing water distribution networks. These algorithms require a large amount of computational cost. Therefore, the converging speed of algorithms toward the optimization goal is as important as the goal itself. In this paper, a...

متن کامل

A Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms

In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...

متن کامل

A hybrid Approach for economic power dispatch

In this paper, a novel hybrid optimization algorithm, which combines a firefly algorithms and Artificial Bee Colony algorithm (FFAABC), is proposed for solving the economic power dispatch (EPD) problem. The hybrid algorithm is structured with two stages. The first stage uses the search by firefly algorithm (FFA) and second stage is a search with Artificial Bee Colony algorithm (ABC). The hybrid...

متن کامل

A Hybrid Grey based Two Steps Clustering and Firefly Algorithm for Portfolio Selection

Considering the concept of clustering, the main idea of the present study is based on the fact that all stocks for choosing and ranking will not be necessarily in one cluster. Taking the mentioned point into account, this study aims at offering a new methodology for making decisions concerning the formation of a portfolio of stocks in the stock market. To meet this end, Multiple-Criteria Decisi...

متن کامل

Hybridizing ant colony optimization with firefly algorithm for unconstrained optimization problems

we propose a novel hybrid algorithm named ACO-FA, which integrates the merits of ant colony optimization (ACO) with firefly algorithm (FA) to solve unconstrained optimization problems. The main feature of the hybrid algorithm is to hybridize the solution construction mechanism of the ACO with the FA. In our hybrid algorithm, the initial solutions are generated randomly from the search space, an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2016