A hybrid heuristic for the 0–1 Knapsack Sharing Problem

•A new hybrid method based on ILPH and QPSO is proposed and validated on the KSP.•The proposed approach can be easily adapted to other variants of knapsack problems.•New valid constraints are used to speed up the reduced problems solved inside ILPH.•A local search is incorporated in ILPH as an inten...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Expert systems with applications Jg. 42; H. 10; S. 4653 - 4666
Hauptverfasser:	Haddar, Boukthir, Khemakhem, Mahdi, Hanafi, Saïd, Wilbaut, Christophe
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 15.06.2015 Elsevier
Schlagworte:	Algorithms Amplification Computer Science Expert systems Heuristic Hybrid method Knapsack problem Linear programming Mathematical models Optimization Particle swarm optimization Relaxation Swarm intelligence Relaxation Hybrid method Particle swarm optimization Knapsack problem "Relaxation" "Knapsack problem" "Particle swarm optimization" "Hybrid method"
ISSN:	0957-4174, 1873-6793
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!