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

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 232; no. 3; pp. 454 - 463
Main Authors:	García-Martínez, C., Rodriguez, F.J., Lozano, M.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.02.2014 Elsevier Sequoia S.A
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!