Name
Abstract | ||
|---|---|---|
Description: 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 differences between the elements of M is maximum. This problem, introduced by Glover, Hersh and McMillian has been deeply studied using the GRASP methodology.
GRASPs are often characterized by a strong design effort dedicated to the randomized generation of high quality 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 a Tabu Search methodology,
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s10288-007-0033-9 | 4OR |
Keywords | Field | DocType |
maximum diversity · grasp · tabu search msc classification 90c26 · 90c59,tabu search,local search | Hill climbing,Pairwise comparison,Mathematical optimization,GRASP,Guided Local Search,Cardinality,Local search (optimization),Initialization,Mathematics,Tabu search | Journal |
Volume | Issue | ISSN |
6 | 1 | 1614-2411 |
Citations | PageRank | References |
22 | 1.01 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roberto Aringhieri | 1 | 200 | 15.90 |
| Roberto Cordone | 2 | 310 | 28.87 |
| Yari Melzani | 3 | 22 | 1.35 |