Iterated greedy for the maximum diversity problem |
| |
Authors: | M. Lozano D. Molina |
| |
Affiliation: | a Department of Computer Science and Artificial Intelligence, University of Granada, Granada 18071, Spain b Department of Computer Engineering, University of Cádiz, Cádiz 1103, Spain c Department of Computing and Numerical Analysis, University of Córdoba, Córdoba 14071, Spain |
| |
Abstract: | The problem of choosing a subset of elements with maximum diversity from a given set is known as the maximum diversity problem. Many algorithms and methods have been proposed for this hard combinatorial problem, including several highly sophisticated procedures. By contrast, in this paper we present a simple iterated greedy metaheuristic that generates a sequence of solutions by iterating over a greedy construction heuristic using destruction and construction phases. Extensive computational experiments reveal that the proposed algorithm is highly effective as compared to the best-so-far metaheuristics for the problem under consideration. |
| |
Keywords: | Maximum diversity problem Iterated greedy Local search Acceptance criterion |
本文献已被 ScienceDirect 等数据库收录! |
|