GRASP with path-relinking for the maximum diversity problem

  • Authors:
  • Marcos R. Q. de Andrade;Paulo M. F. de Andrade;Simone L. Martins;Alexandre Plastino

  • Affiliations:
  • Departamento de Ciência da Computação, Universidade Federal Fluminense, Niterói, RJ, Brazil;Departamento de Ciência da Computação, Universidade Federal Fluminense, Niterói, RJ, Brazil;Departamento de Ciência da Computação, Universidade Federal Fluminense, Niterói, RJ, Brazil;Departamento de Ciência da Computação, Universidade Federal Fluminense, Niterói, RJ, Brazil

  • Venue:
  • WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse characteristics between themselves. The identification of such solution is an NP-hard problem. This paper presents a GRASP heuristic associated with the path-relinking technique developed to obtain high-quality solutions for this problem in a competitive computational time. Experimental results illustrate the effectiveness of using the path-relinking method to improve results generated by pure GRASP.