Tabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problem |
| |
Authors: | C. Garcí a-Martí nez,F.J. Rodriguez,M. Lozano |
| |
Affiliation: | 1. Department of Computing and Numerical Analysis, University of Córdoba, Córdoba 14071, Spain;2. Department of Computer Science and Artificial Intelligence, CITIC-UGR (Research Center on Information and Communications Technology), University of Granada, Granada 18071, Spain |
| |
Abstract: | Iterated greedy search is a simple and effective metaheuristic for combinatorial problems. Its flexibility enables the incorporation of components from other metaheuristics with the aim of obtaining effective and powerful hybrid approaches. We propose a tabu-enhanced destruction mechanism for iterated greedy search that records the last removed objects and avoids removing them again in subsequent iterations. The aim is to provide a more diversified and successful search process with regards to the standard destruction mechanism, which selects the solution components for removal completely at random. |
| |
Keywords: | Iterated greedy search Tabu search Quadratic multiple knapsack problem Destruction mechanism |
本文献已被 ScienceDirect 等数据库收录! |