Hybrid firefly algorithm with grouping attraction for constrained optimization problem

作者：

Highlights：

• Presents HFA-GA for constrained optimization problem.

• Grouping attraction is firstly proposed to reduce computational time complexity.

• The position update formulas with the guidance of the best firefly are added.

• Combination mutation operator with three type mutation operators is introduced.

• Superior performance than the art in terms of various algorithms.

摘要

•Presents HFA-GA for constrained optimization problem.•Grouping attraction is firstly proposed to reduce computational time complexity.•The position update formulas with the guidance of the best firefly are added.•Combination mutation operator with three type mutation operators is introduced.•Superior performance than the art in terms of various algorithms.

论文关键词：Firefly algorithm,Grouping attraction,Combination mutation,Constrained optimization problem

论文评审过程：Received 15 August 2020, Revised 2 February 2021, Accepted 6 March 2021, Available online 10 March 2021, Version of Record 18 March 2021.

论文官网地址：https://doi.org/10.1016/j.knosys.2021.106937