Tabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problem

•Iterated greedy algorithms are tested on the quadratic multiple knapsack problem.•A memory-enhanced destruction mechanism for iterated greedy is proposed.•Problem-knowledge exploitation is identified in the iterated greedy proposal.•Tabu-enhanced iterated greedy solves the problem effectively. Iter...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	European journal of operational research Ročník 232; číslo 3; s. 454 - 463
Hlavní autori:	García-Martínez, C., Rodriguez, F.J., Lozano, M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.02.2014 Elsevier Sequoia S.A
Predmet:	Algorithms Combinatorial analysis Destruction Destruction mechanism Effectiveness studies Flexibility Greedy algorithms Heuristic Iterated greedy search Iterative methods Knapsack problem Operational research Quadratic multiple knapsack problem Searching Tabu search Tabu search Iterated greedy search Quadratic multiple knapsack problem Destruction mechanism
ISSN:	0377-2217, 1872-6860
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!