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

Full description

Saved in:

Bibliographic Details
Published in:	Expert systems with applications Vol. 42; no. 10; pp. 4653 - 4666
Main Authors:	Haddar, Boukthir, Khemakhem, Mahdi, Hanafi, Saïd, Wilbaut, Christophe
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 15.06.2015 Elsevier
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!