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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Expert systems with applications Ročník 42; číslo 10; s. 4653 - 4666
Hlavní autori:	Haddar, Boukthir, Khemakhem, Mahdi, Hanafi, Saïd, Wilbaut, Christophe
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 15.06.2015 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!