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

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

Full description

Bibliographic Details

Published in:	Swarm and evolutionary computation Vol. 86; p. 101494
Main Authors:	Li, Xiaotong, Fang, Wei, Zhu, Shuwei, Zhang, Xin
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.04.2024
Subjects:	Adaptive repair operator Combinatorial optimization problem Local search Multidimensional knapsack problem Quantum-behaved particle swarm optimization Local search Adaptive repair operator Quantum-behaved particle swarm optimization Multidimensional knapsack problem Combinatorial optimization problem
ISSN:	2210-6502
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!