A binary grey wolf optimizer for the multidimensional knapsack problem

Luo, Kaiping

Abstract

Grey Wolf Optimizer (GWO) is a new meta-heuristic that mimics the leadership hierarchy and group hunting mechanism of grey wolves in nature. A binary version is developed to tackle the multidimensional knapsack problem which has an extensive engineering background. The proposed binary grey wolf optimizer integrates some important features including an initial elite population generator, a pseudo-utility-based quick repair operator, a new evolutionary mechanism with a differentiated position updating strategy. The proposed algorithm takes full advantage of the knowledge of the problem to be solved and highlights the distinctive feature of the optimizer in the family of evolutionary algorithm. Experimental results statistically show the effectiveness of the new optimizer and the superiority of the proposed algorithm in solving the multidimensional knapsack problem, especially the large-scale problem. (C) 2019 Elsevier B.V. All rights reserved.

Más información

Título según WOS: ID WOS:000488100900044 Not found in local WOS DB
Título de la Revista: Applied Soft Computing
Volumen: 83
Editorial: Elsevier Ltd.
Fecha de publicación: 2019
DOI:

10.1016/j.asoc.2019.105645

Notas: ISI