GRASP and path relinking for the equitable dispersion problem

DOI10.1016/J.COR.2012.04.005MaRDI QIDQ336711zbMATH OpenOpenAlexFDO

Authors Rafael Martí, Fernando Sandoya

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

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

Recommendations

• The equitable dispersion problem
• GRASP and path relinking for the max-min diversity problem
• Construction and improvement algorithms for dispersion problems
• VNS variants for the Max-Mean dispersion problem
• Heuristic solution approaches for the maximum minsum dispersion problem

Cites work

• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• A discrete optimization model for preserving biological diversity
• A hybrid heuristic for the \(p\)-median problem
• Computational aspects of the maximum diversity problem
• GRASP and path relinking for the max-min diversity problem
• Heuristic algorithms for the maximum diversity problem
• Tabu search and GRASP for the maximum diversity problem
• The equitable dispersion problem
• Variable Neighborhood Search

Cited in

(16)

• An exact semidefinite programming approach for the max-mean dispersion problem
• VNS variants for the Max-Mean dispersion problem
• Tabu search and GRASP for the capacitated clustering problem
• Effective metaheuristic algorithms for the minimum differential dispersion problem
• Measuring diversity. A review and an empirical analysis
• Heuristic solution approaches for the maximum minsum dispersion problem
• Tabu search guided by reinforcement learning for the max-mean dispersion problem
• A review on discrete diversity and dispersion maximization from an OR perspective
• Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean 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
• 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
• GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
• Heuristics for the capacitated dispersion problem
• A hybrid heuristic approach based on a quadratic knapsack formulation for the max-mean dispersion problem

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: GRASP and path relinking for the equitable dispersion problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336711)