An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems

The 0-1 knapsack problem is a typical NP-hard combinatorial optimization problem that is difficult to solve efficiently based on traditional optimization approaches. Binary quantum-behaved particle swarm optimization (BQPSO) algorithm is a simple yet efficient discrete optimization approach since it...

Full description

Bibliographic Details

Published in:	Information sciences Vol. 648; p. 119529
Main Authors:	Li, Xiaotong, Fang, Wei, Zhu, Shuwei
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.11.2023
Subjects:	Combinatorial optimization problem Knapsack problem Local attractor Quantum-behaved particle swarm optimization Transfer function Transfer function Local attractor Quantum-behaved particle swarm optimization Knapsack problem Combinatorial optimization problem
ISSN:	0020-0255, 1872-6291
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!