Tabu search versus GRASP for the maximum diversity problem

DOI10.1007/s10288-007-0033-9zbMath1135.90381OpenAlexW1968280824MaRDI QIDQ926570

Roberto Aringhieri, Roberto Cordone, Yari Melzani

Publication date: 20 May 2008

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-007-0033-9

zbMATH Keywords

tabu searchGRASPmaximum diversity

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (15)

A tabu search based memetic algorithm for the Max-Mean dispersion problem ⋮ Solving the quadratic minimum spanning tree problem ⋮ A review on discrete diversity and dispersion maximization from an OR perspective ⋮ A two-phase tabu search based evolutionary algorithm for the maximum diversity problem ⋮ Initialization of metaheuristics: comprehensive review, critical analysis, and research directions ⋮ Composing medical crews with equity and efficiency ⋮ A simple and effective algorithm for the MaxMin diversity problem ⋮ Heuristic solution approaches for the maximum minsum dispersion problem ⋮ Solving the maximum min-sum dispersion by alternating formulations of two different problems ⋮ Iterated greedy for the maximum diversity problem ⋮ Measuring diversity. A review and an empirical analysis ⋮ Construction and improvement algorithms for dispersion problems ⋮ A heuristic approach for the max-min diversity problem based on max-clique ⋮ Variable neighborhood search for the heaviest \(k\)-subgraph ⋮ A hybrid metaheuristic method for the maximum diversity problem

Uses Software

• GRASP
• PERL
• TTTPLOTS
• Tabu search

Cites Work

• Unnamed Item
• Computational aspects of the maximum diversity problem
• Solution of large weighted equicut problems
• A discrete optimization model for preserving biological diversity
• An empirical comparison of heuristic methods for creating maximally diverse groups
• Experimental and Efficient Algorithms

This page was built for publication: Tabu search versus GRASP for the maximum diversity problem