arrow
Return

An adaptive binary quantum-behaved particle swarm optimization algorithm for the multidimensional knapsack problem

delete2024-04-01
delete4
PRE
AI
X
Xiaotong Li
W
Wei Fang *
S
Shuwei Zhu
X
Xin Zhang
DOI:10.1016/j.swevo.2024.101494delete
deleteOriginal
deleteShare
deleteSave
Abstract

Abstract

En 中文
The multidimensional knapsack problem (MKP) is a classical combinatorial optimization problem with wide real -life applications. Binary quantum -behaved particle swarm optimization (BQPSO) algorithm is a popular heuristic algorithm used in binary optimization. While BQPSO exhibits strong global search capabilities, it is still prone to local optima due to particle aggregation. To address this issue, an adaptive BQPSO (ABQPSO) algorithm is proposed to solve the MKP efficiently. A hybrid encoding population initialization scheme is employed, leveraging specific knowledge of MKP to increase population diversity and improve search efficiency. Furthermore, ABQPSO uses a mapping strategy that converts continuous values into discrete values based on the average position of particles. An adaptive repair operator considering two pseudo -utility ratios introduced to enable particles to explore different feasible regions, which dynamically adjusts current pseudo utility ratios based on changes in the global best solution. A local search method is applied to guide particles towards convergence to the optimum. A local sparseness degree measurement and a diversity mechanism are utilized to avoid local optima. To evaluate the effectiveness of ABQPSO, it is compared against ten stateof-the-art algorithms using 168 MKP benchmark instances of varying scales. Experimental results reveal that ABQPSO outperforms the comparison algorithms, especially for large-scale problems, demonstrating better solution accuracy.
Keywords:
Multidimensional knapsack problem
Combinatorial optimization problem
Quantum-behaved particle swarm optimization
Adaptive repair operator
Local search

Journal

Swarm and Evolutionary Computation cover
Swarm and Evolutionary Computation
IF:
8.5
Papers:
2.2K
Citations:
1.0W

Organization

J
Jiangnan University
Scholars:
3.9W
Papers: 2.7W
Citations: 4.7W
Cited Papers

Cited Papers

errShare
errSave
Citizens Defending America
err
IF0
err2005-11-18
err0
PREAI
errMARTIN ALAN GREENBERG
errShare
errSave
Hyper-Heuristics to customise metaheuristics for continuous optimisation
err2021-10-01
err41
PREAI
errCruz-Duarte, Jorge M.; Amaya, Ivan; Ortiz-Bayliss, Jose C.; Conant-Pablos, Santiago E.; Terashima-Marin, Hugo; Shi, Yong
errShare
errSave
Improved binary artificial fish swarm algorithm for the 0-1 multidimensional knapsack problems
err2014-02-01
err94
errOAAI
errAzad, Md. Abul Kalam; Rocha, Ana Maria A. C.; Fernandes, Edite M. G. P.
errShare
errSave
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
err2006-06-01
err3.2K
PREAI
errLiang, J. J.; Qin, A. K.; Suganthan, Ponnuthurai Nagaratnam; Baskar, S.
errShare
errSave
researcher View more