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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information sciences Jg. 648; S. 119529
Hauptverfasser:	Li, Xiaotong, Fang, Wei, Zhu, Shuwei
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.11.2023
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!