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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aiex RM, Resende MGC, Ribeiro CC (2005) Tttplots: a perl program to create time-to-target plots. Technical report TD-6HT7EL, AT & T Labs
Andrade PMD, Plastino A, Ochi LS, Martins SL (2003) GRASP for the maximum diversity problem. In: Proceedings of the fifth metaheuristics international conference (MIC 2003)
Andrade PMD, Plastino LS, Martins SL (2005) GRASP with path-relinking for the maximum diversity problem. In: Nikoletseas S (ed) Proceedings of the 4th International workshop on efficient and experimental algorithms (WEA 2005), Lecture Notes in Computer Science (LNCS), vol 3539. Springer, Heidelberg, pp 558–569
Dell’Amico M, Trubian M (1998) Solution of large weighted equicut problems. Eur J Oper Res 106:500–521
Festa P, Resende MGC (2002) GRASP: An annotated bibliography. In: Ribeiro CC, Hansen P (eds). Essays and surveys in metaheuristics. Kluwer, Dordrecht, pp 325–367
Ghosh JB (1996) Computational aspects of maximum diversity problem. Oper Res Lett 19:175–181
Glover F, Laguna M (1997) Tabu Search. Kluwer, Dordrecht
Glover F, Hersh G, McMillian C (1977) Selecting subset of maximum diversity. MS/IS 77-9. University of Colorado, Boulder
Glover F, Kuo CC, Dhir KS (1995) A discrete optimization model for preserving biological diversity. Appl Math Modelling 19(11):696–701
Glover F, Kuo CC, Dhir KS (1996) Integer programming and heuristic approaches to the minimum diversity problem. J Bus Manage 4(1):93–111
Kochenberger G, Glover F (1999) Diversity data mining. Working paper series HCES-03-99, The University of Mississipi
Kuo CC, Glover F, Dhir KS (1993) Analyzing and modeling the maximum diversity problem by zero-one programming. Decis Sci 24:1171–1185
Silva GC, Ochi LS, Martins SL (2004) Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem. In: Proceedings of the 3rd international workshop on efficient and experimental algorithms (WEA 2004), Lectures Notes on Computer Science (LNCS), vol 3059. Springer, Heidelberg, pp 498–512
Weitz R, Lakshminarayanan S (1998) An empirical comparison of heuristic methods for creating maximally diverse group. J Oper Res Soc 49:635–646
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Aringhieri, R., Cordone, R. & Melzani, Y. Tabu Search versus GRASP for the maximum diversity problem. 4OR 6, 45–60 (2008). https://doi.org/10.1007/s10288-007-0033-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-007-0033-9