HMOFA: A Hybrid Multi-Objective Firefly Algorithm
Author:
Affiliation:

Clc Number:

Fund Project:

National Natural Science Foundation of China (61763010, 61563015, 61663009, 61602174); Guangxi "BAGUI Scholar" Program; Natural Science Foundation of Guangxi Zhuang Autonomous Region, China (2016GXNSFAA380209); Natural Science Foundation of Jiangxi Province, China (20114BAB201025, 20161BAB212052, 20161BAB202064); Ministry of Education Humanities and Social Sciences Youth Fund (14YJCZH172); Jiangxi Science and Technology Support Project (20151BBG70055); Jiangxi Postdoctoral Fund (2015KY18); Science and Technology Project of Jiangxi Provincial Department of Education (GJJ12307, GJJ14373, GJJ14374, GJJ160469, GJJ150496); Science Computing and Intelligent Information Processing of Guangxi Higher Education Key Laboratory (GXSCIIP201604)

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    It is necessary to develop some novel multi-objective optimization algorithms to cope with the complicated multi-objective optimization problems which are emerging and increasingly hard in reality. The basic firefly algorithm is extended to the realm of multi-objective optimization, and a hybrid multi-objective firefly algorithm (HMOFA) is proposed in this paper. Firstly, an initialization approach of mix-level orthogonal experimental design with the quantification of the continuous search space is used to generate an even-distributed initial population in the decision space. Secondly, the elites in the external archive are randomly selected to guide the movement of the fireflies in the evolutionary process. Finally, the archive pruning strategy based on three-point shortest path is used to maintain the diversity of the external archive. The proposed HMOFA is compared with other five peer algorithms in the performance of hypervolume based on seventeen benchmark multi-objective test instances, and the experimental results show that the HMOFA employs the overall performance advantages in convergence, diversity and robustness over other peer algorithms.

    Reference
    Related
    Cited by
Get Citation

谢承旺,肖驰,丁立新,夏学文,朱建勇,张飞龙. HMOFA:一种混合型多目标萤火虫算法.软件学报,2018,29(4):1143-1162

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 09,2016
  • Revised:January 26,2017
  • Adopted:
  • Online: March 23,2017
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063