DMCA
Tabu search vs. GRASP for the Maximum Diversity Problem (2005)
| Citations: | 3 - 1 self |
BibTeX
@MISC{Aringhieri05tabusearch,
author = {Roberto Aringhieri and Roberto Cordone and Yari Melzani},
title = {Tabu search vs. GRASP for the Maximum Diversity Problem },
year = {2005}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The Maximum Diversity Problem (MDP) consists in determining a subset M of given cardinality from a set of elements N, in such a way that the sum of the pairwise distances between the elements of M is maximum. This problem, introduced by Glover [6], has been deeply studied using GRASP methodologies [5, 1, 13, 2]. GRASP is often characterized by a strong design effort dedicated to build high quality randomized starting solutions, while the subsequent improvement phase is usually performed by a standard local search technique. The purpose of this paper is to explore a somewhat opposite approach, that is to refine the local search phase, by adopting Tabu Search methodologies, while keeping a very simple initialization procedure. Extensive computational results show that Tabu Search achieves both better results and much shorter computational times with respect to those reported for GRASP.
Keyphrases
maximum diversity problem tabu search v tabu search methodology grasp methodology simple initialization procedure strong design effort high quality standard local search technique local search phase subsequent improvement phase extensive computational result computational time opposite approach tabu search
