Heuristic algorithms for the maximum diversity problem
From MaRDI portal
Diversity maximization is concerned with selecting a subset of a predetermined number of elements that are as diverse as possible. In recent years, there has been a growing interest in the maximum diversity problem with respect to both solution method and practical application. We propose two constructive and two destructive heuristic algorithms for generating suboptimal solutions of high quality to the problem quickly. The special procedures are tested in a simulation study and the empirical results are subject to a standard statistical analysis.
Recommendations
Cites work
- A discrete optimization model for preserving biological diversity
- Computational aspects of the maximum diversity problem
- Dynamic tabu list management using the reverse elimination method
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Large-scale controlled rounding using tabu search with strategic oscillation
- On Diversity
- Optimization by simulated annealing
- Tabu search for a class of scheduling problems
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
Cited in
(43)- A heuristic approach for the max-min diversity problem based on max-clique
- The equitable dispersion problem
- Heuristics for the bi-objective path dissimilarity problem
- GRASP and path relinking for the max-min diversity problem
- Computational aspects of the maximum diversity problem
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- Measuring diversity. A review and an empirical analysis
- On the linear ordering problem and the rankability of data
- t-linearization for the maximum diversity problem
- A Davidson college multi-objective assignment problem: a case study
- Iterated greedy for the maximum diversity problem
- A hybrid metaheuristic method for the maximum diversity problem
- A branch and bound algorithm for the maximum diversity problem
- Iterated tabu search for the maximum diversity problem
- An exact semidefinite programming approach for the max-mean dispersion problem
- Memetic self-adaptive evolution strategies applied to the maximum diversity problem
- Hybrid heuristics for the maximum diversity problem
- A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS
- 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
- Maximizing single attribute diversity in group selection
- Using decomposition to improve greedy solutions of the optimal diversity management problem
- Maximum diversity/similarity models with extension to part grouping
- Including a diversity criterion in decision making
- An empirical comparison of heuristic methods for creating maximally diverse groups
- GRASP and path relinking for the equitable dispersion problem
- A hybrid three-phase approach for the Max-Mean dispersion problem
- A tabu search based memetic algorithm for the Max-Mean dispersion problem
- Heuristic solution approaches for the maximum minsum dispersion problem
- Enriching Solutions to Combinatorial Problems via Solution Engineering
- Hybrid scatter tabu search for unconstrained global optimization
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
- Heuristics for the capacitated dispersion problem
- Formulations and valid inequalities for the capacitated dispersion problem
- A simple and effective algorithm for the MaxMin diversity problem
- A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem
- Fast exact algorithms for the maximum diversity problem
- The most dispersed subset of random points in \(\mathbb{R}^d\)
- Construction and improvement algorithms for dispersion problems
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Tabu search and GRASP for the maximum diversity problem
This page was built for publication: Heuristic algorithms for the maximum diversity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4398552)
