Heuristics for the capacitated dispersion problem

DOI10.1111/itor.12799OpenAlexW3015523917MaRDI QIDQ6070413

Unnamed Author, Juanjo Peiró, José Javier Laguardia, Rafael Martí

Publication date: 21 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12799

zbMATH Keywords

combinatorial optimizationmetaheuristicsdispersiondiversity maximization

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items

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, An enhanced GRASP approach for the index tracking problem, Formulations and valid inequalities for the capacitated dispersion problem

Cites Work

• Unnamed Item
• GRASP and path relinking for the equitable dispersion problem
• Heuristic solution approaches for the maximum minsum dispersion problem
• Tabu search and GRASP for the maximum diversity problem
• The equitable dispersion problem
• GRASP and path relinking for the max-min diversity problem
• Variable neighborhood search: basics and variants
• Greedy randomized adaptive search procedures
• Facility dispersion problems under capacity and cost constraints
• A branch and bound algorithm for the maximum diversity problem
• Iterated tabu search for the maximum diversity problem
• Hybrid heuristics for the maximum diversity problem
• Heuristic algorithms for the maximum diversity problem
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem