Opposition-based learning monarch butterfly optimization with Gaussian perturbation for large-scale 0-1 knapsack problem. (April 2018)

• Record Type: Journal Article
• Authors: Feng, Yanhong; Wang, Gai-Ge; Dong, Junyu; Wang, Ling
• Is Part Of: Computers & electrical engineering. Volume 67(2018)
• Page Start: 454
• Page End: 468
• Publication Date: 2018-04
• Subjects: Monarch butterfly optimization -- Opposition-based learning -- Gaussian perturbation -- 0-1 knapsack problems; Computer engineering -- Periodicals; Electrical engineering -- Periodicals; Electrical engineering -- Data processing -- Periodicals; Ordinateurs -- Conception et construction -- Périodiques; Électrotechnique -- Périodiques; Électrotechnique -- Informatique -- Périodiques; Computer engineering; Electrical engineering; Electrical engineering -- Data processing; Periodicals; Electronic journals; 621.302854
• DOI: 10.1016/j.compeleceng.2017.12.014
• Languages: English
• ISSNs: 0045-7906

Abstract

Abstract: 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.