Probability Distribution of Solution Time in GRASP: An Experimental Investigation
Journal of Heuristics
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
INFORMS Journal on Computing
Computational aspects of the maximum diversity problem
Operations Research Letters
Competitive Hopfield network combined with estimation of distribution for maximum diversity problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
A hybrid GRASP with data mining for the maximum diversity problem
HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
A tabu search based memetic algorithm for the maximum diversity problem
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
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.