期刊
COMPUTERS & ELECTRICAL ENGINEERING
卷 67, 期 -, 页码 454-468出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.compeleceng.2017.12.014
关键词
Monarch butterfly optimization; Opposition-based learning; Gaussian perturbation; 0-1 knapsack problems
类别
资金
- National Natural Science Foundation of China [61503165, 41576011, 61402207, 61772225]
- Natural Science Foundation of Jiangsu Province [BK20150239]
- National Natural Science Fund for Distinguished Young Scholars of China [61525304]
Monarch butterfly optimization (MBO) has become an effective optimization technique for function optimization and combinatorial optimization. In this paper, a generalized opposition-based learning (OBL) monarch butterfly optimization with Gaussian perturbation (OMBO) is presented, in which OBL strategy is used on half individuals of the population in the late stage of evolution and Gaussian perturbation acts on part of the individuals with poor fitness in each evolution. OBL guarantees the higher convergence speed of OMBO and Gaussian perturbation avoids to be stuck at a local optimum. In order to test and verify the effectiveness of the proposed method, three groups of 15 large-scale 0-1 KP instances from 800 to 2000 dimensions are used in our studies. The experimental results indicate that OMBO can find high-quality solutions. (C) 2017 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据