GRASP and path relinking for the equitable dispersion problem

DOI10.1016/j.cor.2012.04.005zbMath1348.90475OpenAlexW2093258914MaRDI QIDQ336711

Fernando Sandoya, Rafael Martí

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.04.005

zbMATH Keywords

metaheuristicsdiversityGRASP with path relinking

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

VNS variants for the Max-Mean dispersion problem, GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem, A hybrid three-phase approach for the Max-Mean dispersion problem, A tabu search based memetic algorithm for the Max-Mean dispersion problem, A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem, Tabu search guided by reinforcement learning for the max-mean dispersion problem, An exact semidefinite programming approach for the max-mean dispersion problem, A review on discrete diversity and dispersion maximization from an OR perspective, Tabu search and GRASP for the capacitated clustering problem, Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem, Heuristics for the capacitated dispersion problem, Heuristic solution approaches for the maximum minsum dispersion problem, Effective metaheuristic algorithms for the minimum differential dispersion problem, Measuring diversity. A review and an empirical analysis, Construction and improvement algorithms for dispersion problems, A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Tabu search and GRASP for the maximum diversity problem
• The equitable dispersion problem
• GRASP and path relinking for the max-min diversity problem
• Computational aspects of the maximum diversity problem
• A hybrid heuristic for the \(p\)-median problem
• A discrete optimization model for preserving biological diversity
• Heuristic algorithms for the maximum diversity problem
• Variable Neighborhood Search